The Dichotomy of Conjunctive Queries on Probabilistic Structures
Databases
2007-05-23 v2
Abstract
We show that for every conjunctive query, the complexity of evaluating it on a probabilistic database is either \PTIME or #\P-complete, and we give an algorithm for deciding whether a given conjunctive query is \PTIME or #\P-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.
Cite
@article{arxiv.cs/0612102,
title = {The Dichotomy of Conjunctive Queries on Probabilistic Structures},
author = {Nilesh Dalvi and Dan Suciu},
journal= {arXiv preprint arXiv:cs/0612102},
year = {2007}
}