Patent · US Active

Adaptable adjacency structure for querying graph data

US10839012B2 · kind B2 · utility

0Cited by

4References

18Claims

0Family size

Assignee

SAP SE · DE

Inventors

Jan Bross · Sandhausen, DE
Romans Kasperovics · Speyer, DE
Thomas Fischer · Graz, AT
Cornelia Kinder · Walldorf, DE
Marcus Paradies · Walldorf, DE

Key dates

Filing date	Mar 29, 2018
Grant date	Nov 17, 2020
Priority date	—
Expiry date	Nov 7, 2038

Classification

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

Abstract

A method for executing a graph algorithm is provided. The method may include responding to a request from a client to execute a graph algorithm on graph data stored in a database by determining data required to execute the graph algorithm. In response to determining that a first portion of the data required to execute the graph algorithm is absent from an existing adjacency structure that includes a second portion of the data required to execute the graph algorithm, the existing adjacency structure may be modified to include the first portion of data. The graph algorithm may be executed based on the modified adjacency structure. The execution of the graph algorithm may include querying, based on the modified adjacency structure, the graph data stored in the database. Related systems and articles of manufacture, including computer program products, are also provided.

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