Patent Document ID: 9870393
Application ID: 14611967

Base Claim:
1. A computer-implemented system comprising: a graph mapper configured to store data representing a graph into a first table in a relational database, each node in the graph having a single-valued property and a multi-valued property, the multi-valued property being a non-local property and containing a reference to at least one adjacent node, the mapper configured to store each node in a corresponding record in the first table by: storing the single-valued property in a single-valued field, and storing the multi-valued property in a multi-valued field; a query translator configured to: receive a graph query on the graph, the query including a traversal from a first node to a second node that is adjacent to the first node, convert the graph query into a structured query language (SQL) query over the first table and a second table, and retrieve the multi-valued property of the first node from the first table and obtain data of the second node from the second table with the SQL query; and the graph mapper further configured to: store, for each node in the graph, an adjacency list in the multi-valued field, the adjacency list containing the reference to the at least one adjacent node, transform the adjacency list to a temporary table; and use the temporary table to locate the corresponding record.

---

Claim 2:
2. The system of claim 1 , wherein the query translator is configured to generate the SQL query that invokes a predefined function on the multi-valued property of the first node to create the temporary table, the temporary table being a temporary junction table associating the first node and the at least one adjacent node.