Graph workspace for heterogeneous graph data

A computer-implemented method, comprising:

• receiving a workspace definition defining a graph workspace for a heterogeneous graph having a plurality of vertex tables and one or more edge tables;
• validating the workspace definition to determine whether the workspace definition satisfies one or more conditions, wherein the one or more conditions include a verification that vertex attributes defined to have a same name share a same datatype across different vertex tables;
• upon validating the workspace definition, creating the graph workspace for the heterogeneous graph in accordance with the workspace definition, the graph workspace including a label for each table of the plurality of vertex tables and the one or more edge tables comprising the heterogeneous graph, and each vertex and edge of the heterogeneous graph being uniquely identified based on a label of a corresponding table and one or more key attributes;
• and
• executing, based at least on the graph workspace, a graph processing algorithm operating on the heterogeneous graph.

A non-transitory computer readable medium storing instructions, which when executed by at least one data processor, result in operations comprising:

• receiving a workspace definition defining a graph workspace for a heterogeneous graph having a plurality of vertex tables and one or more edge tables;
• validating the workspace definition to determine whether the workspace definition satisfies one or more conditions, wherein the one or more conditions include a verification that vertex attributes defined to have a same name share a same datatype across different vertex tables;
• upon validating the workspace definition, creating the graph workspace for the heterogeneous graph in accordance with the workspace definition, the graph workspace including a label for each table of the plurality of vertex tables and the one or more edge tables comprising the heterogeneous graph, and each vertex and edge of the heterogeneous graph being uniquely identified based on a label of a corresponding table and one or more key attributes;
• and
• executing, based at least on the graph workspace, a graph processing algorithm operating on the heterogeneous graph.