Bounded Delay and Concurrency for Earliest Query Answering

DOI10.1007/978-3-642-00982-2_30zbMath1234.68087OpenAlexW1844304577MaRDI QIDQ3618594

Olivier Gauwin, Joachim Niehren, Sophie Tison

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_30

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

Queries on XML streams with bounded delay and concurrency ⋮ Streamable Fragments of Forward XPath

Uses Software

• XPath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single-valuedness of tree transducers is decidable in polynomial time
• On the memory requirements of XPath evaluation over XML streams
• Streaming tree automata
• Earliest Query Answering for Deterministic Nested Word Automata
• Marrying Words and Trees
• General Algorithms for Testing the Ambiguity of Finite Automata
• Visibly pushdown languages
• On the Decidability of Bounded Valuedness for Transducers
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• Efficient and Expressive Tree Filters
• Grammatical Inference: Algorithms and Applications
• Rewriting Techniques and Applications

This page was built for publication: Bounded Delay and Concurrency for Earliest Query Answering