Enforcing path consistency in graph database path query evaluation

A system comprising:

• one or more processors;
• and
• memory storing instructions that, when executed by the one or more processors, cause the system to:
• execute one or more processes for storing a graph in a base version of a graph database, wherein the graph comprises a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates;
• and
• when a query of the graph database is received, using one or more of the one or more processes to process the query by:
• storing intermediate results of the query in a structure comprising rows in a set of tables and links between pairs of rows in different tables in the set of tables;
• tracking, in the structure, representations of data, relationships, and path consistency in the query;
• applying one or more operations to existing rows in the structure to generate a final result of the query;
• and
• providing the final result in a response to the query.

A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method, the method comprising:

• executing one or more processes for storing a graph in a base version of a graph database, wherein the graph comprises a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates;
• and
• when a query of the graph database is received, using one or more of the one or more processes to process the query by:
• storing intermediate results of the query in a structure comprising rows in a set of tables and links between pairs of rows in different tables in the set of tables;
• tracking, in the structure, representations of data, relationships, and path consistency in the query;
• applying one or more operations to existing rows in the structure to generate a final result of the query;
• and
• providing the final result in a response to the query.