Complexity of Earliest Query Answering with Streaming Tree Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Complexity of Earliest Query Answering with Streaming Tree Automata

Abstract

We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query answers upon reception of the shortest relevant prefix of the input tree on the stream. For queries defined by deterministic STAs, our algorithm runs in polynomial time combined complexity. In the general case, we show that earliest query answering is DEXPTIME-hard (even for n=0) and thus DEXPTIME-complete.
Fichier principal
Vignette du fichier
planx08.pdf (197.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00336169 , version 1 (03-11-2008)

Identifiers

  • HAL Id : inria-00336169 , version 1

Cite

Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison. Complexity of Earliest Query Answering with Streaming Tree Automata. ACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X), Jan 2008, San Francisco, United States. ⟨inria-00336169⟩
140 View
104 Download

Share

Gmail Facebook X LinkedIn More