Join Graph Metamodel for Database Query Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional approaches for retrieving structured information from databases are limited by their tight integration with relational database design, lacking the flexibility and performance needed for modern business applications.
Innovation Solution
A metamodel that describes structured objects and their relations, represented as a join graph, is used to facilitate efficient retrieval services, allowing for optimized query processing and indexing across multiple tables with defined join conditions and paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional relational database approaches are used for retrieving structured information, then the system maintains simplicity and broad compatibility, but the retrieval performance and flexibility are limited
Solution Approach 1:
The patent segments the retrieval system into distinct components: a metamodel layer that defines structured objects and their relationships, a join graph that represents the logical structure of data relationships, and the underlying relational database. This segmentation allows the complex retrieval logic to be separated from the database operations, enabling optimized query processing while maintaining compatibility with standard relational databases.
Solution Approach 2:
The patent introduces a metamodel as an intermediary layer between the query interface and the relational database. The metamodel defines structured objects, attributes, and relationships that abstract the underlying database schema. This intermediary enables sophisticated processing and optimized retrieval paths without requiring changes to the underlying relational database system, thus improving performance while managing complexity.
2Adaptability or versatility
If specialized retrieval software is used to answer queries involving both texts and structured data, then the flexibility and performance for specific application domains improve, but the system complexity and development effort increase
Solution Approach 1:
The patent creates a universal metamodel framework that can handle multiple types of queries (textual, structured, and combined) through a unified interface. The metamodel defines generic structured object types and relationships that can be instantiated for different application domains, allowing the same retrieval infrastructure to serve diverse query requirements without requiring domain-specific software for each case.
Solution Approach 2:
The patent implements dynamic query processing where the join graph is constructed and optimized at query time based on the specific query requirements and the metamodel definitions. The system dynamically determines the optimal retrieval paths through the join graph, allowing flexible adaptation to different query types and data relationships without requiring static, domain-specific software configurations.
3Speed
If the metamodel with join graphs and views is implemented, then the retrieval speed and processing efficiency exceed those of general-purpose databases, but the implementation complexity and initial setup requirements increase
Solution Approach 1:
The patent performs preliminary action by pre-defining the metamodel structure, including structured object types, attributes, and relationships, before query execution. The join graph is pre-constructed based on the metamodel definitions, establishing optimized retrieval paths in advance. This preliminary structuring enables faster query processing by avoiding ad-hoc optimization for each query, while the metamodel framework provides a systematic approach to managing the implementation complexity.
Data Source
AI summary
A method is disclosed for modeling application-level objects in terms of join graphs defined over tables containing structured data residing in a relational database. In accordance with the disclosed metamodel, each object is modeled logically as a join graph. A query received from an application that requests the return of objects meeting certain conditions is reformulated to refer to the metamodel. The metamodel includes an index structure having a plurality of indexes and a set of join conditions that specify relationships between the indexes. Some series of join conditions form join paths, such that each join path originates on an anchor table and ends on a table corresponding to one of the plurality of indexes. The metamodel further includes at least one view representing a subgraph of the join graph having at least one anchor table as a key.