XML Table Index for Efficient Metadata Querying
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing relational database management systems face inefficiencies in querying XML data, particularly when stored in aggregate form, as they lack the indexing and query optimization mechanisms available for object-relational storage, leading to slow query performance and resource-intensive operations.
Innovation Solution
The creation of an XML table index that projects XML data into column form, allowing for the application of object-relational query techniques to XML data stored in aggregate form, thereby avoiding the need for shredding and well-defined schemas, and improving query efficiency by leveraging secondary indexes and statistical analysis to optimize column inclusion based on query frequency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If XML data is stored in aggregate form, then storage flexibility and simplicity are improved, but query performance deteriorates due to lack of indexing mechanisms
Solution Approach 1:
The patent segments XML data storage into two parts: aggregate storage for flexibility and a separate relational projection table for efficient querying. The projection table divides XML elements into columns and rows, enabling indexing while maintaining aggregate storage benefits.
Solution Approach 2:
The patent introduces a projection table as an intermediary between aggregate XML storage and query operations. This intermediary structure enables relational indexing and query optimization without requiring changes to the underlying aggregate storage format.
2Speed
If XML data is shredded into object-relational format, then query efficiency is improved through indexing, but storage complexity and resource usage increase
Solution Approach 1:
The patent applies local quality by creating a projection table that contains only the specific columns and rows relevant to query operations, rather than converting the entire XML structure. This localized approach provides indexing benefits for queried data while maintaining aggregate storage for the rest.
Solution Approach 2:
The patent performs partial shredding by creating a projection table with selected XML elements rather than fully converting all XML data to object-relational format. This partial action provides sufficient indexing capability for common queries while avoiding the complexity of complete conversion.
3Speed
If projection tables are created for XML table indexes, then query access efficiency is improved, but storage space requirements increase
Solution Approach 1:
The projection table serves multiple functions: it enables relational indexing for efficient queries, maintains a simplified view of XML data, and supports both aggregate and projected access methods. This multi-functionality justifies the additional storage by providing versatile query capabilities.
Data Source
AI summary
XML table indexes provide a more efficient mechanism for searching data stored in aggregate form. XML table indexes are a set of tables created to project out in column form commonly sought metadata from stored XML documents. By projecting the data includes into column form, queries on the XML documents can be efficiently processed as they can leverage the enhanced functionality provided by the database tables. The XML table indexes may use aliases, partitioning, constraints and other functions to further improve query flexibility and performance.


