Challenges for Efficient Query Evaluation on Structured Probabilistic Data
arXiv:1607.05538 · doi:10.1007/978-3-319-45856-4_22
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.
9 pages, 1 figure, 23 references. Accepted for publication at SUM 2016