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. © 1987, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Vitter, J. S. (1987). An Efficient Algorithm for Sequential Random Sampling. ACM Transactions on Mathematical Software (TOMS), 13(1), 58–67. https://doi.org/10.1145/23002.23003
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free