Approximate query processing using wavelets

Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-support systems. Most work in this area, however, has so far been limited in its applicability and query processing scope. In this paper, we propose the use of multi-dimensional wavelets as an effective tool for general-purpose approximate query processing in modern, high-dimensional applications. Our approach is based on building wavelet-coefficient synopses of the data and using these synopses to provide approximate answers to queries. We develop novel query processing algorithms that operate directly on the wavelet-coefficient synopses of relational tables, allowing us to process arbitrarily complex queries entirely in the wavelet-coefficient domain. This, of course, guarantees extremely fast response times since our approximate query execution engine can do the bulk of its processing over compact sets of wavel...

• Type: Conference
• Year: 2001
• Where: VLDB
• Authors: Kaushik Chakrabarti, Minos N. Garofalakis, Rajeev Rastogi, Kyuseok Shim
• Keywords: Approximate Query Execution, Approximate Query Processing, Database, General-purpose Approximate Query, VLDB 2001