Skip to main content
SpringerLink
Log in

Aggregation Query, Spatial

  • Reference work entry
  • First Online:
Book cover Encyclopedia of GIS

  • 83 Accesses

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

References

  • Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R∗-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, Atlantic City, pp 322–331

    Google Scholar 

  • Bentley JL (1980) Multidimensional divide-and-conquer. Commun ACM 23(4):214–229

    Article  MathSciNet  MATH  Google Scholar 

  • Bentley JL, Saxe NB (1980) Decomposable searching problems I: static-to-dynamic transformations. J Algorithms 1(4):301–358

    Article  MathSciNet  MATH  Google Scholar 

  • Chiang Y, Tamassia R (1992) Dynamic algorithms in computational geometry. Proc IEEE Spec Issue Comput Geom 80(9):1412–1434

    Google Scholar 

  • Chung C, Chun S, Lee J, Lee S (2001) Dynamic update cube for range-sum queries. In: VLDB, Roma, pp 521–530

    Google Scholar 

  • Geffner S, Agrawal D, El Abbadi A (2000) The dynamic data cube. In: EDBT, Konstanz, pp 237–253

    Google Scholar 

  • Lazaridis I, Mehrotra S (2001) Progressive approximate aggregate queries with a multi-resolution tree structure. In: SIGMOD, Santa Barbara, pp 401–412

    Google Scholar 

  • Overmars MH (1983) The design of dynamic data structures. Lecture notes in computer science, vol 156. Springer, Heidelberg

    Google Scholar 

  • Papadias D, Kalnis P, Zhang J, Tao Y (2001) Efficient OLAP operations in spatial data warehouses. In: Jensen CS, Schneider M, Seeger B, Tsotras VJ (eds) Advances in spatial and temporal databases, 7th international symposium, SSTD 2001, Redondo Beach, July 2001. Lecture notes in computer science, vol 2121. Springer, Heidelberg, pp 443–459

    Google Scholar 

  • Robinson J (1981) The K-D-B tree: a search structure for large multidimensional dynamic indexes. In: SIGMOD, Orlando, pp 10–18

    Google Scholar 

  • Vitter JS (2001) External memory algorithms and data structures. ACM Comput Surv 33(2):209–271

    Article  Google Scholar 

  • Zhang D, Tsotras VJ, Gunopulos D (2002) Efficient aggregation over objects with extent. In: PODS, Madison, pp 121–132

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer and Information Science, Northeastern University, Boston, MA, USA

    Donghui Zhang

Authors
  1. Donghui Zhang
    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

Zhang, D. (2017). Aggregation Query, Spatial. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_43

Download citation

Publish with us

Policies and ethics

Search

Navigation