Scalable approximate query processing with the DBO engine

  • Authors:
  • Chris Jermaine;Subramanian Arumugam;Abhijit Pol;Alin Dobra

  • Affiliations:
  • University of Florida;University of Florida;University of Florida;University of Florida

  • Venue:
  • ACM Transactions on Database Systems (TODS)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.