Synonyms
Approximate query answering
Definition
Query processing in a database context is the process that deduces information that is available in the database. Due to the huge amount of data available, one of the main issues of query processing is how to process queries efficiently. In many cases, it is impossible or too expensive for users to get exact answers in the short query response time. Approximate query processing (AQP) is an alternative way that returns approximate answer using information which is similar to the one from which the query would be answered. It is designed primarily for aggregate queries such as count, sum and avg, etc. Given a SQL aggregate query Q, the accurate answer is y while the approximate answer is y′. The relative error of query Q can be quantified as:
The goal of approximate query processing is to provide approximate answers with acceptable accuracy in orders of magnitude less query response...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Morgenstein J. Computer based management information systems embodying answer accuracy as a user parameter. PhD thesis, University of California, Berkeley; 1980.
Garofalakis M, Gibbons P. Approximate query processing: taming the teraBytes: a tutorial. In: Proceedings of the 27th Interantional Conference on Very Large Data Bases; 2001.
Ioannidis Y. Approximation in database systems. In: Proceedings of the 9th International Conference on Database Theory; 2003. p. 16–30.
Das G. Sampling methods in approximate query answering systems. In: Wang J, editors. Invited Book Chapter, Encyclopedia of data warehousing and mining. Information Science Publishing; 2005.
Poosala V, Ioannidis Y. Selectivity estimation without the attribute value independence assumption. In: Proceedings of the 23th International Conference on Very Large Data Bases; 1997. p. 466–75.
Poosala V, Ioannidis Y, Haas P, Shekita E. Improved histograms for selectivity estimation of range predicates. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1996. p. 294–305.
Ioannidis Y. The history of histograms (abridged). In: Proceedings of the 29th International Conference on Very Large Data Bases; 2003. p. 19–30.
Matias Y, Vitter J, Wang M. Wavelet based histograms for selectivity estimation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1998. p. 448–59.
Das A, Gehrke J, Riedewald M. Approximation techniques for spatial data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2004. p. 695–700.
Hellerstein J, Haas P, Wang H. Online aggregation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1997. p. 171–82.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Liu, Q. (2018). Approximate Query Processing. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_534
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_534
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering