Structurally Tractable Uncertain Data - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Structurally Tractable Uncertain Data

(1, 2)
1
2

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.
Not file

Dates and versions

hal-01190610 , version 1 (01-09-2015)

Identifiers

  • HAL Id : hal-01190610 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More