[Paper Review] Preference Queries

Jan Chomicki|arXiv (Cornell University)|Jul 27, 2002

Data Management and Algorithms4 citations

TL;DR

This paper proposes a logical framework for expressing user preferences as preference formulas, integrating them into relational algebra via a winnow operator in SQL. It enables complex preference queries with aggregation, ranking, and algebraic optimization through formal laws governing the winnow operator.

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 complex preference queries, e.g., involving aggregation, by piggybacking on existing SQL constructs. It also leads in a natural way to the definition of further, preference-related concepts like ranking. Finally, we present general algebraic laws governing the winnow operator and its interaction with other relational algebra operators. The preconditions on the applicability of the laws are captured by logical formulas. The laws provide a formal foundation for the algebraic optimization of preference queries. We demonstrate the usefulness of our approach through numerous examples.

Motivation & Objective

• To address the growing need for handling user preferences in information systems, especially for filtering, profile management, and decision automation.
• To overcome limitations in existing preference models by allowing arbitrary operations, predicates, and flexible preference relations.
• To provide a seamless integration of preference logic into relational algebra and SQL for practical deployment.
• To enable the formulation of complex preference queries involving aggregation and ranking through a unified operator.
• To establish a formal foundation for optimizing preference queries using algebraic laws with logical preconditions.

Proposed method

• Formulating preferences as logical preference formulas without restrictions on relations, operations, or predicates.
• Introducing a single winnow operator parameterized by a preference formula to embed preferences into relational algebra and SQL.
• Using the winnow operator to support complex queries, including aggregation, by leveraging existing SQL constructs.
• Defining ranking as a natural extension of the winnow operator’s output behavior.
• Deriving general algebraic laws for the winnow operator that govern its interaction with other relational algebra operators.
• Encoding preconditions for these laws using logical formulas to ensure correctness and enable optimization.

Experimental results

Research questions

• RQ1 How can user preferences be formally and flexibly represented within a logical framework that supports arbitrary operations and predicates?
• RQ2 How can preference formulas be efficiently embedded into relational algebra and SQL to support complex query processing?
• RQ3 How can ranking and aggregation be naturally supported within a preference-aware query model?
• RQ4 What algebraic laws govern the winnow operator and its interaction with standard relational operators?
• RQ5 How can these laws be used to formally optimize preference queries while preserving correctness?

Key findings

• The proposed winnow operator enables the expression of complex preference queries in SQL by extending standard relational algebra with preference-aware selection.
• The framework supports arbitrary preference relations and signatures, making it flexible for diverse application domains.
• Ranking can be naturally derived from the winnow operator’s output, providing a principled way to order results by preference.
• The algebraic laws for the winnow operator are formally specified with logical preconditions, enabling safe and correct query optimization.
• The integration with existing SQL constructs allows for efficient and practical deployment of preference queries in real-world systems.