Indexing Evidential Data

Abstract : 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.
Type de document :
Communication dans un congrès
Third World Conference on Complex Systems, Nov 2014, Marrakech, Morocco
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger
Contributeur : Arnaud Martin <>
Soumis le : dimanche 25 janvier 2015 - 08:54:33
Dernière modification le : jeudi 15 novembre 2018 - 11:58:49
Document(s) archivé(s) le : dimanche 26 avril 2015 - 10:05:52


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01107720, version 1


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〉



Consultations de la notice


Téléchargements de fichiers