SYSTEM AND METHOD FOR ORGANIZING DATA TO FACILITATE DATA DEDUPLICATION

• US 20100088296A1
• Filed: 10/03/2008
• Published: 04/08/2010
• Est. Priority Date: 10/03/2008
• Status: Abandoned Application

• Current Assignee: NetApp, Inc.
• Original Assignee: NetApp, Inc.
• Inventors: Khona, Rahul, Periyagaram, Subramanian, Yadav, Sandeep, Pawar, Dnyaneshwar
• Application Number:
  US12/245,669
• Publication Number:
  US 20100088296A1
• Time in Patent Office: Days
• US Class Current: 707/705
• CPC Class Codes: G06F 11/1453 using de-duplication of the data
• CPC Class Codes: G06F 16/1752 based on file chunks
• CPC Class Codes: G06F 16/183 Provision of network file services by network file servers, e.g. by using NFS, CIFS network file access protocols H04L67/1097
• CPC Class Codes: G06F 3/061 Improving I/O performance
• CPC Class Codes: G06F 3/0641 De-duplication techniques
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching

Abstract

A technique for organizing data to facilitate data deduplication includes dividing a block-based set of data into multiple “chunks”, where the chunk boundaries are independent of the block boundaries (due to the hashing algorithm). Metadata of the data set, such as block pointers for locating the data, are stored in a tree structure that includes multiple levels, each of which includes at least one node. The lowest level of the tree includes multiple nodes that each contain chunk metadata relating to the chunks of the data set. In each node of the lowest level of the buffer tree, the chunk metadata contained therein identifies at least one of the chunks. The chunks (user-level data) are stored in one or more system files that are separate from the buffer tree and not visible to the user.

Claims

1. A method comprising:

dividing a set of data which is defined as a plurality of blocks into a plurality of chunks in a network storage system, wherein boundaries of the chunks are independent of boundaries of the blocks; and

storing metadata of the set of data, including pointers for locating the data, in a hierarchical structure in the network storage system, the hierarchical structure including a plurality of levels, each level including at least one node;

wherein a lowest level of the plurality of levels includes a plurality of nodes that each contain chunk metadata, and in each said node that contains chunk metadata, the chunk metadata identifies at least one of the chunks.

2. A method as recited in claim 1, wherein the nodes in the lowest level of the hierarchical structure do not contain any portion of the set of data.

3. A method as recited in claim 2, further comprising:

sharing a chunk, of the plurality of chunks, between a plurality of files, wherein each of the plurality of files is represented by a separate hierarchical structure, and wherein the hierarchical structure of each said file includes a lowest level node containing chunk metadata that identifies the shared chunk.

4. A method as recited in claim 1, further comprising:

writing the plurality of chunks into a plurality of chunk files.

5. A method as recited in claim 1, wherein each of the chunks is written into a separate chunk file, such that each chunk file includes only one chunk.

6. A method as recited in claim 1, wherein at least one of the chunk files includes two or more of the chunks.

7. A method as recited in claim 1, further comprising locating requested data in the set of data in response to a data access request, by:

using pointers in the hierarchical structure to locate a node in the lowest level of the hierarchical structure;

using chunk metadata in said node in the lowest level of the hierarchical structure to locate a chunk which contains the requested data; and

retrieving the requested data from a chunk file which contains the chunk which contains the requested data.

8. A method as recited in claim 7, wherein the chunk metadata in each of the nodes at the lowest level of the hierarchy includes:

chunk identifier metadata that identifies a chunk file;

an offset value that indicates an offset within the identified chunk file; and

a length value that indicates a length of data from the offset within the chunk file.

9. A method of storing data in a network storage system to facilitate data deduplication, the method comprising:

determining a plurality of anchor points for a set of data defined as a plurality of blocks in the network storage system, wherein the anchor points are independent of boundaries of the plurality of blocks;

dividing the set of data into a plurality of chunks according to the plurality of anchor points;

writing the plurality of chunks into a plurality of chunk files;

storing metadata including block pointers of the set of data in a hierarchical structure in the network storage system, the hierarchical structure including a plurality of levels, each said level including at least one node, wherein a lowest level of the plurality of levels includes a plurality of nodes that each store chunk metadata, wherein in each said node that contains chunk metadata the chunk metadata identifies at least one chunks in the plurality chunk files, wherein the nodes in the lowest level of the hierarchical structure do not contain any portion of the set of data; and

sharing a chunk, of the plurality of chunks, between two files to reduce duplication of data in said chunk, wherein each of the two files is represented by a hierarchical structure that includes a lowest-level node that includes chunk metadata identifying the shared chunk.

10. A method as recited in claim 9, wherein each of the nodes at the lowest level of the hierarchy contains chunk metadata that includes:

chunk identifier metadata that identifies a chunk file;

an offset value that indicates an offset within the identified chunk file; and

a length value that indicates a length of data from the offset within the chunk file.

11. A method comprising:

receiving at a network storage server a first request for data stored in a file system of the network storage server, wherein the data is part of a set of data defined in terms of a plurality of blocks, the first request specifying a file block number of the data and a root node identifier of a root node containing metadata of the data;

in response to the first request, retrieving the data from a stable storage of the network storage server into a buffer cache of the network storage server and sending the data to a requester;

receiving a second request for said data at the network storage server, the second request specifying a file block number of the data and a root node identifier of a root node containing metadata of the data, wherein the file block number and the root node identifier specified by the second request are different from, respectively, the file block number and the root node identifier specified by the first request; and

in response to the second request,

determining that the data is already in the buffer cache, and

providing the data from the buffer cache to a sender of the second request without having to reload the data into the buffer cache.

12. A method as recited in claim 11, wherein determining that the data is already in the buffer cache comprises:

identifying the data by using said file block number and said root node identifier to locate chunk metadata identifying a chunk, wherein boundaries of the chunk are not dependent upon block boundaries of any of the plurality of blocks; and

using the chunk metadata to identify the data.

13. A storage controller comprising:

a communication interface through which to communicate with a storage client over a network;

a storage interface through which to communicate with a stable storage facility;

a processor coupled to the communication interface and the storage interface; and

a storage medium containing code which, when executed by the processor, causes the storage controller to perform a process that includes

dividing a set of data into a plurality of chunks according to a plurality of anchor points, the data set including a plurality of blocks, wherein the anchor points are independent of boundaries of the blocks, and

storing metadata, including pointers for locating the data, in a hierarchical structure, the hierarchical structure including a plurality of levels, each level including at least one node, wherein a lowest level of the plurality of levels includes a plurality of nodes that each contain chunk metadata, wherein in each said node that contains chunk metadata, the chunk metadata identifies at least one of the chunks.

14. A storage controller as recited in claim 13, wherein the nodes in the lowest level of the hierarchical structure do not contain any portion of the set of data.

15. A storage controller as recited in claim 13, wherein said process further includes:

sharing a chunk, of the plurality of chunks, between a plurality of files, wherein each of the plurality of files is represented by a separate hierarchical structure, and wherein the hierarchical structure of each said file includes a lowest level node containing chunk metadata that identifies the shared chunk.

16. A storage controller as recited in claim 13, wherein said process further includes:

writing the plurality of chunks into a plurality of chunk files.

17. A storage controller as recited in claim 13, wherein each of the chunks is written into a separate chunk file, such that each chunk file includes only one chunk.

18. A storage controller as recited in claim 13, wherein at least one of the chunk files includes two or more of the chunks.

19. A storage controller as recited in claim 13, wherein said process further includes locating requested data in the set of data in response to a data access request, by:

using pointers in the hierarchical structure to locate a node in the lowest level of the hierarchical structure;

using chunk metadata in said node in the lowest level of the hierarchical structure to locate a chunk which contains the requested data; and

retrieving the requested data from a chunk file which contains the chunk which contains the requested data.

20. A storage controller as recited in claim 19, wherein the chunk metadata in each of the nodes at the lowest level of the hierarchy includes:

chunk identifier metadata that identifies a chunk file;

an offset value that indicates an offset within the identified chunk file; and

a length value that indicates a length of data from the offset within the chunk file.

21. A network storage system comprising:

means for communicating with a plurality of storage clients over a network;

means for determining a plurality of anchor points for a set of data defined as a plurality of blocks;

means for dividing the set of data into a plurality of chunks according to the plurality of anchor points, wherein boundaries of the chunks are independent of boundaries of the plurality of blocks;

means for writing the plurality of chunks into a plurality of chunk files;

means for storing metadata including block pointers of the set of data in a hierarchical structure in the network storage system, the hierarchical structure including a plurality of levels, each said level including at least one node, wherein a lowest level of the plurality of levels includes a plurality of nodes that each store chunk metadata, wherein in each said node that contains chunk metadata the chunk metadata identifies at least one chunk in the plurality chunk files; and

means for sharing a chunk, of the plurality of chunks, between two files to reduce duplication of data in said chunk, wherein each of the two files is represented by a hierarchical structure that includes a lowest-level node that includes chunk metadata identifying the shared chunk.

22. A network storage system as recited in claim 21, wherein each of the nodes at the lowest level of the hierarchy contains chunk metadata that includes:

chunk identifier metadata that identifies a chunk file;

an offset value that indicates an offset within the identified chunk file; and

a length value that indicates a length of data from the offset within the chunk file.

23. A machine-readable storage medium storing instructions which, when executed by a machine, cause the machine to perform a method of storing data in a network storage system to facilitate data deduplication, the method comprising:

determining a plurality of anchor points for a set of data defined as a plurality of blocks in the network storage system, wherein the anchor points are independent of boundaries of the plurality of blocks;

dividing the set of data into a plurality of chunks according to the plurality of anchor points;

writing the plurality of chunks into a plurality of chunk files;

storing metadata including block pointers of the set of data in a hierarchical structure in the network storage system, the hierarchical structure including a plurality of levels, each said level including at least one node, wherein a lowest level of the plurality of levels includes a plurality of nodes that each store chunk metadata, wherein in each said node that contains chunk metadata the chunk metadata identifies at least one chunk in the plurality chunk files; and

sharing a chunk, of the plurality of chunks, between two files to reduce duplication of data in said chunk, wherein each of the two files is represented by a hierarchical structure that includes a lowest-level node that includes chunk metadata identifying the shared chunk.

24. A machine-readable storage medium as recited in claim 23, wherein each of the nodes at the lowest level of the hierarchy contains chunk metadata that includes:

chunk identifier metadata that identifies a chunk file;

an offset value that indicates an offset within the identified chunk file; and

a length value that indicates a length of data from the offset within the chunk file.