Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Preference Queries

  • Jan ChomickiEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_80687


Ranking queries


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 to check access.

Recommended Reading

  1. 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. 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. 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. 4.
    Chomicki J. Preference formulas in relational queries. ACM Trans Database Syst. 2003;28(4):427–66.MathSciNetCrossRefGoogle Scholar
  5. 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.CrossRefGoogle Scholar
  6. 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. 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. 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. 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. 10.
    Chomicki J. Semantic optimization techniques for preference queries. Inf Syst. 2007;32(5):660–74.CrossRefGoogle Scholar
  11. 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.CrossRefGoogle Scholar
  12. 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. 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.CrossRefGoogle Scholar
  14. 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. 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.zbMATHCrossRefGoogle Scholar
  16. 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.MathSciNetCrossRefGoogle Scholar
  17. 17.
    Wan Q, Wong RCW, Ilyas IF, Özsu MT, Peng Y. Creating competitive products. Proc VLDB Endow. 2009;2(1):898–909.CrossRefGoogle Scholar
  18. 18.
    Nanongkai D, Sarma AD, Lall A, Lipton RJ, Xu J. Regret-minimizing representative databases. Proc VLDB Endow. 2010;3(1):1114–24.CrossRefGoogle Scholar
  19. 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

Copyright information

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

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringState University of New York at BuffaloBuffaloUSA