Random Sampling from Database Files: A Survey.
Frank Olken, Doron Rotem:
Random Sampling from Database Files: A Survey.
SSDBM 1990: 92-111@inproceedings{DBLP:conf/ssdbm/OlkenR90,
author = {Frank Olken and
Doron Rotem},
editor = {Zbigniew Michalewicz},
title = {Random Sampling from Database Files: A Survey},
booktitle = {Statistical and Scientific Database Management, 5th International
Conference SSDBM, Charlotte, NC, USA, April 3-5, 1990, Proccedings},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {420},
year = {1990},
isbn = {3-540-52342-1},
pages = {92-111},
ee = {db/conf/ssdbm/OlkenR90.html},
crossref = {DBLP:conf/ssdbm/90},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
CDROM Version: Load the CDROM "Volume 2 Issue 5, SSDBM, DBPL, KRDB, ADBIS, COOPIS, SIGBDP" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Zbigniew Michalewicz (Ed.):
Statistical and Scientific Database Management, 5th International Conference SSDBM, Charlotte, NC, USA, April 3-5, 1990, Proccedings.
Lecture Notes in Computer Science 420 Springer 1990, ISBN 3-540-52342-1
Contents
References
- [Ark84]
- ...
- [BK75]
- ...
- [Coc77]
- William G. Cochran:
Sampling Techniques, 3rd Edition.
John Wiley 1977, ISBN 0-471-16240-X

- [Den80]
- Dorothy E. Denning:
Secure Statistical Databases with Random Sample Queries.
ACM Trans. Database Syst. 5(3): 291-315(1980)

- [EN82]
- Jarmo Ernvall, Olli Nevalainen:
An Algorithm for Unbiased Random Sampling.
Comput. J. 25(1): 45-47(1982)

- [FMR62]
- ...
- [Gho86]
- Sakti P. Ghosh:
SIAM: Statistics Information Access Method.
SSDBM 1986: 286-293

- [HOT88]
- Wen-Chi Hou, Gultekin Özsoyoglu, Baldeo K. Taneja:
Statistical Estimators for Relational Algebra Expressions.
PODS 1988: 276-287

- [HOT89]
- Wen-Chi Hou, Gultekin Özsoyoglu, Baldeo K. Taneja:
Processing Aggregate Relational Queries with Hard Time Constraints.
SIGMOD Conference 1989: 68-77

- [Knu73]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X

- [Lar80]
- Per-Åke Larson:
Linear Hashing with Partial Expansions.
VLDB 1980: 224-232

- [Lit80]
- Witold Litwin:
Linear Hashing: A New Tool for File and Table Addressing.
VLDB 1980: 212-223

- [LTA79]
- ...
- [LWW84]
- ...
- [Mon85]
- ...
- [Mor80]
- ...
- [NHS84]
- Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik:
The Grid File: An Adaptable, Symmetric Multikey File Structure.
ACM Trans. Database Syst. 9(1): 38-71(1984)

- [OR]
- Frank Olken, Doron Rotem:
Random Sampling from B+ Trees.
VLDB 1989: 269-277

- [OR86]
- Frank Olken, Doron Rotem:
Simple Random Sampling from Relational Databases.
VLDB 1986: 160-169

- [Pal85]
- Prashant Palvia:
Expressions for Batched Searching of Sequential and Hierarchical Files.
ACM Trans. Database Syst. 10(1): 97-106(1985)

- [SL88]
- Jaideep Srivastava, Vincent Y. Lum:
A Tree Based Access Method (TBSAM) for Fast Processing of Aggregate Queries.
ICDE 1988: 504-510

- [Vit84]
- Jeffrey Scott Vitter:
Faster Methods for Random Sampling.
Commun. ACM 27(7): 703-718(1984)

- [Vit85]
- Jeffrey Scott Vitter:
Random Sampling with a Reservoir.
ACM Trans. Math. Softw. 11(1): 37-57(1985)

- [WE80]
- C. K. Wong, Malcolm C. Easton:
An Efficient Method for Weighted Sampling Without Replacement.
SIAM J. Comput. 9(1): 111-113(1980)

- [Wil84]
- Dan E. Willard:
Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract).
ICALP 1984: 514-526

- [Yao77]
- S. Bing Yao:
Approximating the Number of Accesses in Database Organizations.
Commun. ACM 20(4): 260-261(1977)

Referenced by
- Dimitrios Gunopulos, George Kollios, Vassilis J. Tsotras, Carlotta Domeniconi:
Approximating Multi-Dimensional Aggregate Range Queries over Real Attributes.
SIGMOD Conference 2000: 463-474
- David Gross, Michel de Rougemont:
Uniform Generation in Spatial Constraint Databases and Applications.
PODS 2000: 254-259
- Richard H. Wolniewicz, Goetz Graefe:
Algebraic Optimization of Computations over Scientific Databases.
VLDB 1993: 13-24
Copyright © Mon Nov 2 21:14:51 2009
by Michael Ley (ley@uni-trier.de)