Skip to main content
SpringerLink
Log in

Skyline Queries and Pareto Optimality

  • Living reference work entry
  • First Online:
Encyclopedia of Database Systems

Synonyms

Pareto optimal tuples

Definition

Given two d-dimensional points p and q where d is a positive integer, p is said to dominate or Pareto-dominate q, denoted by p < q, if p is better than or equal to q on all dimensions and p is better than q on at least one of the d dimensions. Given a set D of d-dimensional points and a point p in D, p is said to be a skyline point in D if p is not dominated by any other points in D. A skyline query is to find all skyline points in D.

Each dimension can be numeric or categorical. If a dimension is numeric, all values in this dimension are totally ordered. For any two values in the dimension, one value is more preferable than the other value. One example of a numeric dimension is the price of a product where a smaller value is more preferable. Another example of a numeric dimension is the hotel class where a higher value is more preferable. If a dimension is categorical, the ordering on the values in this dimension is more complicated. One...

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

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Kung H-T, Luccio F, Preparata FP. On finding the maxima of a set of vectors. J ACM. 1975;22(4):469–76.

    Article  MathSciNet  MATH  Google Scholar 

  2. Borzsony S, Kossmann D, Stocker K. The skyline operator. In: Proceedings of 17th international conference on data engineering, 2001. Heidelberg: IEEE; 2001. p. 421–30.

    Google Scholar 

  3. Chomicki J, Godfrey P, Gryz J, Liang D. Skyline with pre-sorting. In: International conference on data engineering, Bangalore, vol. 3. 2003. p. 717–9.

    Google Scholar 

  4. Papadias D, Tao Y, Fu G, Seeger B. An optimal and progressive algorithm for skyline queries. In: Proceedings of the 2003 ACM SIGMOD international conference on management of data. San Diego: ACM; 2003. p. 467–78.

    Google Scholar 

  5. Tan K, Eng P, Ooi B. Efficient progressive skyline computation. In: International conference on very large data bases, Roma; 2001.

    Google Scholar 

  6. Kossmann D, Ramsak F, Rost S. Shooting stars in the sky: an online algorithm for skyline queries. In: International conference on very large data bases, Hong Kong; 2002.

    Google Scholar 

  7. Chan C-Y, Eng P-K, Tan K-L. Stratified computation of skylines with partially-ordered domains. In: International conference on management of data, Baltimore; 2005.

    Google Scholar 

  8. Wong RC-W, Pei J, Fu AW-C, Wang K. Mining favorable facets. In: International conference on knowledge discovery and data mining, San Jose; 2007.

    Google Scholar 

  9. Lin X, Yuan Y, Zhang Q, Zhang Y. Selecting stars: the k most representative skyline operator. In: IEEE 23rd international conference on data engineering, 2007. ICDE 2007. Istanbul: IEEE; 2007. p. 86–95.

    Google Scholar 

  10. Tao Y, Ding L, Lin X, Pei J. Distance-based representative skyline. In: IEEE 25th international conference on data engineering, 2009. ICDE’09. Shanghai: IEEE; 2009. p. 892–903.

    Google Scholar 

  11. Wan Q, Wong RC-W, Ilyas IF, Ozsu MT, Peng Y. Cre-ating competitive products. In: The 35th International Conference on Very Large Data Bases (VLDB’09), Lyon; 2009.

    Google Scholar 

  12. Wan Q, Wong RC-W, Peng Y. Finding top-k profitable products. In: The 27th International Conference on Data Engineering (ICDE’11), Hannover; 2011.

    Google Scholar 

  13. Balke W-T, Güntzer U, Zheng JX. Efficient distributed skylining for web information systems. In: Advances in database technology-EDBT 2004. Heraklion: Springer; 2004. p. 256–73.

    Google Scholar 

  14. Bartolini I, Ciaccia P, Patella M. The skyline of a probabilistic relation. Knowl Data Eng IEEE Trans. 2013;25(7):1656–69.

    Article  Google Scholar 

  15. Chomicki J, Ciaccia P, Meneghetti N. Skyline queries, front and back. ACM SIGMOD Rec. 2013;42(3):6–18.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Alibaba, 969 West Wen Yi Road, Yu Hang District, Hangzhou, 311121, China

    Peng Peng

  2. Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong

    Raymond Chi-Wing Wong

Authors
  1. Peng Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raymond Chi-Wing Wong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raymond Chi-Wing Wong .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, Georgia, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, Ontario, Canada

    M. Tamer Özsu

Section Editor information

  1. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada

    Ihab Ilyas

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media LLC

About this entry

Cite this entry

Peng, P., Wong, R.CW. (2016). Skyline Queries and Pareto Optimality. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_80684-1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_80684-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

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

Publish with us

Policies and ethics

Search

Navigation