On the memory requirements of XPath evaluation over XML streams

DOI10.1016/j.jcss.2006.10.002zbMath1115.68054OpenAlexW2091965317MaRDI QIDQ878756

Marcus Fontoura, Vanja Josifovski, Ziv Bar-Yossef

Publication date: 26 April 2007

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2006.10.002

zbMATH Keywords

XMLcommunication complexityspace lower boundsXPathdata stream processing

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (10)

Tight lower bounds for query processing on streaming and external memory data ⋮ On the memory requirements of XPath evaluation over XML streams ⋮ Rewriting XPath queries using materialized XPath views ⋮ Memory lower bounds for XPath evaluation over XML streams ⋮ Queries on XML streams with bounded delay and concurrency ⋮ Database query processing using finite cursor machines ⋮ Streamable Fragments of Forward XPath ⋮ Bounded Delay and Concurrency for Earliest Query Answering ⋮ Unnamed Item ⋮ Worst-case optimal algorithm for XPath evaluation over XML streams

Uses Software

• XQuery
• XMLTK
• XPath

Cites Work

• Unnamed Item
• On the memory requirements of XPath evaluation over XML streams
• Optimal aggregation algorithms for middleware.
• Communication Complexity
• Automata, Languages and Programming

This page was built for publication: On the memory requirements of XPath evaluation over XML streams