Early nested word automata for XPath query answering on XML streams
From MaRDI portal
Publication:2344752
DOI10.1016/j.tcs.2015.01.017zbMath1312.68078OpenAlexW2153794097MaRDI QIDQ2344752
Olivier Gauwin, Joachim Niehren, Mohamed Zergaoui, Tom Sebastian, Denis Debarbieux
Publication date: 18 May 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.017
automatadatabasesstreamsnested wordsdocument processing\textsc{Xml}\textsc{XPath}\textsc{XQuery}\textsc{Xslt}
Related Items (4)
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata ⋮ Earliest query answering for deterministic stepwise hedge automata ⋮ Unnamed Item ⋮ Efficient determinization of visibly and height-deterministic pushdown automata
Uses Software
Cites Work
- Queries on XML streams with bounded delay and concurrency
- Query Automata for Nested Words
- Earliest Query Answering for Deterministic Nested Word Automata
- Adding nesting structure to words
- XPath satisfiability in the presence of DTDs
- Visibly pushdown languages
- C-SPARQL: A CONTINUOUS QUERY LANGUAGE FOR RDF DATA STREAMS
- Streamable Fragments of Forward XPath
- Early Nested Word Automata for XPath Query Answering on XML Streams
- Efficient and Expressive Tree Filters
- Model checking of safety properties
This page was built for publication: Early nested word automata for XPath query answering on XML streams
