Trie search engine
US11126624B2 · kind B2 · utility
0Cited by
11References
8Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jun 11, 2018 |
| Grant date | Sep 21, 2021 |
| Priority date | — |
| Expiry date | Jul 4, 2039 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/951
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method of searching a database that includes executing a trie search algorithm on a first portion of data in the database, returning a tag narrowing a location of the first portion of data to optimize the database, and performing a directed search of the optimized database by executing the trie search algorithm again on the optimized database, where the trie search algorithm is an information retrieval data structure using a M-ary tree where each node consists of a M-positional vector of pointers.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.