Optimizing sorting and duplicate elimination in XQuery path expressions

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

Abstract

XQuery expressions can manipulate two kinds of order: document order and sequence order. While the user can impose or observe the order of items within a sequence, the results of path expressions must always be returned in document order. Correctness can be obtained by inserting explicit (and expensive) operations to sort and remove duplicates after each XPath step. However, many such operations are redundant. In this paper, we present a systematic approach to remove unnecessary sorting and duplicate elimination operations in path expressions in XQuery 1.0. The technique uses an automaton-based algorithm which we have applied successfully to path expressions within a complete XQuery implementation. Experimental results show that the algorithm detects and eliminates most redundant sorting and duplicate elimination operators and is very effective on common XQuery path expressions. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Fernández, M., Hidders, J., Michiels, P., Siméon, J., & Vercammen, R. (2005). Optimizing sorting and duplicate elimination in XQuery path expressions. In Lecture Notes in Computer Science (Vol. 3588, pp. 554–563). Springer Verlag. https://doi.org/10.1007/11546924_54

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