Bipolar SQLf: a Flexible Querying Language for Relational Databases

Abstract : Flexible querying of information systems allows expressing complex preferences in user queries. Such preferences can be modeled by fuzzy bipolar conditions which are made of constraints c and wishes w and interpreted as "to satisfy c and if possible to satisfy w".We de ne in this article the main elements of the Bipolar SQLf language, which is an SQL-like querying language based on a bipolar relational algebra. This language is an extension of the SQLf language. Basic statements (projection, selection, etc.) are firstly defined in terms of syntax, evaluation and calibration. Then, complex statements, such as bipolar queries based on nesting operators are studied in terms of expression, evaluation, query equivalence and backward compatibility with the SQLf language.
Type de document :
Communication dans un congrès
The 9th International Conference on Flexible Query Answering Systems (FQAS'11), Oct 2011, Belgium. pp.472-484, 2011
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00657273
Contributeur : Ludovic Lietard <>
Soumis le : vendredi 6 janvier 2012 - 11:04:04
Dernière modification le : mercredi 2 août 2017 - 10:09:13
Document(s) archivé(s) le : mardi 13 décembre 2016 - 20:26:58

Fichier

Bipolar_SQLf-FQAS2011.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00657273, version 1

Citation

Nouredine Tamani, Ludovic Lietard, Daniel Rocacher. Bipolar SQLf: a Flexible Querying Language for Relational Databases. The 9th International Conference on Flexible Query Answering Systems (FQAS'11), Oct 2011, Belgium. pp.472-484, 2011. 〈hal-00657273〉

Partager

Métriques

Consultations de la notice

159

Téléchargements de fichiers

162