Skip to main content

Skyline Queries

  • Living reference work entry
  • First Online:
  • 124 Accesses

Synonyms

Branch and Bound; Divide and conquer; Information Retrieval; Nearest Neighbor algorithm; Nested-loop, blocked; Ranking Results; Ranking, multi-dimensional; Search, multi-criteria; Search, multi-dimensional; Top-N queries

Definition

Given a set of points p 1p 2, …, p n , the skyline query returns a set of points P, called skyline points, such that any point p i  ∈ P is not dominated by any other point in the dataset. A point p 1 dominates another point p 2 if p 1 is not worse than p 2 in all dimensions, and p 1 is better than p 2 in at least one dimension. In other words, a point p 1 dominates another point p 2 if and only if the coordinate of p 1 on any axis is smaller than the corresponding coordinate of p 2.

For example, Fig. 1 shows a dataset containing information about hotels. The distance of the hotel from the beach and the price for each hotel are assigned to the X, Yaxis of the plot respectively. There are 12 hotels in total represented as data-points in the...

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

References

  • Baorzsaonyi S, Kossmann D, Stocker K (2001) The skyline operator. In: ICDE, Heidelberg, pp 421–430

    Google Scholar 

  • Chomicki J, Godfrey P, Gryz J, Liang D (2003) Skyline with presorting. In: Proceedings of ICDE’03, Bangalore. IEEE Computer Society, pp 717–816

    Google Scholar 

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

    Article  Google Scholar 

  • Kossmann D, Ramsak F, Rost S (2002) Shooting stars in the sky: an online algorithm for skyline queries. In: Proceedings of VLDB’02, Hong Kong, pp 275–286

    Google Scholar 

  • Lin X, Yuan Y, Wang W, Lu H (2005) Stabbing the Sky: efficient skyline computation over sliding windows. In: Proceedings of ICDE’05, Tokyo. IEEE Computer Society, pp 502–513

    Google Scholar 

  • Matousek J (1991) Computing dominance in En. Inf Process Lett 38:277–278

    Article  MathSciNet  MATH  Google Scholar 

  • Papadias D, Tao Y, Fu G, Seeger B (2003) An optimal and progressive algorithm for skyline queries. In: ACM SIGMOD, San Diego

    Book  Google Scholar 

  • Papadias D, Tao Y, Fu G, Seeger B (2005) Progressive skyline computation in database systems. ACM Trans Database Syst 30(1):41–82

    Article  Google Scholar 

  • Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbour queries. In: SIGMOD

    Google Scholar 

  • Stojmenovic I, Miyakawa M (1988) An optimal parallel algorithm for solving the maximal elements problem in the plane. Parallel Comput 7(2):249–251

    Article  MathSciNet  MATH  Google Scholar 

  • Tan KL, Eng PK, Ooi BC (2001) Efficient progressive skyline computation. In: Proceedings of VLDB’01, pp 301–310

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this entry

Cite this entry

Thakur, N. (2016). Skyline Queries. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-23519-6_1221-2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23519-6_1221-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Cham

  • Online ISBN: 978-3-319-23519-6

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics