Systems and methods for high-speed searching and filtering of large datasets
AssigneeMoonshadow Mobile, Inc.
InventorRoy W. Ward
Life of this patent
Estimating the term…
Loading patent…
AssigneeMoonshadow Mobile, Inc.
InventorRoy W. Ward
Estimating the term…
A binary data file embodies an inline tree data structure storing fields of a hierarchical dataset. The inline tree comprises first-level binary string segments, each comprising substantially contiguous second-level binary string segments, corresponding to subranges of first and second subsets of data fields. Size is reduced by substituting: binary string indices for alphanumeric strings; a data clump index for a set of correlated/anticorrelated strings; field masks for unoccupied data fields. A dedicated conversion program generates the inline tree from conventional database formats, which is read entirely into RAM to be searched/filtered by a dedicated search/filter program. Small size (<2 bytes/field/record) and contiguous arrangement enables searching/filtering of >106 records (>100 data fields) in <500 nanoseconds/record/core. Recursive subdivision of selection field ranges can guide searches that include those selection fields. One example includes geographic searching/filtering of records that include latitude and longitude fields.
A computer-implemented method comprising:
Dependencies are inferred from the claim text.