Profiling Sets for Preference Querying

We propose a logical framework for set preferences. Candidate sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences over set profiles. We also give a heuristic algorithm for the computation of the "best" sets.

• Type: Conference
• Year: 2008
• Where: SEBD
• Authors: Xi Zhang, Jan Chomicki
• Keywords: Candidate Sets, Database, Logical Framework, SEBD 2008, Set Preferences