Efficient multiple-keyword match technique with large dictionaries
US8606772B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 26, 2011 |
| Grant date | Dec 10, 2013 |
| Priority date | — |
| Expiry date | Jul 14, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/3331
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
One embodiment relates to a computer-implemented method for multiple-keyword matching performed using a computer including at least a processor, data storage, and computer-readable instructions. A keyword set and a text string to be searched are obtained. A suffix sorting procedure is applied to the text string to create a suffix index array. A dual binary keyword search procedure is applied to a reference list of suffix strings presented by the suffix index array. The dual binary keyword search procedure may apply a recursive function that utilizes a divide-and-conquer process and may have inputs of a results list, the suffix index array, and the keyword set. The recursive function may add a range of items to the results list if a keyword is determined to be a prefix of a suffix string in the reference list. Other embodiments, aspects, and features are also disclosed.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.