Queries on XML streams with bounded delay and concurrency
From MaRDI portal
Publication:553309
DOI10.1016/j.ic.2010.08.003zbMath1221.68082OpenAlexW2093382104MaRDI QIDQ553309
Olivier Gauwin, Sophie Tison, Joachim Niehren
Publication date: 27 July 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00491495/file/0.pdf
Related Items (2)
Visibly Pushdown Transducers with Look-Ahead ⋮ Early nested word automata for XPath query answering on XML streams
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Single-valuedness of tree transducers is decidable in polynomial time
- Aggregate operators in constraint query languages
- On the memory requirements of XPath evaluation over XML streams
- On the minimization of XML schemas and tree automata for unranked trees
- Streaming tree automata
- Worst-case optimal algorithm for XPath evaluation over XML streams
- Efficient inclusion checking for deterministic tree automata and XML schemas
- Haskell overloading is DEXPTIME-complete
- On the finite degree of ambiguity of finite tree automata
- Earliest Query Answering for Deterministic Nested Word Automata
- Adding nesting structure to words
- Marrying Words and Trees
- Visibly Pushdown Transducers
- General Algorithms for Testing the Ambiguity of Finite Automata
- Visibly pushdown languages
- Properties of Visibly Pushdown Transducers
- On the Decidability of Bounded Valuedness for Transducers
- Bounded Delay and Concurrency for Earliest Query Answering
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Equivalence of finite-valued tree transducers is decidable
- Deciding equivalence of finite tree automata
- Streamable Fragments of Forward XPath
- Logical definability and query languages over ranked and unranked trees
- Efficient and Expressive Tree Filters
- Grammatical Inference: Algorithms and Applications
- Database Programming Languages
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Datalog LITE
- Rewriting Techniques and Applications
This page was built for publication: Queries on XML streams with bounded delay and concurrency
