Evaluation of flexible queries: the quantified statement case

  • Authors:
  • Patrick Bosc;Ludovic Liétard;Olivier Pivert

  • Affiliations:
  • IRISA/ENSSAT, Technopole ANTICIPA BP 447, 22305 Lannion, FRANCE;IRISA/IUT, Rue Édouard Branly BP 150, 22305 Lannion, FRANCE;IRISA/ENSSAT, Technopole ANTICIPA BP 447, 22305 Lannion, FRANCE

  • Venue:
  • Technologies for constructing intelligent systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many propositions to extend database management systems have been made in the last decade. Some of them aim to support a wider range of queries involving fuzzy predicates expressing preferences and this paper focuses on the evaluation of a particular subset of queries, namely those using fuzzy quantified statements. More precisely, we consider the queries calling on a partitioning where a linguistic quantifier appears in the set-oriented condition. This condition is expressed by a quantified statement of type "Q X are A" and its degree of truth is assumed to be computed via the Sugeno fuzzy integral. This paper proposes algorithms to evaluate such queries and the main objective is to reduce processing time by saving data access. Heuristics are integrated into the algorithms in order to conclude on the result without accessing all elements of the referential.