Highly expressive query languages for unordered data trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Highly expressive query languages for unordered data trees


We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and exten- sions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and interplay of different factors: the expressive power of ba- sic queries, the embedding of computation into data (as in Active XML), and the use of deterministic vs. nondeter- ministic control. All languages are Turing complete, but not necessarily query complete in the sense of Chandra and Harel. Indeed, we show that some combinations of features yield serious limitations, analogous to FOk definability in the relational context. On the other hand, the limitations come with benefits such as the existence of powerful nor- mal forms. Other languages are "almost" complete, but fall short because of subtle limitations reminiscent of the copy elimination problem in object databases.
Fichier principal
Vignette du fichier
a10-Abiteboul.pdf (397.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00765558 , version 1 (14-12-2012)


  • HAL Id : hal-00765558 , version 1


Serge Abiteboul, Pierre Bourhis, Victor Vianu. Highly expressive query languages for unordered data trees. ICDT, Mar 2012, Berlin, Germany. pp.46-60. ⟨hal-00765558⟩
249 View
147 Download


Gmail Facebook X LinkedIn More