XRel: a path-based approach to storage and retrieval of XML documents using relational databases
ACM Transactions on Internet Technology (TOIT)
Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
Proceedings of the thirteenth ACM international conference on Information and knowledge management
TJFast: effective processing of XML twig pattern matching
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Why off-the-shelf RDBMSs are better at XPath than you might expect
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Staircase join: teach a relational DBMS to watch its (axis) steps
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Optimizing queries for web generated sensor data
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
Topological XML data cube construction
International Journal of Web Engineering and Technology
Hi-index | 0.00 |
XML query optimization continues to occupy considerable research effort due to the increasing usage of XML data. Despite many innovations over recent years, XML databases struggle to compete with more traditional database systems. Rather than using node indexes, some efforts have begun to focus on creating partitions of nodes within indexes. The motivation is to quickly eliminate large sections of the XML tree based on the partition they occupy. In this research, we present one such partition index that is unlike current approaches in how it determines size and number of these partitions. Furthermore, we provide a process for compacting the index and reducing the number of node access operations in order to optimize XML queries.