Memory lower bounds for XPath evaluation over XML streams

DOI10.1016/J.JCSS.2010.10.004MaRDI QIDQ657920zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

conjunctive XPath queries

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(7)

• scientific article; zbMATH DE number 1950276 (Why is no real title available?)
• 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
• Validating XML documents in the streaming model with external memory
• Automata, Languages and Programming

Describes a project that uses

Uses Software

• XPath
• SAX
• XMLTK

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)