Publication
Title
Avoiding unnecessary ordering operations in XPath
Author
Abstract
We present a sound and complete rule set for determining whether sorting by document order and duplicate removal operations in the query plan of XPath expressions are unnecessary. Additionally we define a deterministic automaton that illustrates how these rules can be translated into an efficient algorithm. This work is an important first step in the understanding and tackling of XPath/XQuery optimization problems that are related to ordering and duplicate removal.
Language
English
Source (journal)
Lecture notes in computer science. - Berlin, 1973, currens
Source (book)
9th International Workshop on Data Bases and Programming Languages, SEP 06-08, 2003, Potsdam, GERMANY
Publication
Berlin : 2004
ISBN
3-540-20896-8
Volume/pages
2921(2004), p. 54-70
ISI
000189417500005
Full text (open access)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 03.01.2013
Last edited 03.05.2017
To cite this reference