Skip to main content
Log in

Database querying under changing preferences

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is query modification: a query transformation approach which works by revising the preference relation in the query. We provide a detailed analysis of the cases where the order-theoretic properties of the preference relation are preserved in the revision. We consider a number of different revision operators: union, prioritized and Pareto composition. We also formulate algebraic laws that enable incremental evaluation of preference queries. Finally, we consider two variations of the basic framework: finite restrictions of preference relations and weak-order extensions of strict partial order preference relations.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)

  2. Agrawal, R., Wimmers, E.L.: A framework for expressing and combining preferences. In: ACM SIGMOD International Conference on Management of Data, pp. 297–306 (2000)

  3. Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.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 

  4. Balke, W.-T., Güntzer, U.: Multi-objective query processing for database systems. In: International Conference on Very Large Data Bases (VLDB), pp. 936–947 (2004)

  5. Balke, W.-T., Güntzer, U., Zhang, J.X.: Efficient distributed skylining for web information systems. In: International Conference on Extending Database Technology (EDBT), pp. 256–273 (2004)

  6. Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: IEEE International Conference on Data Engineering (ICDE), pp. 421–430 (2001)

  7. Chomicki, J.: Querying with intrinsic preferences. In: International Conference on Extending Database Technology (EDBT). LNCS, vol. 2287, pp. 34–51. Springer (2002)

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

    Article  Google Scholar 

  9. Chomicki, J.: Semantic optimization of preference queries. In: International Symposium on Constraint Databases. LNCS, vol. 3074, pp. 133–148. Paris, France, June. Springer (2004)

  10. Chomicki, J.: Iterative modification and incremental evaluation of preference queries. In: International Symposium on Foundations of Information and Knowledge Systems (FOIKS). LNCS, vol. 3861, pp. 63–82. Springer (2006)

  11. Chomicki, J.: Semantic optimization techniques for preference queries. Information Systems 32(5), 670–684 (2007)

    Article  Google Scholar 

  12. Fishburn, P.C.: Utility Theory for Decision Making. Wiley & Sons (1970)

  13. Fishburn, P.C.: Interval Orders and Interval Graphs. Wiley (1985)

  14. Freund, M.: On the revision of preferences and rational inference processes. Artif. Intell. 152, 105–137 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  15. Govindarajan, K., Jayaraman, B., Mantha, S.: Preference queries in deductive databases. New Gener. Comput. 19(1), 57–86 (2000)

    Article  Google Scholar 

  16. Grahne, G., Mendelzon, A.O., Revesz, P.Z.: Knowledgebase transformations. J. Comput. Syst. Sci. 54(1), 98–112 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  17. Gärdenfors, P., Rott, H.: Belief revision. In: Gabbay, D.M., Hogger, J.C., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 4, pp. 35–132. Oxford University Press (1995)

  18. Gurevich, Y., Shelah, S.: Fixed-point extensions of first-order logic. Ann. Pure Appl. Logic 32, 265–280 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  19. Guo, S., Sun, W., Weiss, M.A.: Solving satisfiability and implication problems in database systems. ACM Trans. Database Syst. 21(2), 270–293 (1996)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. Hristidis, V., Papakonstantinou, Y.: Algorithms and applications for answering ranked queries using ranked views. VLDB J. 13(1), 49–70 (2004)

    Article  Google Scholar 

  22. Imieliński, T., Naqvi, S.: Explicit control of logic programs through rule algebra. In: ACM Symposium on Principles of Database Systems (PODS), Austin, Texas (1988)

  23. Ilyas, I.F., Shah, R., Elmagarmid, A.K., Aref, W.G., Vitter, J.S.: Rank-aware query optimization. In: ACM SIGMOD International Conference on Management of Data, pp. 203–214 (2004)

  24. Kießling, W., Hafenrichter, B.: Algebraic optimization of relational preference queries, Technical Report 2003-1, Institut für Informatik, Universität Augsburg (2003)

  25. Kießling, W.: Foundations of preferences in database systems. In: International Conference on Very Large Data Bases (VLDB), pp. 311–322 (2002)

  26. Kießling, W., Köstler, G.: Preference SQL - design, implementation, experience. In: International Conference on Very Large Data Bases (VLDB), pp. 990–1001 (2002)

  27. Kanellakis, P.C., Kuper, G.M., Revesz, P.Z: Constraint query languages. J. Comput. Syst. Sci. 51(1), 26–52 (August 1995)

    Article  MathSciNet  Google Scholar 

  28. Kuper, G., Libkin, L., Paredaens, J. (eds.): Constraint Databases. Springer (2000)

  29. Lacroix, M., Lavency, P.: Preferences: putting more knowledge into queries. In: International Conference on Very Large Data Bases (VLDB), pp. 217–225 (1987)

  30. McGeachie, M., Doyle, J.: Utility functions for ceteris paribus preferences. Comput. Intell. 20(2), 158–217 (2004)

    Article  MathSciNet  Google Scholar 

  31. Pu, P., Faltings, B., Torrens, M.: User-involved preference elicitation. In: IJCAI Workshop on Configuration (2003)

  32. Przymusinski, T.C.: On the declarative semantics of deductive databases and logic programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 193–216. Morgan Kaufmann Publishers (1988)

  33. Papadias, D., Tao, Y., Fu, G., Seeger, B.:. An optimal and progressive algorithm for skyline queries. In: ACM SIGMOD International Conference on Management of Data, pp. 467–478 (2003)

  34. Revesz, P.Z.: Model-theoretic minimal change operators for constraint databases. In: International Conference on Database Theory (ICDT). LNCS, vol. 1186, pp. 447–460. Springer (1997)

  35. Torlone, R., Ciaccia, P.: Which are my preferred items? In: Workshop on Recommendation and Personalization in E-Commerce, May 2002

  36. Wellman, M.P., Doyle, J.: Preferential semantics for goals. In: National Conference on Artificial Intelligence, pp. 698–703 (1991)

  37. Williams, M.-A.: Belief revision via database update. In: International Intelligent Information Systems Conference (1997)

  38. Wong, S.T.C.: Preference-based decision making for cooperative knowledge-based systems. ACM Trans. Database Syst. 12(4), 407–435 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jan Chomicki.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chomicki, J. Database querying under changing preferences. Ann Math Artif Intell 50, 79–109 (2007). https://doi.org/10.1007/s10472-007-9072-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-007-9072-3

Keywords

Mathematics Subject Classification (2000)

Navigation