Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 3508–3512Cite as

Skyline Queries and Pareto Optimality

  • Reference work entry
  • First Online:

  • 24 Accesses

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.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.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

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 the 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: Proceedings of the 19th International Conference on Data Engineering; 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 ACM SIGMOD International Conference on Management of Data; 2003. p. 467–78.

    Google Scholar 

  5. Tan K, Eng P, Ooi B. Efficient progressive skyline computation. In: Proceedings of the 27th International Conference on Very Large Data Bases; 2001.

    Google Scholar 

  6. Kossmann D, Ramsak F, Rost S. Shooting stars in the sky: an online algorithm for skyline queries. In: Proceedings of the 28th International Conference on Very Large Data Bases; 2002.

    Google Scholar 

  7. Chan C-Y, Eng P-K, Tan K-L. Stratified computation of skylines with partially-ordered domains. In: Proceedings of the 21st International Conference on Data Engineering; 2005.

    Google Scholar 

  8. Wong RC-W, Pei J, Fu AW-C, Wang K. Mining favorable facets. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2007.

    Google Scholar 

  9. Lin X, Yuan Y, Zhang Q, Zhang Y. Selecting stars: the k most representative skyline operator. In: Proceedings of the 23rd International Conference on Data Engineering; 2007. p. 86–95.

    Google Scholar 

  10. Tao Y, Ding L, Lin X, Pei J. Distance-based representative skyline. In: Proceedings of the 25th International Conference on Data Engineering; 2009. p. 892–903.

    Google Scholar 

  11. Wan Q, Wong RC-W, Ilyas IF, Ozsu MT, Peng Y. Creating competitive products. In: Proceedings of the 35th International Conference on Very Large Data Bases; 2009.

    Article  Google Scholar 

  12. Wan Q, Wong RC-W, Peng Y. Finding top-k profitable products. In: Proceedings of the 27th International Conference on Data Engineering; 2011.

    Google Scholar 

  13. Balke W-T, Güntzer U, Zheng JX. Efficient distributed skylining for web information systems. In: Advances in Database Technology, Proceedings of the 9th International Conference on Extending Database Technology; 2004. p. 256–73.

    Chapter  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, Yu Hang District, Hangzhou, China

    Peng Peng & Raymond Chi-Wing Wong

  2. Department of Computer Science and Engineering, The 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, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, 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

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

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

Download citation

Publish with us

Policies and ethics

Search

Navigation