CPC H04J 3/0661 (2013.01) [A61B 5/02405 (2013.01); H04L 47/34 (2013.01); H04L 69/16 (2013.01); H04L 67/12 (2013.01)] | 19 Claims |
1. A key generation system that minimizes key collisions for large data streams, comprising:
one or more processors coupled to a network and to a database, wherein said one or more processors are configured to
receive a multiplicity of records from said network over a time period, wherein each record of said multiplicity of records comprises
record data, and
a record timestamp;
calculate a key for said each record of said multiplicity of records, wherein said key comprises
a timecode portion derived from said record timestamp, and
a hash code portion calculated from said record data; and
wherein said calculate said key does not comprise querying said database; and,
store said each record in said database indexed by said key;
wherein said one or more processors are configured to
receive up to 1,000,000 records per day; and,
calculate said key for said each record, wherein an expected number of records per day that have identical keys is less than or equal to 0.10.
|