Bounded Delay and Concurrency for Earliest Query Answering

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.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/inria-00348463
Contributor : Olivier Gauwin <>
Submitted on : Friday, December 19, 2008 - 10:39:41 AM
Last modification on : Thursday, July 25, 2019 - 8:50:07 AM
Long-term archiving on: Tuesday, June 8, 2010 - 4:44:18 PM

Identifiers

Collections

Citation

Olivier Gauwin, Joachim Niehren, Sophie Tison. Bounded Delay and Concurrency for Earliest Query Answering. 3rd International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.350-361, ⟨10.1007/978-3-642-00982-2⟩. ⟨inria-00348463⟩

Share

Metrics

Record views

587

Files downloads

340