Streamable fragments of forward XPath
From MaRDI portal
Recommendations
Cites work
- Adding nesting structure to words
- Automata, Languages and Programming
- Bounded Delay and Concurrency for Earliest Query Answering
- Earliest Query Answering for Deterministic Nested Word Automata
- Efficient and Expressive Tree Filters
- Logics for Unranked Trees: An Overview
- Memory lower bounds for XPath evaluation over XML streams
- Model checking of safety properties
- On the memory requirements of XPath evaluation over XML streams
- Streamable fragments of forward XPath
- Streaming tree automata
- Worst-case optimal algorithm for XPath evaluation over XML streams
- XPath satisfiability in the presence of DTDs
Cited in
(7)- Early nested word automata for XPath query answering on XML streams
- Earliest Query Answering for Deterministic Nested Word Automata
- Bounded Delay and Concurrency for Earliest Query Answering
- Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata
- Streamable fragments of forward XPath
- Evaluation of XPath queries against XML streams.
- Queries on XML streams with bounded delay and concurrency
This page was built for publication: Streamable fragments of forward XPath
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200047)