Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Decomposable negation normal form
Journal of the ACM (JACM)
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
OBDDs of a Monotone Function and of Its Prime Implicants
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Context-sensitive program analysis as database queries
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ULDBs: databases with uncertainty and lineage
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Management of probabilistic data: foundations and challenges
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The dichotomy of conjunctive queries on probabilistic structures
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient query evaluation on probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Representing Tuple and Attribute Uncertainty in Probabilistic Databases
ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Conditioning probabilistic databases
Proceedings of the VLDB Endowment
Fast and Simple Relational Processing of Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
ProbLog: a probabilistic prolog and its application in link discovery
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Treewidth in verification: local vs. global
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Using DPLL for efficient OBDD construction
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Models for incomplete and probabilistic information
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Read-once functions and query evaluation in probabilistic databases
Proceedings of the VLDB Endowment
Tractability in probabilistic databases
Proceedings of the 14th International Conference on Database Theory
Knowledge compilation meets database theory: compiling queries to decision diagrams
Proceedings of the 14th International Conference on Database Theory
On the optimal approximation of queries using tractable propositional languages
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
Aggregation in probabilistic databases via knowledge compilation
Proceedings of the VLDB Endowment
Local structure and determinism in probabilistic databases
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
On the tractability of query compilation and bounded treewidth
Proceedings of the 15th International Conference on Database Theory
Factorised representations of query results: size bounds and readability
Proceedings of the 15th International Conference on Database Theory
Probabilistic databases with MarkoViews
Proceedings of the VLDB Endowment
FDB: a query engine for factorised relational databases
Proceedings of the VLDB Endowment
Oblivious bounds on the probability of boolean functions
ACM Transactions on Database Systems (TODS)
A temporal-probabilistic database model for information extraction
Proceedings of the VLDB Endowment
Anytime approximation in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
We consider the problem of query evaluation for tuple independent probabilistic databases and Boolean conjunctive queries with inequalities but without self-joins. We approach this problem as a construction problem for ordered binary decision diagrams (OBDDs): Given a query qand a probabilistic database D, we construct in polynomial time an OBDD such that the probability of q(D) can be computed linearly in the size of that OBDD. This approach is applicable to a large class of queries, including the hierarchicalqueries, i.e., the Boolean conjunctive queries without self-joins that admit PTIME evaluation on any tuple-independent probabilistic database, hierarchical queries extended with inequalities, and non-hierarchical queries on restricted databases.