Method and Apparatus for Identifying the Optimal Schema to Store Graph Data in a Relational Store

摘要

A system for identifying a schema for storing graph data includes a database containing a graph dataset of data and relationships between data pairs and a list of storage methods that each are a distinct structural arrangement of the data and relationships from the graph data set. An analyzer module collects statistics for the graph dataset, and a data classification module uses the collected statistics to calculate metrics describing the data and relationships in the graph dataset, uses the calculated metrics to group the data and relationships into a plurality of graph dataset subsets and. associates each graph dataset subset with one of the plurality of storage methods. The resulting group of storage methods associated with the plurality of graph dataset subsets includes a unique storage method for each graph dataset subset. The data and relationships in each graph dataset subset are arranged in accordance with associated storage methods.

主权项

1. A method for identifying a schema for storing graph data in a relational store, the method comprising:
identifying a graph dataset comprising data arranged in a plurality of nodes and relationships between data pairs illustrated as a plurality of edges between pairs of nodes; identifying a plurality of storage methods, each storage method comprising a distinct structural arrangement of the data and relationships from the graph data set; identifying a plurality of graph dataset subsets, each graph dataset subset comprising at least a portion of the data and relationships in the graph dataset; associating each graph dataset subset with one of the plurality of storage methods, wherein a group of storage methods associated with the plurality of graph dataset subsets includes at least two separate storage methods; and arranging the data and relationships in each graph dataset subset in accordance with its associated storage method to create the schema for the graph dataset.