Weighted Path Finding in Relational Graph Databases
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current database systems face challenges in efficiently performing weighted path operations on graph data, particularly in identifying the shortest path between endpoints that minimize specific attributes or the quantity of intervening vertices and edges, especially in relational databases where relationships are implicitly defined.
Innovation Solution
A system and method for performing weighted path operations on graph data stored in a relational database, involving a data processor and memory that executes instructions to identify the shortest path by considering weights associated with vertices and edges, which can be stored in vertex and edge tables, and generating a weighted path object that inherits attributes, allowing for efficient path extraction and minimization of specified attributes or edge quantity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If relational databases store graph data with implicit relationships using cross-referencing keys, then data storage flexibility is improved, but path finding operation efficiency deteriorates
Solution Approach 1:
The patent segments the path finding operation into distinct phases: identifying candidate paths through table joins, calculating weights for each path based on vertex and edge attributes, and selecting the optimal path. This segmentation allows the system to handle complex graph operations in manageable steps while maintaining the flexibility of relational storage.
Solution Approach 2:
The patent introduces intermediate structures such as candidate path tables and weight calculation mechanisms that mediate between the relational database storage and the final path finding result. These intermediaries enable efficient processing by organizing data in ways that facilitate weight-based path selection without changing the underlying relational storage model.
2Measurement precision
If the system performs weighted path operations considering multiple vertex and edge attributes, then path finding accuracy is improved, but computational complexity increases
Solution Approach 1:
The patent changes parameters by allowing dynamic specification of which vertex and edge attributes to consider in weight calculations. The system can adjust the set of attributes used for weighting, enabling users to balance between accuracy and computational complexity based on specific needs. Different attribute combinations can be tested to find the optimal balance for each use case.
Solution Approach 2:
The patent implements partial action by allowing users to specify subsets of available attributes for weight calculation. Rather than requiring all possible attributes to be considered, the system enables selective inclusion of relevant attributes, reducing computational complexity while maintaining sufficient accuracy for the specific application.
3Reliability
If the database stores weights as functions of multiple attributes, then path optimization capability is improved, but query processing time increases
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing weight values in the database tables. Instead of computing complex attribute functions during query execution, the system prepares weight data in advance, allowing faster path finding operations. This pre-computation approach trades some initial processing time for significantly faster query response times.
Solution Approach 2:
The patent uses copying by creating derived tables that contain pre-computed weight values based on the original vertex and edge attributes. These copied weight tables can be queried efficiently without recalculating the full attribute functions, reducing query processing time while maintaining the ability to perform accurate weighted path operations.
Data Source
AI summary
A method for performing a path finding operation in graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a weighted path operation on at least portion of the graph data. The portion of the graph data may correspond to a graph. The request may specify attributes associated with vertices and/or edges included in the graph. In response to the request, the weighted path operation may be performed by at least identifying a shortest path between two endpoints in the graph. The shortest path may minimize the one or more attributes of vertices and/or edges included in the shortest path. Related systems and articles of manufacture, including computer program products, are also provided.