An Approach to Database Preference Queries Based on an Outranking Relation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Computational Intelligence Systems Year : 2012

An Approach to Database Preference Queries Based on an Outranking Relation

Abstract

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.

Dates and versions

hal-00736336 , version 1 (28-09-2012)

Identifiers

Cite

Patrick Bosc, Olivier Pivert, Grégory Smits. An Approach to Database Preference Queries Based on an Outranking Relation. International Journal of Computational Intelligence Systems, 2012, 5 (4), pp.789-804. ⟨10.1080/18756891.2012.718161⟩. ⟨hal-00736336⟩
93 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More