Appeal No. 1999-2714
Application No. 08/504,562
character in said file, and creating a second window segment token for
said second window segment by adjusting the base window segment token
to reflect the deletion of the first character of said base window segment
and the addition of said next character in said file in forming the second
window segment.
101. A method for producing a token table from a computer data file in a
memory media, the method comprising, for each of a plurality of fixed
length segments in the data file, the steps of:
(a) generating a first hashing representation for the segment;
(b) generating a second hashing representation for the segment; and
(c) concatenating said first and second hashing representations into a
segment representation.
The prior art of record relied upon by the examiner in rejecting the appealed
claims are as follows:
Queen 4,807,182 Feb. 21, 1989
Metzner, J.J., “A parity Structure for Large Remotely Located Replicated Data Files,”
IEEE Transactions on Computers, pp. 727-730, Vol. C-32, No. 8, Aug. 1983.
Claims 50-56, 72-74, 85, 86, 109-111, 126, and 127 stand rejected under
3
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Next
Last modified: November 3, 2007