On Random Sampling over Joins

Surajit Chaudhuri, Rajeev Motwani, and Vivek Narasayya


A major bottleneck in implementing sampling as a primitive relational operation is the inefficiency of sampling the output of a query. It is not even known whether it is possible to

generate a sample of a join tree without first evaluating the join tree completely. We undertake a detailed study of this problem and attempt to analyze it in a variety of settings. We present theoretical results explaining the difficulty of this problem and setting limits on the efficiency that can be achieved. Based on new insights into the interaction between join and sampling, we develop join sampling techniques for the settings where our negative results do not apply. Our new sampling algorithms are significantly more efficient than those known earlier. We present experimental evaluation of our techniques on Microsoft's SQL Server 7.0.


Publication typeInproceedings
Published inSIGMOD
PublisherAssociation for Computing Machinery, Inc.
> Publications > On Random Sampling over Joins