Skip to Main content Skip to Navigation
Conference papers

Challenges for Efficient Query Evaluation on Structured Probabilistic Data

Antoine Amarilli 1 Silviu Maniu 2 Mikaël Monet 1
1 DBWeb
LTCI - Laboratoire Traitement et Communication de l'Information
Abstract : Query answering over probabilistic data is an important task but is generally intractable. However, a new approach for this problem has recently been proposed, based on structural decompositions of input databases, following, e.g., tree decompositions. This paper presents a vision for a database management system for probabilistic data built following this structural approach. We review our existing and ongoing work on this topic and highlight many theoretical and practical challenges that remain to be addressed.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01360167
Contributor : Silviu Maniu <>
Submitted on : Monday, September 5, 2016 - 2:48:41 PM
Last modification on : Tuesday, April 21, 2020 - 1:12:36 AM
Document(s) archivé(s) le : Tuesday, December 6, 2016 - 1:38:29 PM

File

amarilli2016challenges.pdf
Files produced by the author(s)

Identifiers

Citation

Antoine Amarilli, Silviu Maniu, Mikaël Monet. Challenges for Efficient Query Evaluation on Structured Probabilistic Data. SUM 2016 - 10th International Conference Scalable Uncertainty Management, Sep 2016, Nice, France. pp.323-330, ⟨10.1007/978-3-319-45856-4_22⟩. ⟨hal-01360167⟩

Share

Metrics

Record views

466

Files downloads

176