|
DSpace at IIT Bombay >
IITB Publications >
Proceedings papers >
Please use this identifier to cite or link to this item:
http://dspace.library.iitb.ac.in/jspui/handle/100/1268
|
| Title: | Selectivity and cost estimation for joins based on random sampling |
| Authors: | HAAS, PJ NAUGHTON, JF SESHADRI, S SWAMI, AN |
| Keywords: | databases |
| Issue Date: | 1996 |
| Publisher: | ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS |
| Citation: | JOURNAL OF COMPUTER AND SYSTEM SCIENCES,52(3)550-569 |
| Abstract: | We compare the performance of sampling-based procedures for estimating the selectivity of a join. While some of the procedures have been proposed in the database literature, their relative performance has never been analyzed. A main result of this paper is a partial ordering that compares the variability of the estimators for the different procedures after an arbitrary fixed number of sampling steps. Prior to the current work, it was also unknown whether these fixed-step procedures could be extended to fixed-precision procedures that are both asymptotically consistent and asymptotically efficient.: Our second main result is a general method for such an extension and a proof that the method is valid for all the procedures under consideration. We show that, under plausible assumptions on sampling costs, the partial ordering of the fixed-step procedures with respect to variability of the selectivity estimator implies a partial ordering of the corresponding fixed-precision procedures with respect to sampling cost. Our final result is a collection of fixed-step and fixed-precision procedures for estimating the cost of processing a join query according to a fixed join plan. (C) 1996 Academic Press, Inc. |
| URI: | http://dx.doi.org/10.1006/jcss.1996.0041 http://dspace.library.iitb.ac.in/xmlui/handle/10054/14457 http://hdl.handle.net/100/1268 |
| ISSN: | 0022-0000 |
| Appears in Collections: | Proceedings papers
|
Files in This Item:
There are no files associated with this item.
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|