NDLI: On three classes of division queries involving ordinal preferences

Content Provider	Springer Nature Link
Author	Bosc, Patrick Pivert, Olivier Soufflet, Olivier
Copyright Year	2010
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.
Starting Page	315
Ending Page	331
Page Count	17
File Format	PDF
ISSN	09259902
Journal	Journal of Intelligent Information Systems
Volume Number	37
Issue Number	3
e-ISSN	15737675
Language	English
Publisher	Springer US
Publisher Date	2010-12-17
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Relational database Division Preference Ordinal scale Empty answers Overabundant answers Business Information Systems Document Preparation and Text Processing Artificial Intelligence (incl. Robotics) Data Structures, Cryptology and Information Theory Information Storage and Retrieval
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Computer Networks and Communications Information Systems Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

About quotient and division of crisp and fuzzy relations

Processing skyline queries in incomplete distributed databases

Producing Interoperable Queries for Relational and Object-Oriented Databases

A method for reduction of examples in relational learning

Granular computing for relational data classification

Mining Bayesian networks out of ontologies

Incremental controlled relaxation of failing flexible queries

Probabilistic skylines on uncertain data: model and bounding-pruning-refining methods

Processing top-N relational queries by learning

On three classes of division queries involving ordinal preferences

Similar Documents

About quotient and division of crisp and fuzzy relations

Processing skyline queries in incomplete distributed databases

Producing Interoperable Queries for Relational and Object-Oriented Databases

A method for reduction of examples in relational learning

Granular computing for relational data classification

Mining Bayesian networks out of ontologies

Incremental controlled relaxation of failing flexible queries

Probabilistic skylines on uncertain data: model and bounding-pruning-refining methods

Processing top-N relational queries by learning

On three classes of division queries involving ordinal preferences