Efficient Processing of XPath Queries using Indexes
Abstract
A number of query languages have been proposed in recent times for processing queries on XML and semi structured data. All these query languages make use of regular path expressions to query XML data. To optimize the processing of query paths a number of indexing schemes have also been proposed recently. XPath provides the basis for processing queries on XML data in the form of regular path expressions. In this paper, we propose two algorithms called Entry-point algorithm and Rest-tree algorithm that exploit different types of indexes, which we have defined to efficiently process XPath queries. We also discuss and compare two variations in implementing these algorithms; Root-first and Bottom-first.
Recommended Citation
Y. Chen et al., "Efficient Processing of XPath Queries using Indexes," Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2453, pp. 721 - 730, Springer, Jan 2002.
The definitive version is available at https://doi.org/10.1007/3-540-46146-9_71
Department(s)
Computer Science
International Standard Book Number (ISBN)
978-354044126-7
International Standard Serial Number (ISSN)
1611-3349; 0302-9743
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Springer, All rights reserved.
Publication Date
01 Jan 2002
