Skip to main content
SpringerLink
Log in

Preference elicitation in prioritized skyline queries

  • Special Issue Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

Preference queries incorporate the notion of binary preference relation into relational database querying. Instead of returning all the answers, such queries return only the best answers, according to a given preference relation. Preference queries are a fast growing area of database research. Skyline queries constitute one of the most thoroughly studied classes of preference queries. A well-known limitation of skyline queries is that skyline preference relations assign the same importance to all attributes. In this work, we study p-skyline queries that generalize skyline queries by allowing varying attribute importance in preference relations. We perform an in-depth study of the properties of p-skyline preference relations. In particular, we study the problems of containment and minimal extension. We apply the obtained results to the central problem of the paper: eliciting relative importance of attributes. Relative importance is implicit in the constructed p-skyline preference relation. The elicitation is based on user-selected sets of superior (positive) and inferior (negative) examples. We show that the computational complexity of elicitation depends on whether inferior examples are involved. If they are not, elicitation can be achieved in polynomial time. Otherwise, it is NP complete. Our experiments show that the proposed elicitation algorithm has high accuracy and good scalability.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. NHL.com Player Stats. http://www.nhl.com/ice/playerstats.htm (2008).

  2. Bacchus, F., Grove, A.: Utility independence in a qualitative decision theory. In: Proceedings of 5th International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 542–552. Morgan Kaufmann (1996)

  3. Balke, W.T., Güntzer, U., Siberski, W.: Exploiting indifference for customization of partial order skylines. In: Proceedings of the 10th International Database Engineering and Applications Symposium (IDEAS), pp. 80–88. Delhi (2006)

  4. Balke W.T., Guntzer U., Lofi C.: Incremental trade-off management for preference-based queries. Int. J. Comput. Sci. Appl. 4(2), 75–91 (2007)

    Google Scholar 

  5. Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering, pp. 421–430. IEEE Computer Society, Washington, DC, USA (2001)

  6. Boutilier, C.: A POMDP formulation of preference elicitation problems. In: Proceedings of the 18th National Conference on Artificial Intelligence, pp. 239–246. AAAI Press, Menlo Park (2002)

  7. Boutilier C., Brafman R., Domshlak C., Hoos H., Poole D.: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. 21, 135–191 (2004)

    MATH  MathSciNet  Google Scholar 

  8. Brafman, R.I., Domshlak, C.: Introducing variable importance tradeoffs into CP-nets. In: Proceedings of the 18th Conference in Uncertainty in Artificial Intelligence, pp. 69–76. Morgan Kaufmann, Edmonton (2002)

  9. Chajewska, U., Koller, D., Parr, R.: Making rational decisions using adaptive utility elicitation. In: Proceedings of the 17th National Conference on Artificial Intelligence, pp. 363–369. AAAI Press, Austin (2000)

  10. Chan, C.Y., Eng, P.K., Tan, K.L.: Stratified computation of skylines with partially-ordered domains. In: Proceedings of the ACM SIGMOD Conference, pp. 203–214. ACM, Baltimore (2005)

  11. Chan, C.Y., Jagadish, H.V., Tan, K.L., Tung, A.K.H., Zhang, Z.: Finding k-dominant skylines in high dimensional space. In: Proceedings of the ACM SIGMOD Conference, pp. 503–514. ACM, Chicago (2006)

  12. Ciaccia, P.: Personal Communication (2011)

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

    Article  Google Scholar 

  14. Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: Proceedings of the 19th International Conference on Data Engineering (ICDE), pp. 717–816. IEEE Computer Society, Bangalore (2003)

  15. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms, Second Edition. MIT Press, Cambridge (2001)

    Google Scholar 

  16. Das, G., Gunopulos, D., Koudas, N., Tsirogiannis, D.: Answering top-k queries using views. In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB Endowment, pp. 451–462 (2006)

  17. Domshlak C., Joachims T.: Efficient and non-parametric reasoning over user preferences. User Modeling and User-Adapted Interaction 17(1–2), 41–69 (2007)

    Article  Google Scholar 

  18. Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 102–113 ACM, New York (2001)

  19. Fishburn P.: Utility Theory for Decision-Making. Wiley, New York (1970)

    MATH  Google Scholar 

  20. Godfrey, P.: Skyline cardinality for relational processing. In: Foundations of Information and Knowledge Systems (FoIKS). Lecture Notes in Computer Science, vol. 2942, pp. 78–97. Springer, Wilhelminenburg Castle, Austria

  21. Godfrey, P., Shipley, R., Gryz, J.: Maximal vector computation in large data sets. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 229–240. ACM, Trondheim (2005)

  22. Godfrey P., Shipley R., Gryz J.: Algorithms and analyses for maximal vector computation. VLDB J. 16(1), 5–28 (2007)

    Google Scholar 

  23. Haddawy P., Restificar A., Geisler B., Miyamoto J.: Preference elicitation via theory refinement. J. Mach. Learn. Res. 4, 2003 (2003)

    MathSciNet  Google Scholar 

  24. Hansson S.O.: Changes in preference. Theor. Decis. 38(1), 1–28 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  25. Holland, S., Ester, M., Kießling, W.: Preference mining: a novel approach on mining user preferences for personalized applications. In: Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, pp. 204–216. Springer, Cavtat-Dubrovnik (2003)

  26. Jiang, B., Pei, J., Lin, X., Cheung, D.W., Han, J.: Mining preferences from superior and inferior examples. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 390–398 (2008)

  27. Kießling, W.: Foundations of preferences in database systems. In: Proceedings of 28th International Conference on Very Large Data Bases, pp. 311–322. Morgan Kaufmann, Hong Kong (2002)

  28. Kießling, W.: Preference queries with SV-semantics. In: Proceedings of 11th International Conference on Management of Data (COMAD 2005), pp. 15–26 (2005)

  29. Kießling, W., Köstler, G.: Preference SQL—design, implementation, experiences. In: Proceedings of 28th International Conference on Very Large Data Bases (VLDB), pp. 990–1001. Morgan Kaufmann, Hong Kong (2002)

  30. 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 (VLDB), pp. 275–286. Morgan Kaufmann, Hong Kong, China (2002)

  31. Lee, J., won You, G., won Hwang, S., Selke, J., Balke, W.T.: Optimal preference elicitation for skyline queries over categorical domains. In: Proceedings of the 19th International Conference on Database and Expert Systems Applications, pp. 610–624. Springer, Turin (2008)

  32. Lee J., won You G., won Hwang S.: Personalized top-k skyline queries in high-dimensional space. Inf. Syst. 34(1), 45–61 (2009)

    Article  Google Scholar 

  33. Lee, K.C.K., Zheng, B., Li, H., Lee, W.C.: Approaching the Skyline in Z order. In: Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB), pp 279–290. ACM, Vienna (2007)

  34. Lin, X., Yuan, Y., Wang, W., Lu, H.: Stabbing the sky: efficient skyline computation over sliding windows. In: Proceedings of the 21st International Conference on Data Engineering (ICDE), pp. 502–513. IEEE Computer Society, Tokyo (2005)

  35. 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 (ICDE), pp. 86–95. IEEE, Istanbul (2007)

  36. McGeachie, M., Doyle, J.: Efficient utility functions for ceteris paribus preferences. In: Proceedings of the 18th National Conference on Artificial Intelligence, pp. 279–284. AAAI Press, Menlo Park (2002)

  37. Morse, M.D,. Patel, J.M., Jagadish, H.V.: Efficient skyline computation over low-cardinality domains. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 267–278. ACM, Vienna (2007)

  38. Pu, P., Torrens, M.: User-involved preference elicitation. In: International Joint Conference on Artificial Intelligence (IJCAI), Workshop on Configuration. Acapulco, Mexico (2003)

  39. Papadimitriou C.M.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  40. Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the best views of skyline: a semantic approach based on decisive subspaces. In: Proceedings of the 31st International Conference on Very Large Data Bases (VLDB), pp. 253–264. ACM, Trondheim (2005)

  41. Tan, K.L., Eng, P.K., Ooi, B.C.: Efficient progressive skyline computation. In: Proceedings of 27th International Conference on Very Large Data Bases (VLDB), pp. 301–310. Morgan Kaufmann, Roma (2001)

  42. Tao, Y., Ding, L., Lin, X., Pei, J.: Distance-based representative skyline. In: Proceedings of the 25th International Conference on Data Engineering (ICDE), pp. 892–903. Shanghai, China (2009)

  43. Valdes J., Tarjan R.E., Lawler E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11, 298–313 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  44. Viappiani P., Faltings B., Pu P.: Preference-based search using example-critiquing with suggestions. J. Artif. Intell. Res. 27, 465–503 (2006)

    MATH  Google Scholar 

  45. Vu Ha, P.H.: A hybrid approach to reasoning with partial preference models. In: Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence, pp. 263–270. AUAI Press, Helsinki (1999)

  46. Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J.X., Zhang, Q.: Efficient computation of the skyline cube. In: Proceedings of the 31st Conference of Very Large Data Bases (VLDB), pp. 241–252. ACM, Trondheim (2005)

  47. Zhang Z., Lu H., Ooi B.C., Tung A.K.: Understanding the meaning of a shifted sky: a general framework on extending skyline query. VLDB J. 19(2), 181–201 (2010)

    Article  Google Scholar 

  48. Zhao, F., Das, G., Tan, K.L., Tung, A.K.H.: Call to order: a hierarchical browsing approach to eliciting users’ preference. In: Proceedings of the ACM SIGMOD Conference, pp. 27–38. ACM, Indianapolis (2010)

Download references

Author information

Authors and Affiliations

  1. 201 Bell Hall, University at Buffalo, Buffalo, NY, 14260-2000, USA

    Denis Mindolin & Jan Chomicki

Authors
  1. Denis Mindolin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Chomicki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jan Chomicki.

Electronic Supplementary Material

The Below is the Electronic Supplementary Material.

ESM 1 (PDF 363kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mindolin, D., Chomicki, J. Preference elicitation in prioritized skyline queries. The VLDB Journal 20, 157–182 (2011). https://doi.org/10.1007/s00778-011-0227-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-011-0227-9

Keywords

Search

Navigation