Selection and sorting with limited storage

Authors:
J. I. Munro;M. S. Paterson
Affiliations:
-;-
Venue:
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Year:
1978

Citing 0
Cited 6

Comparison-based time-space lower bounds for selection

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Best-Order Streaming Model

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Probabilistic anonymity

PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
Distributed processing of continuous sliding-window k-NN queries for data stream filtering

World Wide Web
Survey: Streaming techniques and data aggregation in networks of tiny artefacts

Computer Science Review
Competitive analysis of maintaining frequent items of a stream

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

When selecting from, or sorting, a file stored on a read-only tape and the internal storage is rather limited, several passes of the input tape may be required. We study the relation between the amount of internal storage available and the number of passes required to select the Kth highest of N inputs. We show, for example, that to find the median in two passes requires at least Ω(N1/2) and at most O(N1/2 log N) internal storage. For probabilistic methods, Θ(N1/2) internal storage is necessary and sufficient for a single pass method which finds the median with arbitrarily high probability.