Queries on XML Streams with Bounded Delay and Concurrency

Olivier Gauwin 1, 2, * Joachim Niehren 1, 2 Sophie Tison 1, 2
* Auteur correspondant
1 MOSTRARE - Modeling Tree Structures, Machine Learning, and Information Extraction
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : Query answering algorithms on XML streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query are two measures for the degree of their streamability. They count the maximal number of stream elements during the life time for some query answer, and respectively, the maximal number of simultaneously alive answer candidates of a query. We study queries defined by deterministic nested word automata, which subsume large streamable fragments of XPath subject to schema restrictions by DTDs modulo P-time translations. We show that bounded and k-bounded delay and concurrency of such automata-defined queries are all decidable in polynomial time in the size of the automaton. Our results are obtained by P-time reduction to the bounded valuedness problem for recognizable relations between unranked trees, a problem that we show to be decidable in P-time. This is a long version of a paper presented a LATA'09.
Type de document :
Article dans une revue
Information and Computation, Elsevier, 2011, Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), 209 (3), pp.409-442. 〈10.1016/j.ic.2010.08.003〉
Liste complète des métadonnées

Littérature citée [57 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00491495
Contributeur : Joachim Niehren <>
Soumis le : lundi 6 septembre 2010 - 23:58:31
Dernière modification le : jeudi 30 août 2018 - 13:58:05
Document(s) archivé(s) le : mardi 7 décembre 2010 - 02:24:50

Fichier

0.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Olivier Gauwin, Joachim Niehren, Sophie Tison. Queries on XML Streams with Bounded Delay and Concurrency. Information and Computation, Elsevier, 2011, Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), 209 (3), pp.409-442. 〈10.1016/j.ic.2010.08.003〉. 〈inria-00491495〉

Partager

Métriques

Consultations de la notice

483

Téléchargements de fichiers

232