Flexible Database Querying Based on Ordered Lattice Theory Extension

Flexible Database Querying Based on Ordered Lattice Theory Extension

Minyar Sassi1, Amel Touzi1, and Habib Ounelli2
1Ecole Nationale d’Ingénieurs de Tunis, Tunisia
2Faculté des Sciences de Tunis, Campus Universitaire-1060 Tunis, Tunisia

 

Abstract: This research reports on the synthesis of flexible database querying approach based on ordered lattice theory extension to deal with imprecise and structured data. This approach allows us to construct a multi-attributes type abstraction hierarchy structure for the case of decomposition according several attributes. This structure is defined from an ordered lattice theory extension. Our approach consists of two steps: the first step consists in data organization and the second at seeking, to interrogate them, relevant data sources for a given query. The contributions of this approach are a) the interdependence of the query research criteria, b) the research of the relevant data sources for a given query, and d) the scheduling of the results.

Keywords: Fuzzy cluster analysis, formal concept analysis, flexible database querying, concept query, relieving query.

Received March 3, 2007; accepted June 13, 2007

 Full Text


Read 5822 times Last modified on Wednesday, 20 January 2010 01:54
Share
Top
We use cookies to improve our website. By continuing to use this website, you are giving consent to cookies being used. More details…