Skip to Main content Skip to Navigation
Conference papers

Highly expressive query languages for unordered data trees

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Serge Abiteboul Connect in order to contact the contributor
Submitted on : Friday, December 14, 2012 - 6:03:36 PM
Last modification on : Saturday, October 16, 2021 - 3:48:13 AM
Long-term archiving on: : Friday, March 15, 2013 - 3:52:39 AM


Files produced by the author(s)


  • 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⟩



Les métriques sont temporairement indisponibles