Abstract
It is increasingly recognised that user preferences should be addressed in many advanced database applications, such as adaptive searching in databases. However, the fundamental issue of how preferences impact the semantics and rankings in a relation is not resolved. In this paper, we model a user preference term involving one attribute as a hierarchy of its underlying data values and formalise the notion of Prioritized Preferences (PPs). We then consider multiple user preferences in ranking tuples in a relational table. We examine the impact of a given set of PPs on possible choices in ranking a database relation and develop a new notion of Choice Constraints (CCs) in a relation, r. Given two PPs, X and Y, a CC, X ≤ Y, is satisfied in r, if the choice of rankings according to Y is no less than that of X. Our main results are related to these two notions of PPs and CCs and their interesting interactions with the well-known Functional Dependencies (FDs). First, we exhibit a sound and complete set of three inference rules for PPs and further prove that for each closed set of PPs, there exists a ranking that precisely satisfies these preferences. Second, we establish a sound and complete set of five inference rules for CCs. Finally, we show the soundness and completeness of two mixed systems of FD-PPs and FD-CCs. All these results are novel and fundamental to incorporating user preferences in database design and modelling, since PPs, CCs and FDs together capture rich semantics of preferences in databases.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Atzeni, P., De Antonellis, V.: Relational Database Theory. Benjamin Cummings Publishing Company, Inc (1993)
Chomicki, J.: Preference formulas in relational queries. ACM Transaction Database System 28(4), 427–466 (2003)
Chomicki, J.: Semantic Optimization Techniques for Preference Queries. Information Systems 32, 670–684 (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)
Ginsburg, S., Hull, R.: Order Dependency in the Relational Model. Theoretical Computer Science 26(1-2), 149–195 (1983)
Ginsburg, S., Hull, R.: Sort Sets in the Relational Model. Journal of the Association for Computing Machinery 33(3), 465–488 (1986)
Kießling, W., Köstler, G.: Preference SQL - Design, Implementation, Experiences. In: Bressan, S., Chaudhri, A.B., Lee, M.L., Yu, J.X., Lacroix, Z. (eds.) CAiSE 2002 and VLDB 2002. LNCS, vol. 2590, Springer, Heidelberg (2003)
Kießling, W., Köstler, G.: Foundations of Preference in Database Systems. In: Bressan, S., Chaudhri, A.B., Lee, M.L., Yu, J.X., Lacroix, Z. (eds.) CAiSE 2002 and VLDB 2002. LNCS, vol. 2590, Springer, Heidelberg (2003)
Mannila, H., Raiha, K.-J.: The Design of Relational Databases. Addison-Wesley, London, UK (1992)
Lu, A., Ng, W.: Mining hesitation information by vague association rules. In: Parent, C., Schewe, K.-D., Storey, V.C., Thalheim, B. (eds.) ER 2007. LNCS, vol. 4801, pp. 39–55. Springer, Heidelberg (2007)
Lu, A., Ng, W.: Handling Inconsistency of Vague Relations with Functional Dependencies. In: Parent, C., Schewe, K.-D., Storey, V.C., Thalheim, B. (eds.) ER 2007. LNCS, vol. 4801, pp. 229–244. Springer, Heidelberg (2007)
Ng, W.: Ordered Functional Dependencies in Relational Databases. Information Systems 24(7), 535–554 (1999)
Ng, W.: An Extension of the Relational Data Model to Incorporate Ordered Domains. ACM Transactions on Database Systems 26(3) (2001)
Ng, W.: Preference Functional Dependencies for Managing Choices. In: Embley, D.W., Olivé, A., Ram, S. (eds.) ER 2006. LNCS, vol. 4215, pp. 140–154. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ng, W. (2007). Prioritized Preferences and Choice Constraints. In: Parent, C., Schewe, KD., Storey, V.C., Thalheim, B. (eds) Conceptual Modeling - ER 2007. ER 2007. Lecture Notes in Computer Science, vol 4801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75563-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-75563-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75562-3
Online ISBN: 978-3-540-75563-0
eBook Packages: Computer ScienceComputer Science (R0)