DBScholar

Back to papers

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)

Paper ID
1356
Venue
PODS
Year
2005
Pagerank
5.093636e-05
Overall Rank
12,723 | 12.71%
DOI
10.1145/1065167.1065197

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers