Transparent content addressable data storage and compression for a file system
First Claim
1. A method of transparent content addressable data storage and compression for a file system comprising:
- providing a data structure that associates file identifiers and retrieval keys for memory blocks for storing file contents;
storing in the data structure one or more file identifiers;
providing a chunk of data comprising a quantity of input data of a file;
retrieving a memory block from computer memory;
searching for a segment of the chunk that matches the memory block; and
if a matching segment is found;
discarding the matching segment, providing a retrieval key for the memory block as a retrieval key for the matching segment, and storing in the data structure the retrieval key for the matching segment in association with a file identifier; and
identifying an unmatched portion of the chunk that does not match the memory block, storing the unmatched portion, providing a retrieval key for the unmatched portion, and storing in the data structure the retrieval key for the unmatched portion in association with the file identifier.
1 Assignment
0 Petitions
Accused Products
Abstract
Transparent content addressable data storage and compression for a file system including providing a data structure that associates file identifiers and retrieval keys for memory blocks for storing file contents; storing in the data structure one or more file identifiers; providing a chunk of data comprising a quantity of input data of a file; retrieving a memory block from computer memory; searching for a segment of the chunk that matches the memory block; and if a matching segment is found: discarding the matching segment; providing a retrieval key for the memory block as a retrieval key for the matching segment; identifying an unmatched portion of the chunk that does not match the memory block; storing the unmatched portion; and providing a retrieval key for the unmatched portion.
58 Citations
27 Claims
-
1. A method of transparent content addressable data storage and compression for a file system comprising:
-
providing a data structure that associates file identifiers and retrieval keys for memory blocks for storing file contents;
storing in the data structure one or more file identifiers;
providing a chunk of data comprising a quantity of input data of a file;
retrieving a memory block from computer memory;
searching for a segment of the chunk that matches the memory block; and
if a matching segment is found;
discarding the matching segment, providing a retrieval key for the memory block as a retrieval key for the matching segment, and storing in the data structure the retrieval key for the matching segment in association with a file identifier; and
identifying an unmatched portion of the chunk that does not match the memory block, storing the unmatched portion, providing a retrieval key for the unmatched portion, and storing in the data structure the retrieval key for the unmatched portion in association with the file identifier. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A system of transparent content addressable data storage and compression for a file system comprising:
-
means for providing a data structure that associates file identifiers and retrieval keys for memory blocks for storing file contents;
means for storing in the data structure one or more file identifiers;
means for providing a chunk of data comprising a quantity of input data of a file;
means for retrieving a memory block from computer memory;
means for searching for a segment of the chunk that matches the memory block;
means for discarding a matching segment, means for providing a retrieval key for the memory block as a retrieval key for the matching segment, and means for storing in the data structure the retrieval key for the matching segment in association with a file identifier; and
means for identifying an unmatched portion of the chunk that does not match the memory block, means for storing the unmatched portion, means for providing a retrieval key for the unmatched portion, and means for storing in the data structure the retrieval key for the unmatched portion in association with the file identifier. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A computer program product of transparent content addressable data storage and compression for a file computer program product comprising:
-
a recording medium;
means, recorded on the recording medium, for providing a data structure that associates file identifiers and retrieval keys for memory blocks for storing file contents;
means, recorded on the recording medium, for storing in the data structure one or more file identifiers;
means, recorded on the recording medium, for providing a chunk of data comprising a quantity of input data of a file;
means, recorded on the recording medium, for retrieving a memory block from computer memory;
means, recorded on the recording medium, for searching for a segment of the chunk that matches the memory block;
means, recorded on the recording medium, for discarding a matching segment, means, recorded on the recording medium, for providing a retrieval key for the memory block as a retrieval key for the matching segment, and means, recorded on the recording medium, for storing in the data structure the retrieval key for the matching segment in association with a file identifier; and
means, recorded on the recording medium, for identifying an unmatched portion of the chunk that does not match the memory block, means, recorded on the recording medium, for storing the unmatched portion, means, recorded on the recording medium, for providing a retrieval key for the unmatched portion, and means, recorded on the recording medium, for storing in the data structure the retrieval key for the unmatched portion in association with the file identifier. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27)
-
Specification