Patent · US Active

Adjacency structures for executing graph algorithms in a relational database

US10546021B2 · kind B2 · utility

1Cited by

1References

17Claims

0Family size

Assignee

SAP SE · DE

Inventors

Thomas Fischer · Graz, AT
Hinnerk Gildhoff · Heidelberg, DE
Romans Kasperovics · Speyer, DE
Cornelia Kinder · Walldorf, DE
Marcus Paradies · Walldorf, DE

Key dates

Filing date	Jan 30, 2017
Grant date	Jan 28, 2020
Priority date	—
Expiry date	Jun 12, 2037

Classification

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

Abstract

A system for processing graph-modeled data in a relational database is provided. The system can include at least one data processor and at least one memory storing instructions that are executed by the at least one data processor. Executing the instructions can result in operations comprising: receiving a request to execute a graph algorithm operating on graph-modeled data stored at a relational database; and executing the graph algorithm within the relational database, the executing comprising use of an adjacency structure within the relational database. Related methods and articles of manufacture, including computer program products, are also provided.

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