Lower Bounds for Sorting with Few Random Accesses to External Memory
Summary: Model bounding main-memory and number of random external accesses while allowing unlimited auxiliary external storage and free sequential scans (captures multi-pass annotated workflows like Koch's ARB). Proves combinatorial lower bounds for sorting by simulating the model with a non-uniform computation model, since communication-complexity techniques do not apply. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Martin Grohe (Humboldt University of Berlin)
- 2. Nicole Schweikardt (Humboldt University of Berlin)
BibTeX Citation
@inproceedings{grohe_pods05,
address = {New York, NY, USA},
series = {{PODS} '05},
title = {{Lower Bounds for Sorting with Few Random Accesses to External Memory}},
url = {https://dl.acm.org/doi/10.1145/1065167.1065197},
doi = {10.1145/1065167.1065197},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Grohe, Martin and Schweikardt, Nicole},
year = {2005}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,488 | Machine Models and Lower Bounds for Query Processing | 2007 | PODS | 5.4153038e-05 |
| 12,682 | Randomized Computations on Large Data Sets: Tight Lower Bounds | 2006 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 26 | Models and Issues in Data Stream Systems | 2002 | PODS | 0.00052982574 |
| 2,625 | Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach | 2003 | VLDB | 8.3300135e-05 |
| 3,659 | On the Memory Requirements of XPath Evaluation over XML Streams | 2004 | PODS | 7.2176232e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,033 | A Study of Sorting Algorithms on Approximate Memory | 2016 | SIGMOD |
| 2 | 1,656 | Characterizing Memory Requirements for Queries over Continuous Data Streams | 2002 | PODS |
| 3 | 1,177 | A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort | 2014 | SIGMOD |
| 4 | 8,488 | Machine Models and Lower Bounds for Query Processing | 2007 | PODS |
| 5 | 8,173 | Dynamic Top-K Range Reporting in External Memory | 2012 | PODS |
| 6 | 4,730 | A Lower Bound Theorem for Indexing Schemes and its Application to Multidimensional Range Queries | 1998 | PODS |
| 7 | 4,955 | Dynamic Memory Adjustment for External Mergesort | 1997 | VLDB |
| 8 | 3,659 | On the Memory Requirements of XPath Evaluation over XML Streams | 2004 | PODS |
| 9 | 4,708 | Memory-Adaptive External Sorting | 1993 | VLDB |
| 10 | 12,682 | Randomized Computations on Large Data Sets: Tight Lower Bounds | 2006 | PODS |