Scalable approximate query processing with the DBO engine
Authors:
Open Access
- 1 November 2008
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 33 (4) , 1-54
Abstract
This article describes query processing in the DBO database system. Like other database systems designed for ad hoc analytic processing, DBO is able to compute the exact answers to queries over a large relational database in a scalable fashion. Unlike any other system designed for analytic processing, DBO can constantly maintain a guess as to the final answer to an aggregate query throughout execution, along with statistically meaningful bounds for the guess's accuracy. As DBO gathers more and more information, the guess gets more and more accurate, until it is 100% accurate as the query is completed. This allows users to stop the execution as soon as they are happy with the query accuracy, and thus encourages exploratory data analysis.Keywords
Funding Information
- National Science Foundation (3.47E+12)
This publication has 13 references indexed in Scilit:
- Scalable approximate query processing with the DBO engine2007
- A disk-based join with probabilistic guarantees2005
- A scalable hash ripple join algorithm2002
- Interactive data analysis: the Control projectComputer, 1999
- Approximate computation of multidimensional aggregates of sparse data using wavelets1999
- Ripple joins for online aggregation1999
- Join synopses for approximate query answeringACM SIGMOD Record, 1999
- Online aggregationACM SIGMOD Record, 1997
- Selectivity and Cost Estimation for Joins Based on Random SamplingJournal of Computer and System Sciences, 1996
- Join processing in database systems with large main memoriesACM Transactions on Database Systems, 1986