# US 2025/0094494 A1 · Systems and methods for using graph data structures

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

- Number: US 2025/0094494 A1
- Document ID: US20250094494A1
- Status: Published application
- Kind: A1
- Application number: 18/891,359
- Filed: 2024-09-20
- Published: 2025-03-20
- Earliest claimed: 2023-09-20
- Assignees: Royal Bank of Canada
- Applicants: Royal Bank of Canada
- Inventors: Jason Xiao Han CHEN
- Web page: https://patentgrep.com/patent/US20250094494A1

## CPC

- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 16/2386: {Bulk updating operations (data conversion details G06F16/258)}
- G06F 16/2453: Query optimisation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

An approach and corresponding computer system adapted for combining relational and non-relational data storage and indexing techniques is proposed. The approach utilizes graph data structures that are specifically configured for supporting performance improvements in relational querying while maintaining the advantages from a non-relational database. The graph data structures can be used for graph traversals and graph operations, among others, which can improve an overall computational complexity level associated with various operations at the cost of storage.

## Claims

### Claim 1

A computer implemented database system, the system comprising a computer processor configured to:
receive one or more data sets for storage in a non-relational database, each of said data sets comprising data elements;
instantiate, prior to a start of a runtime duration, a graph data structure having a plurality of interconnected nodes connected by at least one or more edges;
prior to the start of the runtime duration, populate the graph data structure by performing a mapping of said non-relational database to assign one or more database entries of the non-relational database to each node of said plurality of interconnected nodes, and to assign to the one or more edges a description value or field indicating how the one or more database entries are related to each other;
store the graph data structure e non-relational database;
receive a relational query for said non-relational database;
process said relational query based at least in part on said graph data structure; and
return a result of said relational query.

### Claim 2 (depends on 1)

The system of claim 1, wherein said processing said relational query includes at least one traversal of said graph data structure.

### Claim 3 (depends on 2)

The system of claim 2, wherein the at least one traversal is initiated by traversing the graph data structure to identify a start node and a destination node, and to retrieve data elements based on identifier fields.

### Claim 4 (depends on 3)

The system of claim 3, wherein the at least one traversal includes traversing through the graph data structure and identifying said identifier fields using an _mget function from an elasticsearch library.

### Claim 5 (depends on 4)

The system of claim 4, wherein using the _mget function is executed with O(1) efficiency.

### Claim 6 (depends on 1)

The system of claim 1, wherein the non-relational database is partitioned into a plurality of shards.

### Claim 7 (depends on 2)

The system of claim 2, wherein the query is a bulk query, and processing said bulk query comprises identifying all documents of a set of documents in said graph data structure, walking through said graph data structure to extract an identifier from a document at a destination node, and following an identifier path to a subsequent set of graphs.

### Claim 8 (depends on 7)

The system of claim 7, wherein said walking comprises traversing through multiple layers of data records of the non-relational database.

### Claim 9 (depends on 8)

The system of claim 8, wherein said walking through the graph data structure is repeated until arriving at a destination node, and upon arriving at the destination node, extracting a set of identifiers and querying documents at said destination node.

### Claim 10 (depends on 1)

The system of claim 1, wherein the system is a computing device residing on a computing appliance within a data center and coupled to a computer network bus middleware, providing relational search capabilities to queries for said data center.

### Claim 11

A computer implemented method for improving performance of a database system, the method comprising:
receiving one or more data sets for storage in said non-relational database, each of said data sets comprising data elements;
instantiating, prior to a start of a run-time duration, a graph data structure having a plurality of interconnected nodes connected by at least one or more edges;
prior to the start of the runtime duration, populating the graph data structure by performing a mapping of said non-relational database to assign one or more database entries of the non-relational database to each node of said plurality of interconnected nodes, and to assign to the one or more edges a description value or field indicating how the one or more database entries are related to each other;
storing said graph data structure in said non-relational database;
receiving a relational query for said non-relational database;
processing said relational query based at least in part on said graph data structure; and
returning a result of said relational query.

### Claim 12 (depends on 11)

The method of claim 11, wherein said processing said relational query includes at least one traversal of said graph data structure.

### Claim 13 (depends on 12)

The method of claim 12, wherein the at least one traversal is initiated by traversing the graph data structure to identify a start node and a destination node, and to retrieve data elements based on identifier fields.

### Claim 14 (depends on 13)

The method of claim 13, wherein the at least one traversal includes traversing through the graph data structure and identifying said identifiers using an _mget function form an elasticsearch library.

### Claim 15 (depends on 14)

The method of claim 14, wherein using the _mget function is executed with O(1) efficiency.

### Claim 16 (depends on 11)

The method of claim 11, wherein the non-relational database is portioned into a plurality of shards.

### Claim 17 (depends on 12)

The method of claim 12, wherein the query is a bulk query, and processing said bulk query comprises identifying all documents of a set of documents in said graph data structure, iterating through the graph data structure to extract an identifier from a document at a destination node, and following an identifier path to a subsequent set of graphs.

### Claim 18 (depends on 17)

The method of claim 17, wherein iterating through the graph data structure is repeated through multiple layers of data records of the non-relational database.

### Claim 19 (depends on 18)

The method of claim 18, wherein the iterating through the graph data structure is repeated until arriving at a destination node, and upon arriving at the destination node, extracting a set of identifiers and querying documents at said destination node.

### Claim 20 (depends on 11)

A non-transitory computer readable storage medium having stored thereon processor-executable instructions that, when executed by one or more processors, cause the one or more processors to perform the method according to claim 11.
