Earliest Query Answering for Deterministic Nested Word Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Earliest Query Answering for Deterministic Nested Word Automata

Abstract

Earliest query answering (EQA) is an objective of many recent streaming algorithms for XML query answering, that aim for close to optimal memory management. In this paper, we show that EQA is infeasible even for a small fragment of Forward XPath except if P=NP. We then present an EQA algorithm for queries and schemas defined by deterministic nested word automata (dNWAs) and distinguish a large class of dNWAs for which streaming query answering is feasible in polynomial space and time.
Fichier principal
Vignette du fichier
0.pdf (299.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00390236 , version 1 (12-06-2009)
inria-00390236 , version 2 (13-08-2009)

Identifiers

  • HAL Id : inria-00390236 , version 2

Cite

Olivier Gauwin, Joachim Niehren, Sophie Tison. Earliest Query Answering for Deterministic Nested Word Automata. 17th International Symposium on Fundamentals of Computer Theory, Sep 2009, Wraclaw, Poland. pp.121-132. ⟨inria-00390236v2⟩
187 View
267 Download

Share

Gmail Facebook X LinkedIn More