XML Tuple Algebra

Relational algebra for XML; XML algebra

An XML tuple-based algebra operates on a domain that consists of sets of tuples whose attribute values are items, i.e., atomic values or XML elements (and hence, possibly, XML trees). Operators receive one or more sets of tuples and produce a set, list or bag of tuples of items. It is common that the algebra has special operators for converting XML inputs into instances of the domain and vice versa. XML tuple-based algebras, as is also the case with relational algebras, have been extensively used in query processing and optimization [1–10].

The use of tuple-based algebras for the efficient set-at-a-time processing of XQuery queries follows a typical pattern in database query processing. Relational algebras are the most typical vehicle for query optimization. Tuple-oriented algebras for object-oriented queries had also been formulated and have a close resemblance to the described XML algebras.

Note that...

Authors and Affiliations

1. INRIA Saclay–Île-de-France, Orsay,  , France

   Ioana Manolescu

2. University of California-San Diego, La Jolla, CA, USA

   Yannis Papakonstantinou

3. Athens University of Economics and Business, Athens, Greece

   Vasilis Vassalos

Editors and Affiliations

1. College of Computing, Georgia Institute of Technology, 266 Ferst Drive, 30332-0765, Atlanta, GA, USA

   LING LIU (Professor) (Professor)

2. Database Research Group David R. Cheriton School of Computer Science, University of Waterloo, 200 University Avenue West, N2L 3G1, Waterloo, ON, Canada

   M. TAMER ÖZSU (Professor and Director, University Research Chair) (Professor and Director, University Research Chair)

Reprints and permissions

© 2009 Springer Science+Business Media, LLC

Policies and ethics