Methods and systems for latency-free contacts search
US8898186B2 · kind B2 · utility
1Cited by
78References
28Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | May 10, 2011 |
| Grant date | Nov 25, 2014 |
| Priority date | — |
| Expiry date | Sep 6, 2032 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2246
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Systems and methods for performing latency-free contact searches using two-level indexed data structures having decreasing integer sets as identifiers to represent actual contact data. The indexed data structures are stored in distributed memory. Data operations such as intersection and union are performed using the indexed data structures. A binary interval reduction technique is used to quickly move through the data sets looking for common elements for the intersection set, or unique elements to add to the union set.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.