Clustered absolute path index for XML document: On efficient processing of twig queries

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Finding all the occurrences of a twig pattern in an XML document is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process twig queries based on region encoding. While each element in source document is given two or more numbers in region-encoding-form index, the size of index grows linearly to the source document. The algorithms based on region encoding perform worse when the source document grows large. In this paper, we address the problem by putting forward a novel index structure, called Clustered Absolute Path Index (CAPI for brief). This index can extremely reduce the size of index and grows slowly as the source document grows large. Based on CAPI, we design novel join algorithms, called Path-Match to process queries without branches, Branch-Filter and RelatedPath-Join to process queries with branches. Experimental results show that the proposed algorithms based on CAPI outperform twig join significantly and have good seal ability. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Wang, H., Li, J., & Wang, H. (2006). Clustered absolute path index for XML document: On efficient processing of twig queries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3842 LNCS, pp. 1–10). Springer Verlag. https://doi.org/10.1007/11610496_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free