Selective use of data structure operations for path query evaluation
US11704309B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jun 29, 2021 |
| Grant date | Jul 18, 2023 |
| Priority date | — |
| Expiry date | Oct 9, 2041 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2453
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The disclosed technologies are capable of selectively using data structure operations for path query evaluation. One technique involves reading a query that traverses at least two nodes and at least one edge of a graph in a graph database; compiling the query into a set of variables and a set of constraints, where the set of variables and the set of constraints correspond to the two nodes and the one edge of the graph; creating an in-memory data structure that comprises a table; using the set of variables and the set of constraints to determine an operation that is performable using the in-memory data structure; checking for an existence of a condition relating to the in-memory data structure or the operation; skipping the operation if the condition exists or executing the operation if the condition does not exist; and storing a set of intermediate query results in the table.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.