Memory lower bounds for XPath evaluation over XML streams

DOI10.1016/J.JCSS.2010.10.004zbMATH Open1232.68041OpenAlexW2020065343MaRDI QIDQ657920FDOQ657920

Authors: 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

Recommendations

• On the memory requirements of XPath evaluation over XML streams
• Worst-case optimal algorithm for XPath evaluation over XML streams
• Evaluation of XPath queries against XML streams.
• Efficient and Expressive Tree Filters
• Automata, Languages and Programming

zbMATH Keywords

conjunctive XPath queries

Mathematics Subject Classification ID

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

Cites Work

• The complexity of XPath query evaluation and XML typing
• Communication Complexity
• Two applications of information complexity
• 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

Cited In (6)

• Title not available (Why is that?)
• Efficient and Expressive Tree Filters
• Worst-case optimal algorithm for XPath evaluation over XML streams
• On the memory requirements of XPath evaluation over XML streams
• Streamable fragments of forward XPath
• Automata, Languages and Programming

Uses Software

• XMLTK
• SAX
• XPath

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657920)