Bipolar SQLf: a Flexible Querying Language for Relational Databases - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Bipolar SQLf: a Flexible Querying Language for Relational Databases

Résumé

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.
Fichier principal
Vignette du fichier
Bipolar_SQLf-FQAS2011.pdf (370.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00657273 , version 1 (06-01-2012)

Identifiants

  • HAL Id : hal-00657273 , version 1

Citer

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. ⟨hal-00657273⟩
142 Consultations
199 Téléchargements

Partager

Gmail Facebook X LinkedIn More