High-efficiency selection of runtime rules for programmable search
US8843495B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 12, 2013 |
| Grant date | Sep 23, 2014 |
| Priority date | — |
| Expiry date | Aug 12, 2033 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/319
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method and associated systems for the efficient selection of runtime rules for programmable search engines, in which a processor of a computer system translates a set of programmable search-engine runtime rules into a set of fielded documents and then partitions the fielded documents into optimized clusters that are each in turn converted into an inverted index. When a user submits a query, the search engine converts the query into a set of fielded queries and uses the set of inverted indices and the set of fielded queries to identify a candidate subset of the runtime rules. The search engine matches this candidate subset against the input query to select a final set of applicable runtime rules.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.