Answering relational database queries using graph exploration
US9317557B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 24, 2013 |
| Grant date | Apr 19, 2016 |
| Priority date | — |
| Expiry date | Apr 3, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2456
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Embodiments are directed to processing queries using schema graph traversal and to establishing a schema graph that allows queries to be answered by traversing graph nodes. In one scenario, a computer system receives a query which specifies relational tables and corresponding relationships that are to be retrieved from a relational database. The computer system accesses a schema graph that includes graph nodes representing relational tables, as well as edges that identify relationships between the relational tables. The graph nodes include relational data that was loaded from one storage area (e.g. a non-volatile storage area), and the schema graph is stored in a second storage area (e.g. a volatile storage area). The computer system then traverses the schema graph, beginning at a set of graph nodes and continuing along the edges to other graph nodes until the query has been satisfied, and then reports the results of the graph traversal.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.