|
|
|
     |
                                     |
Return to Approximate Querying
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering is sampling. For many aggregation queries, appropriately constructed biased (non-uniform) samples can provide more accurate approximations than a uniform sample. The optimal type of bias, however, varies from query to query. In this paper, we describe an approximate query processing technique that dynamically constructs an appropriately biased sample for each query by combining samples selected from a family of non-uniform samples that are constructed during a pre-processing phase. We show that dynamic selection of appropriate portions of previously constructed samples can provide more accurate approximate answers than static, non-adaptive usage of uniform or non-uniform samples.
@inproceedings {DBLP:conf/sigmod/BabcockCD03, author = {Brian Babcock and Surajit Chaudhuri and Gautam Das}, booktitle = {SIGMOD Conference}, title = {Dynamic Sample Selection for Approximate Query Processing.}, pages = {539-550}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#BabcockCD03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r20p01.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
