Knowing When You’re Wrong: Building Fast and Reliable Approximate Query Processing Systems

Modern data analytics applications typically process massive amounts of data on clusters of tens, hundreds, or thousands of ma-chines to support near-real-time decisions. The quantity of data and limitations of disk and memory bandwidth often make it infeasible to deliver answers at interactive speeds. However, it has been widely observed that many applications can tolerate some degree of inac-curacy. This is especially true for exploratory queries on data, where users are satisfied with “close-enough ” answers if they can come quickly. A popular technique for speeding up queries at the cost of accuracy is to execute each query on a sample of data, rather than the whole dataset. To ensure that the returned result is not too inaccu-rate, past work on approximate query processing has used statistical techniques to estimate “error bars ” on returned results. However, existing work in the sampling-based approximate query processing (S-AQP) community has not validated whether these techniques ac-tually generate accurate error bars for real query workloads. In fact, we find that error bar estimation often fails on real world produc-tion workloads. Fortunately, it is possible to quickly and accurately diagnose the failure of error estimation for a query. In this paper, we show that it is possible to implement a query approximation pipeline that produces approximate answers and reliable error bars at inter-active speeds