Database Path Generation Tool for Complex Relational Models
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
As data models become increasingly complex in relational databases, determining efficient data retrieval paths between numerous tables is challenging due to the complexity of relationships and the need to consider various pathways, which can lead to inefficient query construction and resource utilization.
Innovation Solution
A method is provided to represent database tables as a graph, using foreign keys and association identifiers to define edges between nodes, allowing for the determination and display of multiple paths between target tables, with options to refine paths based on user input and generate query language statements for data retrieval.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data models become more complex with more tables and relationships, then data organization and storage are improved, but determining efficient data retrieval paths becomes more difficult and time-consuming
Solution Approach 1:
The patent introduces a graph representation as an intermediary structure between the complex data model and the path determination process. The graph visually represents tables as nodes and relationships as edges, serving as a mediator that transforms the complexity of the data model into an intuitive visual format that can be easily processed to determine retrieval paths
Solution Approach 2:
The patent segments the complex data retrieval problem into multiple manageable paths between source and target tables. By breaking down the retrieval process into discrete pathways through the graph structure, the system can present multiple options to users rather than requiring them to navigate the entire complex data model at once
2Adaptability or versatility
If multiple pathways are considered for data retrieval, then data accessibility and flexibility are improved, but query construction complexity and resource utilization inefficiency increase
Solution Approach 1:
The graph structure acts as an intermediary that manages multiple pathways between tables. Instead of requiring users to manually construct queries considering all possible paths, the graph visually organizes these pathways, allowing users to select from pre-identified routes while the system handles the underlying query construction complexity
Solution Approach 2:
The system provides feedback by presenting multiple determined paths to the user with visual indicators showing relationship information. This feedback mechanism allows users to review the suggested pathways and select the most appropriate one based on their specific needs, reducing the complexity of query construction while maintaining adaptability
3Productivity
If relationship-level information is considered in path determination, then data retrieval efficiency is improved, but processing time and computational resources increase
Solution Approach 1:
The system performs preliminary action by first determining paths between tables without considering detailed attribute-level relationship information. This initial path determination uses simplified criteria to quickly identify potential pathways, and only afterward does it incorporate relationship-level details for refinement and selection
Solution Approach 2:
The patent segments the path determination process into two distinct phases: a preliminary phase that identifies potential paths using basic table connections, and a refinement phase that incorporates detailed relationship information. This segmentation allows the system to achieve good retrieval efficiency without being overwhelmed by the time cost of considering all relationship details from the start
Data Source
AI summary
Techniques and solutions are described for determining, evaluating, and selecting data retrieval pathways. A plurality of database objects, such as tables, can be retrieved, and relationships between them determined. The relationships are between various attributes of the database objects. A plurality of pathways are determined between at least two target database objects, where the path determination does not consider attribute-level relationship information. After a path is determined, the relationship-level information can be added. A summary of the path, and relationship information, can be displayed to a user. A user can select paths to remove from the display, and can indicate one or more database objects that are required for a valid path, one or more database objects that are prohibited from valid paths, or combinations thereof. A user can select a path, and a query language statement to implement the path can be generated and displayed to the user.