Efficient Rewriting Algorithms for Preference Queries

Authors:
Periklis Georgiadis;Ioannis Kapantaidakis;Vassilis Christophides;Elhadji Mamadou Nguer;Nicolas Spyratos
Affiliations:
Department of Computer Science, University of Crete, Greece. perge@csd.uoc.gr;Department of Computer Science, University of Crete, Greece. jkapad@csd.uoc.gr;Department of Computer Science, University of Crete, Greece/ Institute of Computer Science, Foundation for Research and Technology-Hellas, Greece. christop@ics.forth.gr;Laboratoire de Recherche en Informatique, Université/ Paris Sud, France. nguer@lri.fr;Laboratoire de Recherche en Informatique, Université/ Paris Sud, France. spyratos@lri.fr
Venue:
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Year:
2008

Citing 0
Cited 11

A user-friendly interface for evaluating preference queries over tabular data

Proceedings of the 26th annual ACM international conference on Design of communication
A methodology for preference-based personalization of contextual data

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Preference-aware publish/subscribe delivery with diversity

Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
PerK: personalized keyword search in relational databases through preferences

Proceedings of the 13th International Conference on Extending Database Technology
Communicating through preferences

Proceedings of the 3rd International Conference on PErvasive Technologies Related to Assistive Environments
Preferences in AI: An overview

Artificial Intelligence
A survey on representation, composition and application of preferences in database systems

ACM Transactions on Database Systems (TODS)
Personalizing queries over large data tables

ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Transitivity-preserving skylines for partially ordered domains

DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Optimized data management for e-learning in the clouds towards Cloodle

Proceedings of the Fourth Symposium on Information and Communication Technology
Interactive Exploration of Multi-Dimensional and Hierarchical Information Spaces with Real-Time Preference Elicitation

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Preference queries are crucial for various applications (e.g. digital libraries) as they allow users to discover and order data of interest in a personalized way. In this paper, we define preferences as preorders over relational attributes and their respective domains. Then, we rely on appropriate linearizations to provide a natural semantics for the block sequence answering a preference query. Moreover, we introduce two novel rewriting algorithms (called LBA and TBA) which exploit the semantics of preference expressions for constructing progressively each block of the answer. We demonstrate experimentally the scalability and performance gains of our algorithms (up to 3 orders of magnitude) for variable database and result sizes, as well as for preference expressions of variable size and structure. To the best of our knowledge, LBA and TBA are the first algorithms for evaluating efficiently arbitrary preference queries over voluminous databases.