Abstract

This chapter presents a rich preference model tailored for database systems. Preferences as strict partial orders have an intuitive semantics; they may be subjective from daily life experiences, driven by personal intentions, or due to technical constraints. The extensible preference model both unifies and extends existing approaches for non-numerical and numerical ranking and opens the door for a new discipline called preference engineering. Preferences as strict partial orders possess a Spartan formal basis being the key for a preference algebra, where many laws are valid that are valuable for preference query optimizers. Personalization of e-services poses new challenges to database technology, demanding a powerful and flexible modeling technique for complex preferences. Preference queries have to be answered cooperatively by treating preferences as soft constraints, attempting a best possible matchmaking.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.