The Dichotomy of Conjunctive Queries on Probabilistic Structures

Details The Dichotomy of Conjunctive Queries on Probabilistic Structures The Dichotomy of Conjunctive Queries on Probabilistic Structures

2006-12-20

arxiv.org/abs/cs/0612102v2

Computer Science

Databases

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Dichotomy of Conjunctive Queries on Probabilistic Structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Dichotomy of Conjunctive Queries on Probabilistic Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Dichotomy of Conjunctive Queries on Probabilistic Structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-21808