Sequential random sampling
- 1 June 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 11 (2) , 157-169
- https://doi.org/10.1145/214392.214402
Abstract
Fast algorithms for selecting a random set of exactly k records from a file of n records are constructed. Selection is sequential: the sample records are chosen in the same order in which they occur in the file. All procedures run in O(k) time. The “geometric” method has two versions: with or without O(k) auxiliary space. A further procedure uses hashing techniques and requires O(k) space.Keywords
This publication has 5 references indexed in Scilit:
- Faster methods for random samplingCommunications of the ACM, 1984
- Two efficient algorithms for random sampling without replacementInternational Journal of Computer Mathematics, 1982
- Computer methods for sampling from the exponential and normal distributionsCommunications of the ACM, 1972
- A note on sampling a tape-fileCommunications of the ACM, 1962
- Development of Sampling Plans by Using Sequential (Item by Item) Selection Techniques and Digital ComputersJournal of the American Statistical Association, 1962