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
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,241 | Machine Models and Lower Bounds for Query Processing | 2007 | PODS | 4.5519176e-05 |
| 12,489 | Randomized Computations on Large Data Sets: Tight Lower Bounds | 2006 | PODS | 4.1945683e-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 |
|---|---|---|---|---|
| 43 | Models and Issues in Data Stream Systems | 2002 | PODS | 0.00072723062 |
| 2,855 | Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach | 2003 | VLDB | 8.0059865e-05 |
| 3,695 | On the Memory Requirements of XPath Evaluation over XML Streams | 2004 | PODS | 6.8345021e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,832 | A Study of Sorting Algorithms on Approximate Memory | 2016 | SIGMOD | 4.1945683e-05 |
| 1,904 | Characterizing Memory Requirements for Queries over Continuous Data Streams | 2002 | PODS | 0.00010154528 |
| 1,607 | A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort | 2014 | SIGMOD | 0.00011162682 |
| 8,241 | Machine Models and Lower Bounds for Query Processing | 2007 | PODS | 4.5519176e-05 |
| 7,846 | Dynamic Top-K Range Reporting in External Memory | 2012 | PODS | 4.6365341e-05 |
| 5,013 | A Lower Bound Theorem for Indexing Schemes and its Application to Multidimensional Range Queries | 1998 | PODS | 5.7598528e-05 |
| 3,695 | On the Memory Requirements of XPath Evaluation over XML Streams | 2004 | PODS | 6.8345021e-05 |
| 4,832 | Dynamic Memory Adjustment for External Mergesort | 1997 | VLDB | 5.8924168e-05 |
| 4,741 | Memory-Adaptive External Sorting | 1993 | VLDB | 5.95905e-05 |
| 12,489 | Randomized Computations on Large Data Sets: Tight Lower Bounds | 2006 | PODS | 4.1945683e-05 |