Using temporary tables to store graph algorithm results for a relational database management system
US12124448B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 26, 2022 |
| Grant date | Oct 22, 2024 |
| Priority date | — |
| Expiry date | Jan 26, 2042 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/28
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
An RDBMS specifies a graph algorithm function (GAF) that takes a graph object as input and returns a logical graph object as output. GAFs are used within graph queries to compute temporary and output properties (“GAF-computed properties”), which are live for the duration of the query cursor execution. GAF-computed output properties are accessible in the enclosing graph pattern matching query as though they were part of the input graph object of the GAF. Temporary cursor-duration tables are generated for the query cursor during compilation of a graph query that includes a GAF, and are used to store the GAF-computed properties. Each temporary table corresponds to one of the primary tables of the input graph, and includes, as a foreign key, primary key information from the corresponding primary table.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.