Structurally Tractable Uncertain Data

Antoine Amarilli 1, 2
1 DIG - Data, Intelligence and Graphs
LTCI - Laboratoire Traitement et Communication de l'Information
Abstract :

Many data management applications must deal with data which is uncertain, incomplete, or noisy. However, on existing uncertain data representations, we cannot tractably perform the important query evaluation tasks of determining query possibility, certainty, or probability: these problems are hard on arbitrary uncertain input instances. We thus ask whether we could restrict the structure of uncertain data so as to guarantee the tractability of exact query evaluation. We present our tractability results for tree and tree-like uncertain data, and a vision for probabilistic rule reasoning. We also study uncertainty about order, proposing a suitable representation, and study uncertain data conditioned by additional observations.

Document type :
Conference papers
Complete list of metadatas

https://hal-imt.archives-ouvertes.fr/hal-01190610
Contributor : Admin Télécom Paristech <>
Submitted on : Tuesday, September 1, 2015 - 2:24:56 PM
Last modification on : Thursday, October 17, 2019 - 12:36:59 PM

Identifiers

  • HAL Id : hal-01190610, version 1

Collections

Citation

Antoine Amarilli. Structurally Tractable Uncertain Data. SIGMOD/PODS Ph.D. Symposium, Jun 2015, Melbourne, Australia. pp.39-44. ⟨hal-01190610⟩

Share

Metrics

Record views

99