Streamable Fragments of Forward XPath

DOI10.1007/978-3-642-22256-6_2zbMath1297.68129OpenAlexW1904607992MaRDI QIDQ5200047

Joachim Niehren, Olivier Gauwin

Publication date: 29 July 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22256-6_2

zbMATH Keywords

tree automatapushdown automataquery answeringXPathtemporal logics for unranked treesXML streams

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Internet topics (68M11)

Related Items (4)

Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata ⋮ Queries on XML streams with bounded delay and concurrency ⋮ Streamable Fragments of Forward XPath ⋮ Early nested word automata for XPath query answering on XML streams

Uses Software

• XPath

Cites Work

• Memory lower bounds for XPath evaluation over XML streams
• On the memory requirements of XPath evaluation over XML streams
• Streaming tree automata
• Worst-case optimal algorithm for XPath evaluation over XML streams
• Earliest Query Answering for Deterministic Nested Word Automata
• Adding nesting structure to words
• XPath satisfiability in the presence of DTDs
• Bounded Delay and Concurrency for Earliest Query Answering
• Streamable Fragments of Forward XPath
• Logics for Unranked Trees: An Overview
• Efficient and Expressive Tree Filters
• Automata, Languages and Programming
• Model checking of safety properties

This page was built for publication: Streamable Fragments of Forward XPath