Memory lower bounds for XPath evaluation over XML streams

DOI10.1016/J.JCSS.2010.10.004zbMath1232.68041OpenAlexW2020065343MaRDI QIDQ657920

Prakash V. Ramanan

Publication date: 11 January 2012

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.2010.10.004

zbMATH Keywords

conjunctive XPath queries

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Related Items (2)

Streamable Fragments of Forward XPath ⋮ Worst-case optimal algorithm for XPath evaluation over XML streams

Uses Software

• XMLTK
• SAX
• XPath

Cites Work

• On the memory requirements of XPath evaluation over XML streams
• Worst-case optimal algorithm for XPath evaluation over XML streams
• Efficient filtering of XML documents with XPath expressions
• Tight lower bounds for query processing on streaming and external memory data
• The complexity of XPath query evaluation and XML typing
• Two applications of information complexity
• Communication Complexity

This page was built for publication: Memory lower bounds for XPath evaluation over XML streams