The Dichotomy of Conjunctive Queries on Probabilistic Structures
Nilesh Dalvi, Dan Suciu
Abstract
We show that for every conjunctive query, the complexity of evaluating it on a probabilistic database is either or #¶-complete, and we give an algorithm for deciding whether a given conjunctive query is or #¶-complete. The dichotomy property is a fundamental result on query evaluation on probabilistic databases and it gives a complete classification of the complexity of conjunctive queries.
Create a lesson
Related papers
Compositional Online Learning for Semantic Data Processing Systems
Paweł Liskowski, Fuheng Zhao, Benjamin Han et al.
Incremental Delta-Shapley: A Standalone Runtime for Predicate Attribution on Sliding Windows
Pouya Khani, Ira Assent
Size Bounds for CQs Under Acyclic Constraints
Stefan Mengel, Andrei Romashchenko
IBLTs Measure Before They Decode: Self-Sizing Set Reconciliation from Pre-Peeling Counts
Min Wu, Ji Qi, Chengdui Luo et al.
VoS: Variate Ordering Strategies for Skyline Query Optimization
Abhinav Gorantla, Pratanu Mandal, K. Selçuk Candan et al.
Realistic Counterfactual Explanations via Denial Constraints
Avia Asael, Nave Frost, Amir Gilad et al.