Title
Avoiding unnecessary ordering operations in XPath
Author
Faculty/Department
Faculty of Sciences. Mathematics and Computer Science
Publication type
article
Publication
Subject
Computer. Automation
Source (journal)
Database programming languages
Source (book)
9th International Workshop on Data Bases and Programming Languages, SEP 06-08, 2003, Potsdam, GERMANY
Volume/pages
2921(2004) , p. 54-70
ISSN
0302-9743
ISBN
3-540-20896-8
ISI
000189417500005
Carrier
E
Target language
English (eng)
Affiliation
University of Antwerp
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.
Full text (open access)
https://repository.uantwerpen.be/docman/irua/27bf9a/5860.pdf
E-info
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000189417500005&DestLinkType=RelatedRecords&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000189417500005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
Handle