inria-00348463, version 1
Bounded Delay and Concurrency for Earliest Query Answering
Olivier Gauwin 1, 2Joachim Niehren
1Sophie Tison 1, 2
3rd International Conference on Language and Automata Theory and Applications 5457 (2009) 350-361
Abstract: Earliest query answering is needed for streaming XML processing with optimal memory management. We study the feasibility of earliest query answering for node selection queries. Tractable queries are distinguished by a bounded number of concurrently alive answer candidates at every time point, and a bounded delay for node selection. We show that both properties are decidable in polynomial time for queries defined by deterministic automata for unranked trees. Our results are obtained by reduction to the bounded valuedness problem for recognizable relations between unranked trees.
- 1: MOSTRARE (INRIA Lille - Nord Europe)
- INRIA – CNRS : UMR8022 – Université des Sciences et Technologies de Lille - Lille I : EA3588 – Université Charles de Gaulle - Lille III
- 2: Laboratoire d'Informatique Fondamentale de Lille (LIFL)
- CNRS : UMR8022 – INRIA – IRCICA – Université des Sciences et Technologies de Lille - Lille I
- Domain : Computer Science/Databases
Computer Science/Computation and Language - Keywords : Tree Automata – Streaming – XML Databases
- inria-00348463, version 1
- http://hal.inria.fr/inria-00348463
- oai:hal.inria.fr:inria-00348463
- From: Olivier Gauwin
- Submitted on: Friday, 19 December 2008 10:39:41
- Updated on: Tuesday, 3 November 2009 16:51:01
Associated documents
Export