Skip to main content

Top-k OLAP Queries Using Augmented Spatial Access Methods

  • Reference work entry
  • First Online:
  • 133 Accesses

Synonyms

OLAP Query; Top-k OLAP Queries Using Multi-resolution Tree Structures; Top-k Query

Definition

A top-k OLAP query groups measurements with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example of such a query is “find the 10 combinations of product-type and month with the largest sum of sales”. Top-k queries may also be applied in a spatial database context, where objects are augmented with some measures that must be aggregated according to a spatial division. For instance, consider a map of objects (e.g., restaurants) where each object carries some non-spatial measure (e.g., the number of customers served during the last month). Given a partitioning of the space into regions (e.g., city districts), the goal is to find the regions with the highest number of served customers. Formally, the top-k OLAP query can be defined as follows:

Let\(\mathcal{D} =\{ d_{1},\ldots, d_{m}\}\)be a set of m interesting...

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

Buying options

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

Learn about institutional subscriptions

References

  • Beckmann N, Kriegel H, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of ACM SIGMOD, Atlantic City, pp 220–231

    Google Scholar 

  • Fang M, Shivakumar N, Garcia-Molina H, Motwani R, Ullman JD (1998) Computing iceberg queries efficiently. In: Proceedings of VLDB, New York

    Google Scholar 

  • Han J, Stefanovic N, Koperski K (1998) Selective materialization: an efficient method for spatial data cube construction. In: Second Pacific-Asia conference, PAKDD-98, Melbourne, 15–17 Apr 1998, pp 144–158

    Google Scholar 

  • Harinarayan V, Rajaraman A, Ullman JD (1996) Implementing data cubes efficiently. In: Proceedings of ACM SIGMOD, Montreal, pp 205–216

    Google Scholar 

  • Hjaltason GR, Samet H (1999) Distance browsing in spatial databases. ACM TODS 24(2):265–318

    Article  Google Scholar 

  • Kalnis P, Mamoulis N, Bakiras S (2005) On discovering moving clusters in spatio-temporal data. In: Proceedings of the 9th international symposium on spatial and temporal databases (SSTD), Angra dos Reis, Aug 2005, pp 364–381

    Google Scholar 

  • Kimball R (1996) The data warehouse toolkit. Wiley, New York

    Google Scholar 

  • Lazaridis I, Mehrotra S (2001) Progressive approximate aggregate queries with a multi-resolution tree structure. In: Proceedings of ACM SIGMOD, Santa Barbara

    Book  Google Scholar 

  • Papadias D, Kalnis P, Zhang J, Tao Y (2001) Efficient OLAP operations in spatial data warehouses. In: Proceedings of SSTD, Redondo Beach

    Book  MATH  Google Scholar 

  • Pedersen TB, Tryfona N (2001) Pre-aggregation in spatial data warehouses. In: Proceedings of SSTD, Redondo Beach, pp 460–480

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nikos Mamoulis .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Mamoulis, N., Bakiras, S., Kalnis, P. (2017). Top-k OLAP Queries Using Augmented Spatial Access Methods. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_1391

Download citation

Publish with us

Policies and ethics