GRAPH PROCESSING IN DATABASE

摘要

The subject matter described herein relates to database middleware for enabling graph processing. A middleware between the graph data and underlying relational or SQL database is proposed. The local properties and topology information of nodes in the graph can be stored in a single node table in the database, thereby eliminating the need for a physical junction table. The middleware may efficiently translate graph queries into SQL queries over related tables. In some examples, the middleware may optimize the translated queries using the topology knowledge which is oblivious to the database query engine.

主权项

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, andstoring the multi-valued property in a multi-valued field; and 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, andconvert the graph query into a structured query language (SQL) query over the first table and a second table, the SQL query retrieving the multi-valued property of the first node from the first table and obtaining data of the second node from the second table.