Incomplete Information in Relational Databases
Journal of the ACM (JACM)
On generating all maximal independent sets
Information Processing Letters
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
The Complexity of Counting in Sparse, Regular, and Planar Graphs
SIAM Journal on Computing
Approximate Query Processing: Taming the TeraBytes
Proceedings of the 27th International Conference on Very Large Data Bases
From complete to incomplete information and back
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
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
Using OBDDs for Efficient Query Evaluation on Probabilistic Databases
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Probabilistic databases: diamonds in the dirt
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
Secondary-storage confidence computation for conjunctive queries with inequalities
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
On the Readability of Monotone Boolean Formulae
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Journal of Artificial Intelligence Research
Read-once functions and query evaluation in probabilistic databases
Proceedings of the VLDB Endowment
Providing support for full relational algebra in probabilistic databases
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
SPROUT2: a squared query engine for uncertain web data
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient approximations of conjunctive queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
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
Oblivious bounds on the probability of boolean functions
ACM Transactions on Database Systems (TODS)
Anytime approximation in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
This paper investigates the problem of approximating conjunctive queries without self-joins on probabilistic databases by lower and upper bounds that can be computed more efficiently. We study this problem via an indirection: Given a propositional formula &phis;, find formulas in a more restricted language that are greatest lower bound and least upper bound, respectively, of &phis;. We study bounds in the languages of read-once formulas, where every variable occurs at most once, and of read-once formulas in disjunctive normal form. We show equivalences of syntactic and model-theoretic characterisations of optimal bounds for unate formulas, and present algorithms that can enumerate them with polynomial delay. Such bounds can be computed by queries expressed using first-order queries extended with transitive closure and a special choice construct. Besides probabilistic databases, these results can also benefit the problem of approximate query evaluation in relational databases, since the bounds expressed by queries can be computed in polynomial combined complexity.