Lower bounds for processing data with few random accesses to external memory

DOI10.1145/1516512.1516514zbMath1325.68098OpenAlexW2004196714MaRDI QIDQ3452210

Martin Grohe, Nicole Schweikardt, André Hernich

Publication date: 11 November 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1516512.1516514

zbMATH Keywords

XMLcomplexityquery processingdata streamsquery optimizationreal-time datasemi-structured data

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information storage and retrieval of data (68P20)

This page was built for publication: Lower bounds for processing data with few random accesses to external memory