Graph traversal operator and extensible framework inside a column store

摘要

A system, computer-implemented method, and a computer-readable storage medium for a traversal of a property graph, are provided. The edge table of the property graph is divided into a plurality of fragments. A first fragment is selected for traversal using a set of selected vertices, where the traversal identifies a set of edges. Based on the set of edges, a set of adjacent vertices is determined during the traversal. A set of discovered vertices in the property graph is determined based on the set of selected vertices and the set of adjacent vertices.

主权项

1. A computer-implemented method for traversing a property graph, comprising:
receiving a recursion boundary as an input parameter, wherein the recursion boundary defines a maximum number of levels of the property graph for traversal; dividing, using a processor, an edge table of the property graph into a plurality of fragments; selecting a first fragment for traversing from the plurality of fragments and a set of selected vertices; traversing the first fragment using the set of selected vertices, wherein the traversing identifies a set of edges; determining a set of adjacent vertices using the set of edges while traversing the first fragment; and determining a set of discovered vertices based on the set of selected vertices and the set of adjacent vertices, wherein the set of discovered vertices is constrained based on the recursion boundary.