Sort sets in the relational model
Journal of the ACM (JACM)
The design of relational databases
The design of relational databases
Relational database theory
Ordered functional dependencies in relational databases
Information Systems
An extension of the relational data model to incorporate ordered domains
ACM Transactions on Database Systems (TODS)
A Guided Tour of Relational Databases and Beyond
A Guided Tour of Relational Databases and Beyond
Structure and content scoring for XML
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Foundations of preferences in database systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Preference SQL: design, implementation, experiences
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Vague sets or intuitionistic fuzzy sets for handling vague data: which one is better?
ER'05 Proceedings of the 24th international conference on Conceptual Modeling
Prioritized preferences and choice constraints
ER'07 Proceedings of the 26th international conference on Conceptual modeling
Hi-index | 0.00 |
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.