Method and apparatus for creating a short hash handle highly correlated with a globally-unique hash signature
First Claim
Patent Images
1. A computer-implemented method for creating a short hash handle comprising:
- receiving data to be stored from a production system to a replication system;
receiving a hash signature of at least n-bits generated based at least in part on the data;
determining whether or not the lowest n−
1 bits of the received hash signature correspond to an existing short hash handle;
designating a short hash handle based on the determination of whether or not the lowest n−
1 bits of the received hash signature correspond to an existing short hash handle, wherein the designated short hash handle is at least an n-bit short hash handle comprising n−
1 bits associated with the received hash signature and a hash handle bit, the hash handle bit indicating whether or not the lowest n−
1 bits of the received hash signature correspond to an existing short hash handle; and
storing an indication of the relationship of the designated short hash handle to the hash signature.
8 Assignments
0 Petitions
Accused Products
Abstract
Example embodiments of the present invention relate and a method and an apparatus for managing a short hash handle. The method including receiving an I/O including a first identifier for a data block and examining the first identifier in comparison with a second identifier. The data block identified in the I/O then may be managed according to the first identifier and the second identifier.
18 Citations
21 Claims
-
1. A computer-implemented method for creating a short hash handle comprising:
-
receiving data to be stored from a production system to a replication system; receiving a hash signature of at least n-bits generated based at least in part on the data; determining whether or not the lowest n−
1 bits of the received hash signature correspond to an existing short hash handle;designating a short hash handle based on the determination of whether or not the lowest n−
1 bits of the received hash signature correspond to an existing short hash handle, wherein the designated short hash handle is at least an n-bit short hash handle comprising n−
1 bits associated with the received hash signature and a hash handle bit, the hash handle bit indicating whether or not the lowest n−
1 bits of the received hash signature correspond to an existing short hash handle; andstoring an indication of the relationship of the designated short hash handle to the hash signature. - View Dependent Claims (4, 5, 6, 7, 8, 9)
-
-
2. A system comprising:
-
one or more processors; and memory storing computer program code that, when executed on at least one of the one or more processors, causes the at least one of the one or more processors to perform the operations of; receiving data to be stored from a production system to a replication system; receiving a hash signature of at least n-bits generated based at least in part on to the data; determining whether or not the lowest n−
1 bits of the received hash signature correspond to an existing short hash handle;designating a short hash handle based on the determination of whether or not the lowest n−
1 bits of the received hash signature correspond to an existing short hash handle, wherein the designated short hash handle is at least an n-bit short hash handle comprising n−
1 bits associated with the received hash signature and a hash handle bit, the hash handle bit indicating whether or not the lowest n−
1 bits of the received hash signature correspond to an existing short hash handle; andstoring an indication of the relationship of the designated short hash handle to the hash signature. - View Dependent Claims (10, 11, 12, 13, 14, 15)
-
-
3. A computer program product comprising a non-transitory computer readable storage medium having computer program code stored thereon that, when executed on a processor of a computer, causes the computer to perform the operations of:
-
receiving data to be stored from a production system to a replication system; receiving a hash signature of at least n-bits generated based at least in part on the data; determining whether or not the lowest n−
1 bits of the received hash signature correspond to an existing short hash handle;designating a short hash handle based on the determination of whether or not the lowest n−
1 bits of the received hash signature correspond to an existing short hash handle, wherein the designated short hash handle is at least an n-bit short hash handle comprising n−
1 bits associated with the received hash signature and a hash handle bit, the hash handle bit indicating whether or not the lowest n−
1 bits of the received hash signature correspond to an existing short hash handle; andstoring an indication of the relationship of the designated short hash handle to the hash signature. - View Dependent Claims (16, 17, 18, 19, 20, 21)
-
Specification