METHOD AND SYSTEMS FOR EFFICIENT DELIVERY OF PREVIOUSLY STORED CONTENT
First Claim
1. ) A method for creating efficient updates to a previously stored file, said method comprising:
- (a) receiving a first file comprising a first plurality of sequences of data;
(b) receiving a second file comprising a second plurality of sequences of data;
(c) creating a hash table having a plurality of entries, each of the plurality of entries corresponding to a respective one of the first plurality of sequences, and wherein at least two of said entries correspond to overlapping sequences of data;
(d) computing hash values for said second plurality of sequences of data;
(e) comparing each of the second plurality of sequences of data with sequences from the first plurality of sequences having the same hash value to determine sequences of data present in both files;
(f) storing representations of lengths and locations of said sequences of data present in both the first and second files and (g) creating a third file comprising sequences of data from the second file and representations of locations and lengths of said sequences of data present in both the first and second files.
7 Assignments
0 Petitions
Accused Products
Abstract
Systems and methods for reducing file sizes for files delivered over a network are disclosed. A method comprises receiving a first file comprising sequences of data; creating a hash table having entries corresponding to overlapping sequences of data; receiving a second file comprising sequences of data; comparing each of the sequences of data in the second file to the sequences of data in the hash table to determine sequences of data present in both the first and second files; and creating a third file comprising sequences of data from the second file and representations of locations and lengths of said sequences of data present in both the first and second files.
99 Citations
26 Claims
-
1. ) A method for creating efficient updates to a previously stored file, said method comprising:
-
(a) receiving a first file comprising a first plurality of sequences of data; (b) receiving a second file comprising a second plurality of sequences of data; (c) creating a hash table having a plurality of entries, each of the plurality of entries corresponding to a respective one of the first plurality of sequences, and wherein at least two of said entries correspond to overlapping sequences of data; (d) computing hash values for said second plurality of sequences of data; (e) comparing each of the second plurality of sequences of data with sequences from the first plurality of sequences having the same hash value to determine sequences of data present in both files; (f) storing representations of lengths and locations of said sequences of data present in both the first and second files and (g) creating a third file comprising sequences of data from the second file and representations of locations and lengths of said sequences of data present in both the first and second files. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A method for efficiently receiving updates to previously stored files, said method comprising:
-
(a) receiving a first file comprising sequences of data; (b) receiving a second file comprising sequences of data and representations of locations and lengths of sequences in the first file; and (c) executing a Javascript function to create a third file comprising sequences of data from the second file and sequences in the first file indicated by the second file. - View Dependent Claims (13, 14, 15)
-
-
16. A computer system for creating efficient updates to a previously stored file, said system comprising:
-
a transceiver which receives a first and second file, each file comprising a respective plurality of sequences of data; a hash engine which communicates with said transceiver and computes hash values for sequences of data in the first and second file, wherein at least two of said sequences overlap, and determines sequences of data present in both the first and second files; a storage element which communicates with said hash engine and which stores representations of the lengths and locations of said sequences present in both the first and second files; and a processor which communicates with said storage element and which creates a third file comprising sequences of data from the second file and representations of lengths and locations of said sequences present in both files. - View Dependent Claims (17, 18, 19, 20, 21, 22, 23, 24, 25, 26)
-
Specification