Content addressable data storage and compression for semi-persistent computer memory
First Claim
1. A method of content addressable data storage and compression for semi-persistent computer memory comprising:
- searching at a repeating memory interval through a search section of a chunk for a segment of the chunk that matches a memory block from computer memory, including;
calculating a weak checksum for the memory block;
calculating rolling weak checksums for segments of the search section of the chunk;
comparing the rolling weak checksums for the segments with the checksum for the memory block; and
if a segment is found with a rolling weak checksum equal to the weak checksum of the memory block;
calculating a strong checksum for the memory block;
calculating a strong checksum for the segment with the matching rolling weak checksum;
comparing the strong checksum of the memory block and the strong checksum for the segment with the equal rolling weak checksum;
determining that the search has found a segment having contents that match the contents of the memory block if the strong checksum of the memory block and the strong checksum for the segment with the matching rolling weak checksum are equal;
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;
identifying a free memory block of a file system;
storing the unmatched portion semi-persistently in the free memory block; and
providing a retrieval key for the unmatched portion.
1 Assignment
0 Petitions
Accused Products
Abstract
Content addressable data storage and compression for semi-persistent computer memory including providing a chunk of data that is a quantity of input data; retrieving a memory block from semi-persistent 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; identifying a free memory block of a file system; storing the unmatched portion semi-persistently in the free memory block; and providing a retrieval key for the unmatched portion.
31 Citations
33 Claims
-
1. A method of content addressable data storage and compression for semi-persistent computer memory comprising:
-
searching at a repeating memory interval through a search section of a chunk for a segment of the chunk that matches a memory block from computer memory, including;
calculating a weak checksum for the memory block;
calculating rolling weak checksums for segments of the search section of the chunk;
comparing the rolling weak checksums for the segments with the checksum for the memory block; and
if a segment is found with a rolling weak checksum equal to the weak checksum of the memory block;
calculating a strong checksum for the memory block;
calculating a strong checksum for the segment with the matching rolling weak checksum;
comparing the strong checksum of the memory block and the strong checksum for the segment with the equal rolling weak checksum;determining that the search has found a segment having contents that match the contents of the memory block if the strong checksum of the memory block and the strong checksum for the segment with the matching rolling weak checksum are equal; 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; identifying a free memory block of a file system; storing the unmatched portion semi-persistently in the free memory block; and providing a retrieval key for the unmatched portion. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A system for content addressable data storage and compression for semi-persistent computer memory comprising:
-
means for searching at a repeating memory interval through a search section of a chunk for a segment of the chunk that matches a memory block from computer memory, including means for;
calculating a weak checksum for the memory block;
calculating rolling weak checksums for segments of the search section of the chunk;
comparing the rolling weak checksums for the segments with the checksum for the memory block; and
if a segment is found with a rolling weak checksum equal to the weak checksum of the memory block;
calculating a strong checksum for the memory block;
calculating a strong checksum for the segment with the matching rolling weak checksum;
comparing the strong checksum of the memory block and the strong checksum for the segment with the equal rolling weak checksum;means for determining that the search has found a segment having contents that match the contents of the memory block if the strong checksum of the memory block and the strong checksum for the segment with the matching rolling weak checksum are equal; means for discarding a matching segment; means for providing a retrieval key for the memory block as a retrieval key for the matching segment; means for identifying an unmatched portion of the chunk that does not match the memory block; means for identifying a free memory block of a file system; means for storing the unmatched portion semi-persistently in the free memory block; and means for providing a retrieval key for the unmatched portion. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. A computer program product for content addressable data storage and compression for semi-persistent computer memory comprising:
-
a recording medium; means, recorded on the recording medium, for searching at a repeating memory interval through a search section of a chunk for a segment of the chunk that matches a memory block from computer memory, including means, recorded on the recording medium, for;
calculating weak checksum for the memory block;
calculating rolling weak checksums for segments of the search section of the chunk;
comparing the rolling weak checksums for the segments with the checksum for the memory block; and
if a segment is found with a rolling weak checksum equal to the weak checksum of the memory block;
calculating a strong checksum for the memory block;
calculating a strong checksum for the segment with the matching rolling weak checksum;
comparing the strong checksum of the memory block and the strong checksum for the segment with the equal rolling weak checksum;means, recorded on the recording medium, for determining that the search has found a segment having contents that match the contents of the memory block if the strong checksum of the memory block and the strong checksum for the segment with the matching rolling weak checksum are equal; 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; 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 identifying a free memory block of a file computer program product; means, recorded on the recording medium, for storing the unmatched portion semi-persistently in the free memory block; and means, recorded on the recording medium, for providing a retrieval key for the unmatched portion. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30, 31, 32, 33)
-
Specification