Parallel random sampling
作者： Gang Luo , Ambuj Shatdal
DOI:
关键词:
摘要: A parallel random sampling algorithm (such as a simple algorithm) utilizes the parallelism of relational database management system. number generator in one node generates seeds for second each nodes. Random numbers generated by generators are used to obtain sample tuples
lens.org 参考文章(8)
David Cossock, Method and apparatus determining and using hash functions and hash values ,(1998)
Vijayakumar Anjur, Ambuj Shatdal, Stratified sampling of data in a database system ,(2002)
Michael W. Martin, Interval-partitioning method for multidimensional data ,(1998)
Vivek Narasayya, Surajit Chaudhuri, What-if index analysis utility for database systems ,(1998)
Ralph Edward Sipple, James Michael Plasek, Statistical database query using random sampling of records ,(1996)
Rajeev Motwani, Joseph (Seffi) Naor, Moni Naor, The probabilistic method yields deterministic parallel algorithms foundations of computer science. ,vol. 49, pp. 478- 516 ,(1989) , 10.1016/S0022-0000(05)80069-8
Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G. Lindsay, Random sampling techniques for space efficient online computation of order statistics of large datasets ACM SIGMOD Record. ,vol. 28, pp. 251- 262 ,(1999) , 10.1145/304181.304204
Ambuj Shatdal, Random sampling of rows in a parallel processing database system ,(1999)