
TL;DR
This paper introduces a flexible logical framework for expressing user preferences in information systems, enabling complex preference queries and optimization within relational databases using a winnow operator.
Contribution
It presents a novel, unrestricted preference formula framework and embeds it into SQL, facilitating complex preference queries and algebraic optimization.
Findings
Framework supports arbitrary preference relations.
Preference formulas embedded into SQL via winnow operator.
Algebraic laws enable optimization of preference queries.
Abstract
The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others, preferences are used for information filtering and extraction to reduce the volume of data presented to the user. They are also used to keep track of user profiles and formulate policies to improve and automate decision making. We propose here a simple, logical framework for formulating preferences as preference formulas. The framework does not impose any restrictions on the preference relations and allows arbitrary operation and predicate signatures in preference formulas. It also makes the composition of preference relations straightforward. We propose a simple, natural embedding of preference formulas into relational algebra (and SQL) through a single winnow operator parameterized by a preference formula. The embedding makes possible the formulation of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Advanced Database Systems and Queries
