Semantic Graph Database Parallel Query Compiler

The patent segments the monolithic relational database structure into a graph database model where data is divided into nodes and edges. This segmentation allows independent representation of entities and relationships, enabling complex relationship queries without requiring global schema restructuring. Each node and edge can be independently modified or added without affecting the overall structure.

The patent transitions from the traditional two-dimensional table structure (rows and columns) to a multi-dimensional graph structure with nodes, edges, and hierarchical relationships. This dimensional change enables representation of complex relationships including parent-child relationships, many-to-many relationships, and path-based queries that are impossible in flat relational tables.

The patent extracts the requirement for data completeness from the rigid table schema and implements it through optional properties and constraints in the graph model. Properties can be defined as required or optional, allowing the system to maintain data completeness where needed while avoiding storage of unnecessary data. This extraction enables selective enforcement of data completeness at the property level rather than requiring all records to have all columns.

The patent changes the parameter of data representation from fixed-width columns to variable-length properties. Each node can have a dynamic set of properties based on its type and the specific data being stored. This parameter change allows the system to store only the necessary properties for each record, eliminating the need to allocate space for all possible columns across all records while maintaining data completeness for required properties.

The patent uses copying to create local references between nodes rather than performing expensive join operations. When relationships need to be traversed, the system copies or references the necessary node data locally, avoiding the generation of large intermediate result sets. This copying approach maintains query flexibility by enabling various relationship traversals while significantly reducing the computational overhead of join operations.

The patent introduces edges as intermediary elements that directly represent relationships between nodes, eliminating the need for join operations. Edges serve as natural mediators that connect nodes and carry relationship information, allowing the system to traverse relationships efficiently without generating intermediate values. This intermediary approach transforms the complex join operation into simple edge traversal.

The patent segments query processing into independent parallel tasks that can be executed concurrently across multiple processing elements. The graph traversal operations are divided into independent steps that can be parallelized, with each processing element working on a subset of the graph data. This segmentation enables significant speedup for complex queries on large datasets while maintaining manageable system complexity through modular task design.

The patent implements partial parallelization where only the computationally intensive portions of query processing are parallelized, while simpler operations remain sequential. This selective parallelization provides performance benefits for complex queries without requiring complete restructuring of the entire system. The approach allows the system to leverage parallel processing capabilities where they provide the most value while avoiding the overhead of parallelizing unnecessary operations.