Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
PREFER: a system for the efficient execution of multi-parametric ranked queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Proceedings of the 17th International Conference on Data Engineering
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
Stratified computation of skylines with partially-ordered domains
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Précis: The Essence of a Query Answer
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Semantic optimization techniques for preference queries
Information Systems
Foundations of preferences in database systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Preference SQL: design, implementation, experiences
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Temporal Conditional Preferences over Sequences of Objects
ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 02
Fast contextual preference scoring of database tuples
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Extending CP-nets with stronger conditional preference statements
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Journal of Artificial Intelligence Research
On graphical modeling of preference and importance
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Nowadays, the need for incorporating preference querying in database technology is a very important issue in a variety of applications ranging from e-commerce to personalized search engines. A lot of recent research work has been dedicated to this topic in the artificial intelligence and database communities. Several formalisms allowing preference reasoning and specification have been proposed in the AI field. On the other hand, in the database field the interest has been focused mainly in extending standard SQL with preference facilities in order to provide personalized query answering. In this paper, we propose to build a bridge between these two approaches, by using a logic formalism originally designed to specify and reason with preference in order to extend SQL with conditional preference constructors. Such constructors allow to express a large class of preference statements with a ceteris-paribus semantics.