Answering order-based queries over XML data

Authors:
Zografoula Vagena;Nick Koudas;Divesh Srivastava;Vassilis J. Tsotras
Affiliations:
UC Riverside;University of Toronto;AT&T Labs-Research;UC Riverside
Venue:
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Year:
2005

Citing 4
Cited 1

Storing and querying ordered XML using a relational database system

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Efficient processing of expressive node-selecting queries on XML data in secondary storage: a tree automata-based approach

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Staircase join: teach a relational DBMS to watch its (axis) steps

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

Efficient handling of positional predicates within XML query processing

XSym'05 Proceedings of the Third international conference on Database and XML Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Order-based queries over XML data include XPath navigation axes such as following-sibling and following. In this paper, we present holistic algorithms that evaluate such order-based queries. An experimental comparison with previous approaches shows the performance benefits of our algorithms.