XML Domain Index Order Key Node Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing indexing mechanisms for XML documents are ineffective in combining results from XPath-based indexes and domain-specific indexes, leading to coarse granularity of results and inability to determine if hits from both indexes match at the node level, especially when dealing with queries involving domain-specific operators and functions.
Innovation Solution
Augmenting domain-specific indexes with order keys that indicate the position of information within the XML hierarchy, allowing for the merging of results from XML and domain-specific indexes using appropriate order key conditions to satisfy queries, thereby making domains 'node-aware' and improving query performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If separate XPath-based index and domain-specific index are used, then query coverage is improved, but result integration capability deteriorates
Solution Approach 1:
The patent merges XPath-based indexing with domain-specific indexing by integrating domain functions directly into the XPath query evaluation process. The database management system executes domain functions during the index scan phase rather than as separate post-processing steps, allowing unified query processing that simultaneously leverages both indexing approaches while producing integrated results at the node level.
2Productivity
If domain-specific index is used, then domain operation performance is improved, but node-level precision deteriorates
Solution Approach 1:
The patent segments the domain-specific index results to the node level by maintaining awareness of XML document hierarchy. Instead of treating entire XML documents as atomic units, the system identifies and returns specific nodes that satisfy domain predicates, thereby achieving both efficient domain operations and precise node-level results through hierarchical segmentation of the document structure.
3Measurement precision
If XPath index is used, then node-level querying is improved, but domain semantics utilization deteriorates
Solution Approach 1:
The patent makes the XPath query evaluation mechanism universal by enabling it to execute domain-specific functions directly. The same query processing infrastructure that handles standard XPath operations is extended to invoke domain functions, allowing a single unified mechanism to serve both traditional XPath querying and domain-specific operations without sacrificing node-level precision or domain semantics utilization.
4Ease of operation
If domain index treats every node as document, then domain operation simplicity is improved, but hit accuracy deteriorates
Solution Approach 1:
The patent applies local quality by treating different nodes differently based on their hierarchical position and content characteristics. Rather than uniformly treating all nodes as identical documents, the system adapts its behavior to specific node contexts, applying domain predicates appropriately to each node type and position, thereby maintaining operational simplicity while achieving accurate hit results that respect XML structural semantics.
Data Source
AI summary
An XML document can contain domain-specific information, which typically has its own semantics and operations independent of the XML domain. Specialized indexes and operations are used to manage information within different types of domains, for example, text, spatial, life sciences, time series, image, and multimedia domains. Entries in domain-specific indexes are augmented to include data that indicates the position of domain information within the underlying hierarchy, referred to as order keys. The domain-specific index is used to locate instances of the requested information within the domain and to determine whether any of the instances satisfy the request. Determining whether the request is satisfied includes determining whether any of the instances of the domain information are positioned within the hierarchy at a location that satisfies the path specified in the request, i.e., an instance of the information has an appropriate relationship with the particular node specified in the request.


