System and method for approximate searching very large data
US10521441B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 2, 2015 |
| Grant date | Dec 31, 2019 |
| Priority date | — |
| Expiry date | Apr 26, 2037 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY02D10/00
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The invention provides efficient searching with fuzzy criteria in very large information systems. The technique of the present invention uses the Pigeonhole Principle approach. This approach can be utilized with different embodiments, but the most effective realization would be to amplify some already given intrinsic approximate matching capabilities, like those in the FuzzyFind method [1][2]. Considering the following problem, data to be searched is presented as a bit-attribute vector. The searching operation includes finding a subset of this bit-attribute vector that is within particular Hamming distance. Normally, this search with approximate matching criteria requires sequential lookup for the whole collection of the attribute vector. This process can be easily parallelized, but in very large information systems this still would be slow and energy consuming. The present invention provides approximate search in very large files using the Pigeonhole Principle, circumvents the sequential search operations and reduces the calculations tremendously.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.