System and method for unorchestrated determination of data sequences using sticky byte factoring to determine breakpoints in digital sequences
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Oct 26, 2004
Grant Date -
Oct 17, 2002
app pub date -
Feb 5, 2001
filing date -
Nov 6, 2000
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
A system and method for unorchestrated determination of data sequences using 'sticky byte' factoring to determine breakpoints in digital sequences such that common sequences can be identified. Sticky byte factoring provides an efficient method of dividing a data set into pieces that generally yields near optimal commonality. This is effectuated by employing a rolling hashsum and, in an exemplary embodiment disclosed herein, a threshold function to deterministically set divisions in a sequence of data. Both the rolling hash and the threshold function are designed to require minimal computation. This low overhead makes it possible to rapidly partition a data sequence for presentation to a factoring engine or other applications that prefer subsequent synchronization across the data set.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully