Efficient and Expressive Tree Filters

DOI10.1007/978-3-540-77050-3_38zbMath1135.68337OpenAlexW1573184733MaRDI QIDQ5458857

Michael Benedikt, Alan Jeffrey

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_38

Mathematics Subject Classification ID

Network protocols (68M12)

Related Items (7)

Limiting Until in Ordered Tree Query Languages ⋮ Evolving schemas for streaming XML ⋮ Queries on XML streams with bounded delay and concurrency ⋮ Streamable Fragments of Forward XPath ⋮ Bounded Delay and Concurrency for Earliest Query Answering ⋮ Unnamed Item ⋮ Early nested word automata for XPath query answering on XML streams

Cites Work

• Unnamed Item
• Structural properties of XPath fragments
• Efficient filtering of XML documents with XPath expressions
• XPath satisfiability in the presence of DTDs
• Forward node-selecting queries over trees
• Algebraic laws for nondeterminism and concurrency
• Monadic datalog and the expressive power of languages for Web information extraction

This page was built for publication: Efficient and Expressive Tree Filters