Highly Expressive Query Languages for Unordered Data Trees

Serge Abiteboul 1 Pierre Bourhis 2 Victor Vianu 3, 4
2 LINKS - Linking Dynamic Data
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
3 DAHU - Verification in databases
CNRS - Centre National de la Recherche Scientifique : UMR8643, Inria Saclay - Ile de France, ENS Cachan - École normale supérieure - Cachan, LSV - Laboratoire Spécification et Vérification [Cachan]
Abstract : We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions 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 basic queries, the embedding of computation into data (as in Active XML), and the use of deterministic vs. nondeterministic 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 FO-k definability in the relational context. On the other hand, the limitations come with benefits such as the existence of powerful normal forms providing opportunities for optimization. Other languages are ``almost'' complete, but fall short because of subtle limitations reminiscent of the copy elimination problem in object databases.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-01167068
Contributor : Victor Vianu <>
Submitted on : Wednesday, June 24, 2015 - 1:35:08 PM
Last modification on : Wednesday, August 7, 2019 - 12:18:05 PM
Long-term archiving on : Tuesday, September 15, 2015 - 10:10:12 PM

File

journal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01167068, version 1

Citation

Serge Abiteboul, Pierre Bourhis, Victor Vianu. Highly Expressive Query Languages for Unordered Data Trees. Theory of Computing Systems, Springer Verlag, 2015, pp.30. ⟨hal-01167068⟩

Share

Metrics

Record views

520

Files downloads

146