Graph Traversal Hooks for Query Performance and Integration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current graph processing systems are ill-suited for online querying in business applications, lacking transactional support and query optimization, and require custom coding for integration into database management systems, which complicates system landscape integration and query performance.
Innovation Solution
The introduction of traversal hooks as a programming model to implement traversal-based algorithms, using a domain-specific language like TraveL to generate code for graph data traversal, allowing for efficient query performance comparable to native coding while providing a user-friendly query language and simplified system landscape.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If graph processing systems use custom coding for integration, then query performance can be optimized, but system landscape integration becomes complex
Solution Approach 1:
The patent introduces a query language as an intermediary layer between the user and the graph processing system. This query language provides a standardized interface that simplifies system integration while enabling efficient query execution through compiled code generation, thus resolving the contradiction between ease of integration and query performance
Solution Approach 2:
The query language is designed to be universal and can be integrated into existing database management systems without requiring custom coding for each integration scenario. It provides multi-functional capabilities including transactional support, query optimization, and efficient graph traversal, thereby simplifying system landscape integration while maintaining high performance
2Adaptability or versatility
If graph processing systems provide transactional support and query optimization, then online querying capability improves, but integration into database management systems becomes more complex
Solution Approach 1:
The query language is designed to be universally compatible with database management systems while providing advanced capabilities such as transactional support and query optimization. It achieves this through a standardized interface that can be integrated without custom coding, thus improving online querying capability without significantly increasing integration complexity
3Reliability
If traversal hooks are executed sequentially, then correctness is maintained, but query performance decreases
Solution Approach 1:
The patent implements dynamic execution of traversal hooks based on data dependencies. Hooks that are independent of each other are executed in parallel, while hooks with dependencies are executed sequentially to maintain correctness. This dynamic approach optimizes query performance while preserving traversal correctness
Solution Approach 2:
The traversal hooks are segmented into independent groups based on their data dependencies. Each group can be executed independently in parallel, while maintaining the overall correctness of the traversal operation. This segmentation enables parallel processing without compromising reliability
Data Source
AI summary
Traversal hooks are based on an event-oriented programming model and provide an expressive mechanism to extend a graph traversal operator with domain-specific coding. A traversal operator can visit (i.e., traversal events) vertices and edges of a graph in an ordered manner. Related apparatus, systems, techniques and articles are also described.