Graph Representation System Using Interval-Based Node Pruning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing graphbase search methods are inefficient, particularly with large graphbases, as they do not effectively determine relationships between nodes, leading to suboptimal search performance.
Innovation Solution
The system determines relationships between nodes in a graphbase by utilizing node parameters such as NodeNumber, OwnTree Interval, and Reachable Interval, allowing for efficient traversal and connection analysis through methods like Join and Meet functions, which filter search spaces to reduce computation time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional search methods are used in large graphbases, then the system can handle basic search operations, but the search efficiency and computation time deteriorate significantly
Solution Approach 1:
The patent segments the graphbase into multiple Directed Acyclic Graphs (DAGs) and further divides each DAG into intervals (OwnTree Interval and Reachable Interval). This segmentation allows the search algorithm to work with smaller, manageable portions of the graph rather than the entire structure, dramatically improving search efficiency in large graphbases.
Solution Approach 2:
The patent performs preliminary actions by pre-computing and storing interval information (OwnTree Interval and Reachable Interval) for each node during graph construction. These pre-computed intervals enable rapid determination of node relationships during search operations without requiring exhaustive traversal, reducing computation time significantly.
2Measurement precision
If the search space is not pruned, then the system can examine all possible node relationships, but the computation time increases unnecessarily
Solution Approach 1:
The patent extracts and utilizes interval information (OwnTree Interval and Reachable Interval) from the graph structure to define search boundaries. By extracting these pre-computed intervals, the system can quickly determine whether node relationships exist without examining the entire graph, maintaining accuracy while reducing search time.
Solution Approach 2:
The patent applies partial action by examining only the relevant portions of the graph defined by the intervals rather than the entire graphbase. The interval-based approach performs exactly the necessary checks to determine node relationships without unnecessary examinations, optimizing the balance between completeness and efficiency.
Data Source
AI summary
Methods can include receiving a graphbase comprising a first plurality of nodes and a plurality of edges representing covering-covered relationships between the nodes. Each node can comprise a plurality of node parameters such as a NodeNumber, a Reachable Interval, and an OwnTree Interval. For a traversal ordering of nodes, nodes comprised within the OwnTree Interval are reachable from the node, nodes comprised within the Reachable Interval may be reachable from the node, and nodes comprised within neither interval are not reachable by the node. Methods can additionally include the steps of receiving a first and second sub-set of nodes, the sub-sets being a sub-set of the first plurality of nodes. Furthermore, a relationship between the first and second sub-set can be determined using the NodeNumber, the OwnTree Interval, and the Reachable Interval.