Title
On three classes of division queries involving ordinal preferences
Abstract
In this paper, we are interested in taking preferences into account for a family of queries inspired by the relational division. A division query aims at retrieving the elements associated with a specified set of values and usually the results remain not discriminated. So, we suggest the introduction of preferences inside such queries with the following specificities: (i) the user gives his/her preferences in an ordinal way and (ii) the preferences apply to the divisor which is defined as a hierarchy of sets. Different uses of the hierarchy are investigated, which leads to queries conveying different semantics and the property of the result in terms of a quotient is studied. Special attention is paid to the implementation of such extended division queries using a regular database management system along which some experiments to support the feasibility of the approach. Moreover, the issue of empty or overabundant answers is dealt with.
Year
DOI
Venue
2011
10.1007/s10844-010-0147-y
International Syposium on Methodologies for Intelligent Systems
Keywords
Field
DocType
different semantics,special attention,regular database management system,following specificities,overabundant answer,relational database · division · preference · ordinal scale · empty answers · overabundant answers,relational division,extended division,division query,ordinal preference,different use,relational database,division
Data mining,Ordinal Scale,Relational database,Ordinal number,Computer science,Quotient,Hierarchy,Divisor,Semantics
Journal
Volume
Issue
ISSN
37
3
0925-9902
Citations 
PageRank 
References 
1
0.35
9
Authors
3
Name
Order
Citations
PageRank
Patrick Bosc160175.23
Olivier Pivert2891101.81
Olivier Soufflet341.12