The Dichotomy of Conjunctive Queries on Probabilistic Structures
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.