Systems and methods for byte-level or quasi byte-level single instancing
First Claim
1. A method of deduplicating data performed by one or more computing systems which are coupled to one or more storage devices via a network, wherein the one or more computing system each comprise at least one processor and memory, and the one or more storage devices include a searchable data structure and a first set of data, the method comprising:
- receiving a second set of data;
dividing the second set of data into at least one block,wherein the one block includes a total number of bytes;
accessing the searchable data structure;
determining whether one or more bytes of the one block are included in a portion of the first set of data in the searchable data structure,wherein the number of the one or more bytes is less than the total number of bytes of the one block;
replacing the one or more bytes with a reference to the portion of the first set of data when the one or more bytes of the one block are included in the portion of the first set of data in the searchable data structure; and
causing the one block to be stored using the one or more storage devices.
4 Assignments
0 Petitions
Accused Products
Abstract
Described in detail herein are systems and methods for deduplicating data using byte-level or quasi byte-level techniques. In some embodiments, a file is divided into multiple blocks. A block includes multiple bytes. Multiple rolling hashes of the file are generated. For each byte in the file, a searchable data structure is accessed to determine if the data structure already includes an entry matching a hash of a minimum sequence length. If so, this indicates that the corresponding bytes are already stored. If one or more bytes in the file are already stored, then the one or more bytes in the file are replaced with a reference to the already stored bytes. The systems and methods described herein may be used for file systems, databases, storing backup data, or any other use case where it may be useful to reduce the amount of data being stored.
-
Citations
20 Claims
-
1. A method of deduplicating data performed by one or more computing systems which are coupled to one or more storage devices via a network, wherein the one or more computing system each comprise at least one processor and memory, and the one or more storage devices include a searchable data structure and a first set of data, the method comprising:
-
receiving a second set of data; dividing the second set of data into at least one block, wherein the one block includes a total number of bytes; accessing the searchable data structure; determining whether one or more bytes of the one block are included in a portion of the first set of data in the searchable data structure, wherein the number of the one or more bytes is less than the total number of bytes of the one block; replacing the one or more bytes with a reference to the portion of the first set of data when the one or more bytes of the one block are included in the portion of the first set of data in the searchable data structure; and causing the one block to be stored using the one or more storage devices. - View Dependent Claims (2, 3, 4)
-
-
5. A system for deduplicating data, the system comprising:
-
at least one processor; memory communicatively coupled to the at least one processor; means for receiving a file including multiple bytes; means for accessing at least some of multiple blocks of data in a data structure; wherein the multiple blocks of data have a first size, wherein the multiple blocks of data represent a set of data having a second size that is greater than the first size, wherein a block of data is associated with multiple first identifiers, and wherein the multiple blocks of data are identified in the data structure by the associated multiple first identifiers; means for determining whether one or more of the multiple bytes are already stored based at least partly upon accessing of the data structure, wherein the number of the one or more bytes is less than a number of bytes in a block of data; and means for causing bytes that are not already stored using a storage device to be stored. - View Dependent Claims (6, 7, 8, 9)
-
-
10. A method of deduplicating data performed by a computing system having a processor and memory, the method comprising:
-
dividing a first set of data into at least one block, wherein the one block includes a total number of bytes; accessing a searchable data structure, wherein the searchable data structure includes a second set of data; determining whether one or more bytes of the one block are included in a portion of the second set of data in the searchable data structure, wherein the number of the one or more bytes is less than the total number of bytes of the one block; replacing the one or more bytes with a reference to the portion of the second set of data, when the one or more bytes of the one block are included in the portion of the second set of data in the searchable data structure; and causing the block to be stored. - View Dependent Claims (11, 12, 13)
-
-
14. A method of building a search data structure for deduplicating data, wherein the method is performed by a computing system having a processor and memory, the method comprising:
-
receiving a set of data; dividing the set of data into at least a first block, wherein the first block includes a number of bytes; accessing a search data structure containing zero or more nodes, wherein each node represents a block including the number of bytes or represents a portion of a block, and wherein each node contains a reference to a stored block, to a portion of a stored block, or to another node; first determining whether the first block is identical to a second block represented by a first node in the search data structure; when a result of the first determining is positive, creating a node in the search data structure representing the first block and containing a reference to the first node; and when a result of the first determining is negative; second determining whether a portion of the first block is identical to a portion of a third block represented by a second node in the search data structure; when a result of the second determining is positive; storing a portion of the first block that is not identical to the portion of the third block; creating a third node in the search data structure representing the portion of the third block and containing a reference to the stored portion of the third block; and creating a node in the search data structure representing the first block and containing a reference to the third node and a reference to the stored portion of the first block; and when a result of the second determining is negative, storing the first block; creating a node in the search data structure representing the first block and containing a reference to the stored first block. - View Dependent Claims (15, 16, 17, 18, 19, 20)
-
Specification