Work

An efficient algorithm for sequential random sampling

Year: 1987
Type: article
Abstract: We examine several methods for drawing a sequential random sample of n records from a file containing N records. Method D is recommended for general use. The algorithm is on-line (so that CPU time can be overlapped with I/O), has a small constant memory requirement, and is easy to program. An improved implementation is detailed in the Appendix.
Institution: Brown University
Language: English
Open Access status: bronze
OpenAlex ID: W2040793975
FWCI: 1.534
Cites: 9
Cited by: 91
Related to: 9