Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Arnaud Martin <>
Submitted on : Sunday, January 25, 2015 - 8:54:33 AM
Last modification on : Friday, March 6, 2020 - 4:10:02 PM
Document(s) archivé(s) le : Sunday, April 26, 2015 - 10:05:52 AM


Files produced by the author(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⟩



Record views


Files downloads