Query tree labeling and processing
US11966401B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 24, 2020 |
| Grant date | Apr 23, 2024 |
| Priority date | — |
| Expiry date | Aug 27, 2041 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/24539
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Systems and techniques are provided for query tree labeling and processing. A query may be received. A query tree may be generated from the query and identifiers may be generated for nodes of the query tree and stored in the nodes. Labels may be stored in nodes determined to meet at least one criteria for being labeled nodes to generate a labeled query tree. The nodes of the labeled query tree may be processed by receiving results from an entry in a results data structure and returning the results from the entry as the results for the node if the identifier of the nodes matches the identifier of an entry in the results data structure. If there is no match, results may be computed for the node. The results generated by computing the node may be stored in the results data structure if the node has a label.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.