Faster methods for random sampling
Communications of the ACM
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Computer methods for sampling from the exponential and normal distributions
Communications of the ACM
A note on sampling a tape-file
Communications of the ACM
An efficient algorithm for sequential random sampling
ACM Transactions on Mathematical Software (TOMS)
An Improved Algorithm for Ordered Sequential Random Sampling
ACM Transactions on Mathematical Software (TOMS)
Applying the golden rule of sampling for query estimation
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Clustering High Dimensional Massive Scientific Datasets
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
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.