Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An efficient algorithm for sequential random sampling

An efficient algorithm for sequential random sampling 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Mathematical Software (TOMS) Association for Computing Machinery

An efficient algorithm for sequential random sampling

Download PDF
10 pages

Loading next page...
 
/lp/association-for-computing-machinery/an-efficient-algorithm-for-sequential-random-sampling-gN3zG1KQI1

References (11)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1987 by ACM Inc.
ISSN
0098-3500
DOI
10.1145/23002.23003
Publisher site
See Article on Publisher Site

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.

Journal

ACM Transactions on Mathematical Software (TOMS) – Association for Computing Machinery

Published: Mar 1, 1987

There are no references for this article.