Partitioning a data stream using embedded anchors

Electrical computers and digital processing systems: multicomput – Computer-to-computer data modifying – Compressing/decompressing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07979584

ABSTRACT:
Selecting a segment boundary within block b is disclosed. A first anchor location j|j+1 is identified wherein a value of f(b[j−A+1 . . . j+B]) satisfies a constraint and wherein A and B are non-negative integers. A segment boundary location k|k+1 is determined wherein k is greater than minimum distance from j.

REFERENCES:
patent: 5990810 (1999-11-01), Williams
patent: 6667700 (2003-12-01), McCanne et al.
patent: 2004/0172600 (2004-09-01), Evans
patent: 2008/0013830 (2008-01-01), Patterson et al.
Udi Mamber. “Finding Similar Files in a Large File System.” In proceedings of the USENIX Winter 1994 Technical Conference, pp. 1-10, San Francisco, CA, 17-21, 1994.
Schleimer et al. “Winnowing: Local Algorithms for Document Fingerprinting.” SIGMOD 2003, Jun. 9-12, 2003, San Diego, CA. pp. 76-85.
Kulkarni et al. “Redundancy Elimination Within Large Collections of Files.” 2004 USENIX Annual Technical Conference, Boston, MA, Jun. 2004.
Andrei Z. Broder. “Some applications of Rabin's fingerprinting method.” In R. Capocelli, A. De Santis and U. Vaccaro, editors, Sequences II: Methods in Communications, Security, and Computer Science, Springer Verlag, 1993.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Partitioning a data stream using embedded anchors does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Partitioning a data stream using embedded anchors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partitioning a data stream using embedded anchors will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2628723

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.