Earliest query answering for deterministic nested word automata

Authors:
Olivier Gauwin;Joachim Niehren;Sophie Tison
Affiliations:
INRIA, Lille and University of Lille 1 and INRIA & LIFL, CNRS, UMR;INRIA, Lille and INRIA & LIFL, CNRS, UMR;University of Lille 1 and INRIA & LIFL, CNRS, UMR
Venue:
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Year:
2009

Citing 18
Cited 3

Haskell overloading is DEXPTIME-complete

Information Processing Letters
Validating streaming XML documents

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Locating Matches of Tree Patterns in Forests

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Buffering in query evaluation over XML streams

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Visibly pushdown automata for streaming XML

Proceedings of the 16th international conference on World Wide Web
Tight lower bounds for query processing on streaming and external memory data

Theoretical Computer Science
Efficient algorithms for evaluating xpath over streams

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Machine models and lower bounds for query processing

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SPEX: Streamed and Progressive Evaluation of XPath

IEEE Transactions on Knowledge and Data Engineering
Online evaluation of regular tree queries

Nordic Journal of Computing
Stream firewalling of xml constraints

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Streaming tree automata

Information Processing Letters
Adding nesting structure to words

Journal of the ACM (JACM)
Efficient and expressive tree filters

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Constant-memory validation of streaming XML documents against DTDs

ICDT'07 Proceedings of the 11th international conference on Database Theory
Which XML schemas admit 1-pass preorder typing?

ICDT'05 Proceedings of the 10th international conference on Database Theory

Queries on Xml streams with bounded delay and concurrency

Information and Computation
Streamable fragments of forward XPath

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Early nested word automata for XPath query answering on XML streams

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Earliest query answering (EQA) is an objective of 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 XPath unless 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.