Classification of index partitions to boost XML query performance

• Published in: Proceedings of the 29th international conference on Conceptual modeling pp. 405 - 418
• Main Authors: Marks, Gerard, Roantree, Mark, Murphy, John
• Format: Conference Proceeding
• Language: English
• Published: Berlin, Heidelberg Springer-Verlag 01.11.2010
• Series: ACM Other Conferences
• Subjects: Applied computing; Applied computing > Document management and text processing; Applied computing > Document management and text processing > Document preparation; Information systems; Information systems > Data management systems; Information systems > Data management systems > Database management system engines; Information systems > Data management systems > Database management system engines > Database query processing; Theory of computation; Theory of computation > Theory and algorithms for application domains; Theory of computation > Theory and algorithms for application domains > Database theory; Theory of computation > Theory and algorithms for application domains > Database theory > Database query processing and optimization (theory)
• ISBN: 9783642163722; 3642163726
• DOI: 10.5555/1929757.1929796

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.