Skip to main content

Preference Queries

  • Reference work entry
  • First Online:

Synonyms

Ranking queries

Definition

A preference query is a query obtained by augmenting a database query with user-defined preferences (preference specification), so that the preference query returns not all the answers but only the best, most preferred answers. For example, given a binary preference relation, a winnow preference query may return all the undominated tuples belonging to the input (all the tuples to which no tuples in the input are preferred). As another example, given a numeric scoring function a preference Top-K query returns K answers, if available, with the highest scores. Note: Top-K queries are not considered in this article because they are covered in a separate article.

Historical Background

An early paper [1] viewed preference queries in the context of relational query relaxation. The answers satisfying the query condition would be the best; the answers obtained by progressively weakening the query condition would be less and less preferred. So in the absence...

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   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. Lacroix M, Lavency P. Preferences: putting more knowledge into queries. In: Proceedings of the 13th International Conference on Very Large Data Bases; 1987. p. 217–25.

    Google Scholar 

  2. Govindarajan K, Jayaraman B, Mantha S. Preference logic programming. In: Proceedings of the 12th International Conference on Logic Programming; 1995. p. 731–45.

    Google Scholar 

  3. Kießling W, Güntzer U. Database reasoning – a deductive framework for solving large and complex problems by means of subsumption. In: Proceedings of the 3rd Workshop on Information Systems and Artificial Intelligence; 1994. p. 118–38.

    Google Scholar 

  4. Chomicki J. Preference formulas in relational queries. ACM Trans Database Syst. 2003;28(4):427–66.

    Article  MathSciNet  Google Scholar 

  5. Kießling W. Foundations of preferences in database systems. In: Proceedings of the 28th International Conference on Very Large Data Bases; 2002. p. 311–22.

    Chapter  Google Scholar 

  6. Torlone R, Ciaccia P. Which are my preferred items? In: Proceedings of the AH’2002 Workshop on Recommendation and Personalization in eCommerce; 2002.

    Google Scholar 

  7. Börzsönyi S, Kossmann D, Stocker K. The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering; 2001. p. 421–30.

    Google Scholar 

  8. Chomicki J, Godfrey P, Gryz J, Liang D. Skyline with presorting. In: Proceedings of the 19th International Conference on Data Engineering; 2003. p. 717–19.

    Google Scholar 

  9. Hafenrichter B, Kießling W. Optimization of relational preference queries. In: Proceedings of the 16th Australasian Database Conference; 2005. p. 175–84.

    Google Scholar 

  10. Chomicki J. Semantic optimization techniques for preference queries. Inf Syst. 2007;32(5):660–74.

    Article  Google Scholar 

  11. Kießling W, Köstler G. Preference SQL – design, implementation, experience. In: Proceedings of the 28th International Conference on Very Large Data Bases; 2002. p. 990–1001.

    Chapter  Google Scholar 

  12. Koutrika G, Ioannidis Y. Personalization of queries in database systems. In: Proceedings of the 20th International Conference on Data Engineering; 2004. p. 597–608.

    Google Scholar 

  13. Arvanitis A, Koutrika G. PrefDB: supporting preferences as first-class citizens in relational databases. IEEE Trans Knowl Data Eng. 2014;26(6):1430–46.

    Article  Google Scholar 

  14. Jiang B, Pei J, Lin X, Cheung DW, Han J. Mining preferences from superior and inferior examples. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2008. p. 390–98.

    Google Scholar 

  15. Mindolin D, Chomicki J. Preference elicitation in prioritized skyline queries. VLDB J. 2011;20(2):157–82. Special issue: selected papers from VLDB 2009.

    Article  MATH  Google Scholar 

  16. Levandoski JJ, Eldawy A, Mokbel MF, Khalefa ME. Flexible and extensible preference evaluation in database systems. ACM Trans Database Syst. 2013;38(3):17.

    Article  MathSciNet  Google Scholar 

  17. Wan Q, Wong RCW, Ilyas IF, Özsu MT, Peng Y. Creating competitive products. Proc VLDB Endow. 2009;2(1):898–909.

    Article  Google Scholar 

  18. Nanongkai D, Sarma AD, Lall A, Lipton RJ, Xu J. Regret-minimizing representative databases. Proc VLDB Endow. 2010;3(1):1114–24.

    Article  Google Scholar 

  19. Nanongkai D, Lall A, Sarma AD, Makino K. Interactive regret minimization. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2012. p. 109–20.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jan Chomicki .

Editor information

Editors and Affiliations

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

Chomicki, J. (2018). Preference Queries. 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_80687

Download citation

Publish with us

Policies and ethics