Abstract
The notion of user preference in database modeling has recently received much attention in advanced applications, such as personalization of e-services, since it captures the human wishes on querying and managing data. The paradigm of preference-driven choices in the real world requires new semantic constraints in modelling. In this paper, we assume preference constraints can be defined over data domains and thus the assumption gives rise to preference relations as a special case of ordered relations over schemas consisting of the preference, preferencedependent and preference-independent attributes. We demonstrate that Lexicographically Ordered Functional Dependencies (LOFDs) can be employed to maintain the consistency of preference semantics embedded in preference database, since prioritized multiple preferences can be represented. We thus define a useful semantic constraint in terms of a set of LOFDs, called Preference Functional Dependencies (PFDs), in order to capture the semantics of the preference ranked data. We exhibit a sound and complete axiom system for PFDs, whose implication problem is shown to be decidable in polynomial-time. We also confirm the existence of Armstrong preference relations for PFDs, a fundamental result related to the practical use of PFDs in database design.
This work is partially supported by RGC CERG under grant number HKUST6185/03E.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Amer-Yahia, S., et al.: Structure and Content Scoring for XML. In: Proc. of VLDB (2005)
Atzeni, P., De Antonellis, V.: Relational Database Theory. Benjamin/Cummings Publishing Company, Inc. (1993)
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: Proc. of VLDB (2002)
Kießling, W., Köstler, G.: Foundations of Preference in Database Systems. In: Proc. of VLDB (2002)
Levene, M., Loizou, G.: A Guided Tour of Relational Databases and Beyond. Springer, London (1999)
Lu, A., Ng, W.: Vague sets or intuitionistic fuzzy sets for handling vague data: Which one is better? In: Delcambre, L.M.L., Kop, C., Mayr, H.C., Mylopoulos, J., Pastor, Ó. (eds.) ER 2005. LNCS, vol. 3716, pp. 401–416. Springer, Heidelberg (2005)
Mannila, H., Raiha, K.-J.: The Design of Relational Databases. Addison-Wesley, Reading (1992)
Ng, W.: Ordered Functional Dependencies in Relational Databases. Information Systems 24(7), 535–554 (1999)
Ng, W., Levene, M.: The Development of Ordered SQL Packages to Support Data Warehousing. Journal of Database Management 12(4), 27–49 (2001)
Ng, W.: An Extension of the Relational Data Model to Incorporate Ordered Domains. ACM Transactions on Database Systems 26(3) (2001)
Tan, Q., et al.: Applying Co-training to Clickthrough Data for Search Engine Adaptation. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 519–532. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ng, W. (2006). Preference Functional Dependencies for Managing Choices. In: Embley, D.W., Olivé, A., Ram, S. (eds) Conceptual Modeling - ER 2006. ER 2006. Lecture Notes in Computer Science, vol 4215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11901181_12
Download citation
DOI: https://doi.org/10.1007/11901181_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47224-7
Online ISBN: 978-3-540-47227-8
eBook Packages: Computer ScienceComputer Science (R0)