A new indexing structure to speed up processing XPath queries

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

Abstract

In this paper, the focus is on accelerating XPath location steps for evaluating regular path expression with predicate parameter in particular since it is a core component of many XML processing standards such as XSLT or XQuery. We present a new indexing structure, namely Xp-tree, which is used to speed-up the evaluation of XPath. Based on accelerating a node using planar combined with the numbering scheme, we devise efficiently derivative algorithms. Our experimental results demonstrate that the proposed method outperforms previous approaches using R-tree indexing mechanism in processing XML queries. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Hwang, J. H., Van Nguyen, T., & Ryu, K. H. (2005). A new indexing structure to speed up processing XPath queries. In Lecture Notes in Computer Science (Vol. 3453, pp. 900–906). Springer Verlag. https://doi.org/10.1007/11408079_82

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