Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Complexity of generalized satisfiability counting problems
Information and Computation
A probabilistic relational algebra for the integration of information retrieval and database systems
ACM Transactions on Information Systems (TOIS)
ProbView: a flexible probabilistic database system
ACM Transactions on Database Systems (TODS)
The complexity of query reliability
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Management of Probabilistic Data
IEEE Transactions on Knowledge and Data Engineering
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
MYSTIQ: a system for finding more answers by using probabilities
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Management of probabilistic data: foundations and challenges
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Management of probabilistic data: foundations and challenges
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Management of data with uncertainties
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Matching twigs in probabilistic XML
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Ranking queries on uncertain data: a probabilistic threshold approach
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Query efficiency in probabilistic XML models
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Event queries on correlated probabilistic streams
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Query answering techniques on uncertain and probabilistic data: tutorial summary
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Approximating predicates and expressive queries on probabilistic databases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incorporating constraints in probabilistic XML
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query evaluation with soft-key constraints
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Managing Probabilistic Data with MystiQ: The Can-Do, the Could-Do, and the Can't-Do
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Using OBDDs for Efficient Query Evaluation on Probabilistic Databases
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Sliding-window top-k queries on uncertain streams
Proceedings of the VLDB Endowment
Approximate Probabilistic Query Answering over Inconsistent Databases
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
A compositional query algebra for second-order logic and uncertain databases
Proceedings of the 12th International Conference on Database Theory
Modeling and querying probabilistic XML data
ACM SIGMOD Record
Probabilistic databases: diamonds in the dirt
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
Running tree automata on probabilistic XML
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Secondary-storage confidence computation for conjunctive queries with inequalities
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Incorporating constraints in probabilistic XML
ACM Transactions on Database Systems (TODS)
Continuously monitoring top-k uncertain data streams: a probabilistic threshold method
Distributed and Parallel Databases
The trichotomy of HAVING queries on a probabilistic database
The VLDB Journal — The International Journal on Very Large Data Bases
Query evaluation over probabilistic XML
The VLDB Journal — The International Journal on Very Large Data Bases
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
Proceedings of the 13th International Conference on Extending Database Technology
Querying parse trees of stochastic context-free grammars
Proceedings of the 13th International Conference on Database Theory
Proceedings of the 13th International Conference on Database Theory
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Understanding cardinality estimation using entropy maximization
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing query probability with incidence algebras
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Sliding-window top-k queries on uncertain streams
The VLDB Journal — The International Journal on Very Large Data Bases
Combining intensional with extensional query evaluation in tuple independent probabilistic databases
Information Sciences: an International Journal
Read-once functions and query evaluation in probabilistic databases
Proceedings of the VLDB Endowment
Ranking queries on uncertain data
The VLDB Journal — The International Journal on Very Large Data Bases
Knowledge compilation meets database theory: compiling queries to decision diagrams
Proceedings of the 14th International Conference on Database Theory
Faster query answering in probabilistic databases using read-once functions
Proceedings of the 14th International Conference on Database Theory
On probabilistic models for uncertain sequential pattern mining
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Queries and materialized views on probabilistic databases
Journal of Computer and System Sciences
Value joins are expensive over (probabilistic) XML
Proceedings of the 4th International Workshop on Logic in Databases
Journal of the ACM (JACM)
The monte carlo database system: Stochastic analysis close to the data
ACM Transactions on Database Systems (TODS)
Database foundations for scalable RDF processing
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Understanding cardinality estimation using entropy maximization
ACM Transactions on Database Systems (TODS)
H-Tree: a hybrid structure for confidence computation in probabilistic databases
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Probabilistic query answering over inconsistent databases
Annals of Mathematics and Artificial Intelligence
Answering queries using views over probabilistic XML: complexity and tractability
Proceedings of the VLDB Endowment
The dichotomy of probabilistic inference for unions of conjunctive queries
Journal of the ACM (JACM)
A dichotomy in the complexity of counting database repairs
Journal of Computer and System Sciences
A temporal-probabilistic database model for information extraction
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
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.