On the Sequencing of Tree Structures for XML Indexing

Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answered holistically through subsequence matching. In this paper, we address the problem of query equivalence with respect to this transformation, and we introduce a performance-oriented principle for sequencing tree structures. With query equivalence, XML queries can be performed through subsequence matching without join operations, post-processing, or other special handling for problems such as false alarms. We identify a class of sequencing methods for this purpose, and we present a novel subsequence matching algorithm that observe query equivalence. Still, query equivalence is just a prerequisite for sequence-based XML indexing. Our goal is to find the best sequencing strategy with regard to the time and space complexity in indexing and querying XML data. To this end, we introduce a performance-oriented prin...

• Type: Conference
• Year: 2005
• Where: ICDE
• Authors: Haixun Wang, Xiaofeng Meng
• Keywords: Database, ICDE 2005, Observe Query Equivalence, Performance-oriented Sequencing Principle, Query Equivalence