Patent · US Active

Efficient compilation of bounded recursive graph queries on top of SQL based relational engine

US12242487B2 · kind B2 · utility

0Cited by

0References

22Claims

0Family size

Assignee

Oracle International Corporation · US

Inventors

Vlad Ioan Haprian · Zürich, CH
Lei Sheng · Redwood City, US
Laurent Daynes · Le Fangeat, FR
Zhen Hua Liu · San Mateo, US
Hugo Kapp · Zürich, CH
Marco Arnaboldi · Zürich, CH
Andrew Witkowski · Foster City, US
Sungpack Hong · Palo Alto, US
Hassan Chafi · San Mateo, US

Key dates

Filing date	Oct 13, 2022
Grant date	Mar 4, 2025
Priority date	—
Expiry date	Nov 20, 2042

Classification

Technology area (CPC G)Physics
CPC primaryG06F16/2433
WIPO fieldComputer technology
WIPO sectorElectrical engineering

Abstract

Techniques support graph pattern matching queries inside a relational database management system (RDBMS) that supports SQL execution. The techniques compile a graph pattern matching query that includes a bounded recursive pattern query into a SQL query that can then be executed by the relational engine. As a result, techniques enable execution of graph pattern matching queries that include bounded recursive patterns on top of the relational engine by avoiding any change in the existing SQL engine.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.