Indexing Evidential Data - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Indexing Evidential Data

Résumé

Querying imperfect data received increasing at-tention in the area of database management. The complexity and the volume of imperfect data requires advanced techniques for efficient access, and satisfying user-queries in a reasonable response time. In this paper, we are particularly interested in evidential databases, i.e., databases where imperfection is represented through Dempster-Shafer theory. To answer user-queries in such databases, we propose a new index system based on a tree data structure (e-Tree) that is adapted to the complexity of the evidential data. The experiments done on our solution showed encouraging results.
Fichier principal
Vignette du fichier
paper.pdf (329.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01107720 , version 1 (25-01-2015)

Identifiants

  • HAL Id : hal-01107720 , version 1

Citer

Anouar Jammali, Mohamed Anis Bach Tobji, Arnaud Martin, Boutheina Ben Yaghlane. Indexing Evidential Data. Third World Conference on Complex Systems, Nov 2014, Marrakech, Morocco. ⟨hal-01107720⟩
199 Consultations
239 Téléchargements

Partager

Gmail Facebook X LinkedIn More