Memory lower bounds for XPath evaluation over XML streams (Q657920): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2010.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020065343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the memory requirements of XPath evaluation over XML streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient filtering of XML documents with XPath expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of XPath query evaluation and XML typing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for query processing on streaming and external memory data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two applications of information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case optimal algorithm for XPath evaluation over XML streams / rank
 
Normal rank

Latest revision as of 19:26, 4 July 2024

scientific article
Language Label Description Also known as
English
Memory lower bounds for XPath evaluation over XML streams
scientific article

    Statements

    Identifiers