# US 12,001,482 B2 · Method of generating integrated graph using distributed graph

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

- Number: US 12,001,482 B2
- Document ID: US12001482B2
- Status: Granted
- Kind: B2
- Application number: 17/842,226
- Filed: 2022-06-16
- Published: 2023-08-10
- Granted: 2024-06-04
- Earliest claimed: 2022-02-04
- Assignees: S2W Inc.
- Applicants: S2W Inc.
- Inventors: Chan Hee Lee; Jae Min Choi; Soo Yeon Park; Keun Tae Park
- Web page: https://patentgrep.com/patent/US12001482B2

## CPC

- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 16/28: Databases characterised by their database models, e.g. relational or object models
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The present disclosure relates to a method of generating, by a terminal, an integrated graph using a distributed graph including: receiving source node information from a user; identifying, by a graph types module, a location of a graph database related to a type of a source node based on the source node information; requesting, by a graph manager module, graph data to an application corresponding to the location of the graph database; receiving the graph data from the application; and integrating, by a graph integration module, a node and an edge based on the source node and the graph data to generate the integrated graph.

## Claims

### Claim 1

A method of generating, by a terminal, an integrated graph using a distributed graph, the method comprising:
receiving a request message from a user, the request message including source node information and information on a number of hops corresponding to a number of layers of the integrated graph;
based on the source node information, identifying, by a graph types module, a location of a graph database related to a type of a source node among a plurality of graph databases respectively corresponding to a plurality of applications;
requesting, by a graph manager module, graph data to an application corresponding to the location of the graph database among the plurality of applications;
receiving the graph data from the application; and
integrating, by a graph integration module, a node and an edge based on the source node and the graph data to generate the integrated graph,
wherein the number of neighbor nodes of a specific node among a plurality of nodes of the integrated graph is set to be less than or equal to a specific value, the neighbor nodes being nodes in a lower layer of the specific node among the layers of the integrated graph.

### Claim 2 (depends on 1)

The method of claim 1, wherein the identifying of the location of the graph database is based on a mapping file preset in the graph types module, and
the mapping file includes location information of a graph database mapped to the type.

### Claim 3 (depends on 1)

The method of claim 1, wherein a node of the integrated graph includes (1) an identifier, (2) property, and (3) type information.

### Claim 4 (depends on 3)

The method of claim 3, wherein an edge of the integrated graph includes (1) an identifier of a node connected to the edge, (2) label information, and (3) type information connected to the edge.

### Claim 5 (depends on 1)

The method of claim 1, wherein the integrated graph is generated based on the number of hops.

### Claim 6

A terminal for generating an integrated graph using a distributed graph, the terminal comprising:
an application programming interface (API) that receives a request message from a user, the request message including source node information and information on a number of hops corresponding to a number of layers of the integrated graph;
a graph types module that confirms, based on the source node information, a location of a graph database related to a type of a source node among a plurality of graph databases respectively corresponding to a plurality of applications;
a graph manager module that requests graph data to an application corresponding to the location of the graph database among the plurality of applications and receives the graph data from the application; and
a graph integration module that generates the integrated graph by integrating a node and an edge based on the source node and the graph data,
wherein the number of neighbor nodes of a specific node among a plurality of nodes of the integrated graph is set to be less than or equal to a specific value, the neighbor nodes being nodes in a lower layer of the specific node in the layers of the integrated graph.

### Claim 7

A terminal for generating an integrated graph using a distributed graph, the terminal comprising:
a memory; and
a processor that functionally controls the memory,
wherein the processor is configured to:
receive a request message from a user, the request message including source node information and information on a number of hops corresponding to a number of layers of the integrated graph,
control a graph types module to identify, based on the source node information, a location of a graph database related to a type of the source node among a plurality of graph databases respectively corresponding to a plurality of applications,
control a graph manager module to request graph data to an application corresponding to the location of the graph database among the plurality of applications, and receive the graph data from the application, and
control a graph integration module to generate the integrated graph by integrating a node and an edge based on the source node and the graph data,
wherein the number of neighbor nodes of a specific node among a plurality of nodes of the integrated graph is set to be less than or equal to a specific value, the neighbor nodes being nodes in a lower layer of the specific node in the layers of the integrated graph.