Skip to Main content Skip to Navigation

Hierarchical Fuzzy Sets To Query Possibilistic Databases

Abstract : Within the framework of flexible querying of possibilistic databases, based on the fuzzy set theory, this chapter focuses on the case where the vocabulary used both in the querying language and in the data is hierarchically organized, which occurs in systems that use ontologies. We give an overview of previous works concerning two issues: firstly, flexible querying of imprecise data in the relational model; secondly, the introduction of fuzziness in hierarchies. Concerning the latter point, we develop an aspect where there is a lack of study in current literature: fuzzy sets whose definition domains are hierarchies. Hence we propose the concept of hierarchical fuzzy set and present its properties. We present its application in the MIEL flexible querying system, for the querying of two imprecise relational databases, including user interfaces and experimental results.
Document type :
Book sections
Complete list of metadatas
Contributor : Rallou Thomopoulos <>
Submitted on : Monday, February 2, 2009 - 3:53:35 PM
Last modification on : Thursday, March 26, 2020 - 8:10:49 PM

Links full text



Rallou Thomopoulos, Patrice Buche, Ollivier Haemmerlé. Hierarchical Fuzzy Sets To Query Possibilistic Databases. J. Galindo. Handbook of Research on Fuzzy Information Processing in Databases, Hershey, PA, USA: Information Science Reference, pp.299-324, 2008, ⟨10.4018/978-1-59904-853-6.ch012⟩. ⟨lirmm-00358030⟩



Record views