# US 2026/0064774 A1 · On-The-Fly Main Memory Graph Indexes For Index Based Graph Algorithm Runtime In An RDBMS

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0064774 A1
- Document ID: US20260064774A1
- Status: Published application
- Kind: A1
- Application number: 19/047,366
- Filed: 2025-02-06
- Published: 2026-03-05
- Earliest claimed: 2024-08-29
- Assignees: Oracle International Corporation
- Applicants: Oracle International Corporation
- Inventors: Marco Arnaboldi; Aleksa Milisavljevic; Hugo Kapp; Laurent Phillipe Daynes; Vlad Ioan Haprian
- Web page: https://patentgrep.com/patent/US20260064774A1

## CPC

- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 16/2282: {Tablespace storage structures; Management thereof}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In response to a user invoking a graph operation on a graph in an in-memory graph algorithm (IMGA) runtime in a relational database management system (RDBMS), the RDBMS generates a set of one or more graph indexes in memory. The graph is represented as one or more vertex tables and one or more edge tables. The RDBMS generates the set of one or more graph indexes by generating a mapping of each database table vertex identifier to a corresponding internal identifier. For each edge table of the one or more edge tables, the RDBMS generates a graph index data structure representing edges of the edge table. The graph index data structure represents each edge in the edge table as a source internal identifier and a destination internal identifier. The RDBMS can then execute the graph operation in the IMGA runtime using the set of one or more graph indexes.

## Claims

### Claim 1

A method comprising:
in response to a user invoking a graph operation on a graph in an in-memory graph algorithm (IMGA) runtime in a relational database management system (RDBMS), generating a set of one or more graph indexes in memory, wherein:
the graph is represented in the RDBMS as one or more vertex tables and one or more edge tables, and
generating the set of one or more graph indexes comprises:
generating a mapping of each database table vertex identifier in the one or more vertex tables to a corresponding internal identifier; and
for each edge table of the one or more edge tables, generating a graph index data structure representing edges of the edge table, wherein the graph index data structure represents each edge in the edge table as a source internal identifier and a destination internal identifier; and
executing the graph operation in the IMGA runtime using the set of one or more graph indexes,
wherein the method is performed by one or more computing devices.

### Claim 2 (depends on 1)

The method of claim 1, wherein generating the set of one or more graph indexes further comprises:
initializing a property graph topology data structure containing metadata about the graph;
adding a pointer to the mapping to the property graph topology data structure; and
adding a pointer to the graph index data structure to the property graph topology data structure.

### Claim 3 (depends on 2)

The method of claim 2, wherein the metadata about the graph comprises at least one of:
a number of vertex tables,
a number of edge tables,
information about the one or more vertex tables, or
information about the one or more edge tables.

### Claim 4 (depends on 2)

The method of claim 2, wherein:
the metadata about the graph comprises an indication that one or more reverse graph index data structures are to be used for the graph operation, and
generating the set of one or more graph indexes further comprises, for each edge table of the one or more edge tables, generating a reverse graph index data structure representing edges of the edge table and adding a pointer to the reverse graph index data structure to the property graph topology data structure, wherein the reverse graph index data structure represents each edge in the edge table as a destination internal identifier and a source internal identifier.

### Claim 5 (depends on 1)

The method of claim 1, wherein the database table vertex identifier comprises a row identifier or a primary key of a corresponding vertex table.

### Claim 6 (depends on 1)

The method of claim 1, wherein the graph index data structure is a compressed sparse row (CSR) data structure.

### Claim 7 (depends on 1)

The method of claim 1, wherein:
the graph operation generates an intermediate result comprising one or more output properties ordered with respect to internal identifier, and
executing the graph operation comprising fetching a database table vertex identifier for each internal identifier in the intermediate result.

### Claim 8 (depends on 1)

The method of claim 1, wherein invocation of the graph operation specifies an input vertex identifier, the method further comprising generating a vertex identifier object based on the input vertex identifier.

### Claim 9 (depends on 8)

The method of claim 8, wherein the vertex identifier object includes:
a graph owner,
a graph name,
an element table, and
a key value.

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
in response to completion of execution of the graph operation, removing the set of one or more graph indexes from memory.

### Claim 11

One or more non-transitory computer-readable media storing instructions which, when executed by one or more processors, cause:
in response to a user invoking a graph operation on a graph in an in-memory graph algorithm (IMGA) runtime in a relational database management system (RDBMS), generating a set of one or more graph indexes in memory, wherein:
the graph is represented in the RDBMS as one or more vertex tables and one or more edge tables, and
generating the set of one or more graph indexes comprises:
generating a mapping of each database table vertex identifier in the one or more vertex tables to a corresponding internal identifier; and
for each edge table of the one or more edge tables, generating a graph index data structure representing edges of the edge table, wherein the graph index data structure represents each edge in the edge table as a source internal identifier and a destination internal identifier; and
executing the graph operation in the IMGA runtime using the set of one or more graph indexes.

### Claim 12 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein generating the set of one or more graph indexes further comprises:
initializing a property graph topology data structure containing metadata about the graph;
adding a pointer to the mapping to the property graph topology data structure; and
adding a pointer to the graph index data structure to the property graph topology data structure.

### Claim 13 (depends on 12)

The one or more non-transitory computer-readable media of claim 12, wherein the metadata about the graph comprises at least one of:
a number of vertex tables,
a number of edge tables,
information about the one or more vertex tables, or
information about the one or more edge tables.

### Claim 14 (depends on 12)

The one or more non-transitory computer-readable media of claim 12, wherein:
the metadata about the graph comprises an indication that one or more reverse graph index data structures are to be used for the graph operation, and
generating the set of one or more graph indexes further comprises, for each edge table of the one or more edge tables, generating a reverse graph index data structure representing edges of the edge table and adding a pointer to the reverse graph index data structure to the property graph topology data structure, wherein the reverse graph index data structure represents each edge in the edge table as a destination internal identifier and a source internal identifier.

### Claim 15 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein the database table vertex identifier comprises a row identifier or a primary key of a corresponding vertex table.

### Claim 16 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein the graph index data structure is a compressed sparse row (CSR) data structure.

### Claim 17 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein:
the graph operation generates an intermediate result comprising one or more output properties ordered with respect to internal identifier, and
executing the graph operation comprising fetching a database table vertex identifier for each internal identifier in the intermediate result.

### Claim 18 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein invocation of the graph operation specifies an input vertex identifier, wherein the instructions further cause generating a vertex identifier object based on the input vertex identifier.

### Claim 19 (depends on 18)

The one or more non-transitory computer-readable media of claim 18, wherein the vertex identifier object includes:
a graph owner,
a graph name,
an element table, and
a key value.

### Claim 20 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein the instructions, when executed by the one or more processors, further cause:
in response to completion of execution of the graph operation, removing the set of one or more graph indexes from memory.
