Skip to main content
SpringerLink
Log in

Aggregate Queries, Progressive Approximate

  • Reference work entry
  • First Online:
Encyclopedia of GIS

  • 224 Accesses

Synonyms

Approximate aggregate query; On-line aggregation

Definition

Aggregate queries generally take a set of objects as input and produce a single scalar value as output, summarizing one aspect of the set. Commonly used aggregate types include MIN, MAX, AVG, SUM, and COUNT.

If the input set is very large, it might not be feasible to compute the aggregate precisely and in reasonable time. Alternatively, the precise value of the aggregate may not even be needed by the application submitting the query, e.g., if the aggregate value is to be mapped to an 8-bit color code for visualization. Hence, this motivates the use of approximate aggregate queries, which return a value close to the exact one, but at a fraction of the time.

Progressiveapproximate aggregate queries go one step further. They do not produce a single approximate answer, but continuously refine the answer as time goes on, progressively improving its quality. Thus, if the user has a fixed deadline, he can obtain the best...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  • Acharya S, Gibbons P, Poosala V, Ramaswamy S (1999) Joint synopses for approximate query answering. In: SIGMOD’99: proceedings of the 1999 ACM SIGMOD international conference on management of data. ACM Press, New York, pp 275–286

    Chapter  Google Scholar 

  • Chakrabarti K, Garofalakis MN, Rastogi R, Shim K (2000) Approximate query processing using wavelets. In: VLDB ’00: proceedings of the 26th international conference on very large data bases. Morgan Kaufmann, San Francisco, pp 111–122

    Google Scholar 

  • Garofalakis M, Kumar A (2005) Wavelet synopses for general error metrics. ACM Trans Database Syst 30(4):888–928

    Article  Google Scholar 

  • Hellerstein JM, Haas PJ, Wang HJ (1997) Online aggregation. In: SIGMOD’97: proceedings of the 1997 ACM SIGMOD international conference on management of data. ACM Press, New York, pp 171–182

    Chapter  Google Scholar 

  • Ioannidis YE, Poosala V (1999) Histogram-based approximation of set-valued query-answers. In: VLDB’99: proceedings of the 25th international conference on very large data bases. Morgan Kaufmann, San Francisco, pp 174–185

    Google Scholar 

  • Lazaridis I, Mehrotra S (2001) Progressive approximate aggregate queries with a multi-resolution tree structure. In: SIGMOD’01: proceedings of the 2001 ACM SIGMOD international conference on management of data. ACM Press, New York, pp 401–412

    Chapter  Google Scholar 

  • Lazaridis I, Mehrotra S (2004) Approximate selection queries over imprecise data. In: ICDE’04: proceedings of the 20th international conference on data engineering, Washington, DC. IEEE Computer Society

    Google Scholar 

  • Porkaew K, Lazaridis I, Mehrotra S, Winkler R (2001) Database support for situational awareness. In: Vassiliop MS, Huang TS (eds) Computer-science handbook for displays – summary of findings from the Army Research Lab’s advanced displays & interactive displays federated laboratory. Rockwell Scientific Company

    Google Scholar 

Recommended Reading

  • Karras P, Mamoulis N (2005) One-pass wavelet synopses for maximum-error metrics. In: VLDB’05: proceedings of the 31st international conference on very large data bases, Trondheim. VLDB Endowment, pp 421–432

    Google Scholar 

  • Lenz HJ, Jurgens M (1998) The Ra∗-tree: an improved r-tree with materialized data for supporting range queries on olap-data. In: DEXA workshop, Vienna

    Google Scholar 

  • Papadias D, Kalnis P, Zhang J, Tao Y (2001) Efficient OLAP operations in spatial data warehouses. In: SSTD’01: proceedings of the 7th international symposium on advances in spatial and temporal databases. Springer, London, pp 443–459

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Irvine, CA, USA

    Iosif Lazaridis & Sharad Mehrotra

Authors
  1. Iosif Lazaridis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sharad Mehrotra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Minnesota, Minneapolis, MN, USA

    Shashi Shekhar

  2. Management Science and Information Systems Department, Rutgers Business School, Rutgers, The State University of New Jersey, Newark, NJ, USA

    Hui Xiong

  3. Department of Management Sciences, Tippie College of Business, University of Iowa, Iowa City, IA, USA

    Xun Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Lazaridis, I., Mehrotra, S. (2017). Aggregate Queries, Progressive Approximate. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_41

Download citation

Publish with us

Policies and ethics

Search

Navigation