Bounded Delay and Concurrency for Earliest Query Answering

Authors:
Olivier Gauwin;Joachim Niehren;Sophie Tison
Affiliations:
INRIA, Lille, and University of Lille 1, and Mostrare project, INRIA & LIFL (CNRS UMR8022),;INRIA, Lille, and Mostrare project, INRIA & LIFL (CNRS UMR8022),;University of Lille 1, and Mostrare project, INRIA & LIFL (CNRS UMR8022),
Venue:
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Year:
2009

Citing 16
Cited 2

On the degree of ambuguity of finite automata

Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
Single-valuedness of tree transducers is decidable in polynomial time

CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
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
Stream processing of XPath queries with predicates

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
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
Expressiveness and complexity of XML Schema

ACM Transactions on Database Systems (TODS)
Efficient algorithms for evaluating xpath over streams

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Marrying words and trees

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
On the Decidability of Bounded Valuedness for Transducers

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
General Algorithms for Testing the Ambiguity of Finite Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Streaming tree automata

Information Processing Letters
Efficient and expressive tree filters

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science

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

Quantified Score

Hi-index	0.00

Visualization

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.