An Approach to Database Preference Queries Based on an Outranking Relation

In this paper, we describe an approach to database preference queries based on the notion of outranking, suited to the situation where preferences on different attributes are not commensurable. This model constitutes an alternative to the use of Pareto order whose main drawback is to leave many tupl...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of computational intelligence systems Vol. 5; no. 4; pp. 789 - 804
Main Authors Bosc, Patrick, Pivert, Olivier, Smits, Grégory
Format Journal Article
LanguageEnglish
Published Dordrecht Springer Netherlands 01.08.2012
Atlantis Press
Springer
Subjects
Computer Science
outranking
preference queries
Research Article
preference queries
Databases
outranking
Online AccessGet full text

Cover

More Information
Summary:In this paper, we describe an approach to database preference queries based on the notion of outranking, suited to the situation where preferences on different attributes are not commensurable. This model constitutes an alternative to the use of Pareto order whose main drawback is to leave many tuples incomparable in general. Even though outranking does not define an order in the mathematical sense of the term, we describe a technique which yields a complete pre-order, based on a global aggregation of the outranking degrees computed for each pair of tuples, which reflects the global “quality” of a tuple w.r.t. the others.
ISSN:1875-6891
1875-6883
1875-6883
DOI:10.1080/18756891.2012.718161