Bibliography - Probabilistic Databases - page 148

BIBLIOGRAPHY
Graham Cormode, Feifei Li, and Ke Yi. Semantics of ranking queries for probabilistic data
and expected ranks. In Proc. 25th IEEE Int. Conf. on Data Eng. , pages 305-316, 2009b.
DOI: 10.1109/ICDE.2009.75 Cited on page(s) 13

Paul Dagum, Richard Karp, Michael Luby, and Sheldon Ross. An optimal algorithm for Monte
Carlo estimation. SIAM J. Comput. , 29:1484-1496, 2000. DOI: 10.1137/S0097539797315306
Cited on page(s) 108

N. Dalvi and D. Suciu. The dichotomy of probabilistic inference for unions of conjunctive queries,
2010. under review (preliminary version appeared in PODS 2010). Cited on page(s) 48 , 50 , 52 ,
70 , 71 , 87

Nilesh Dalvi and Dan Suciu. Efficient query evaluation on probabilistic databases. In Proc. 30th Int.
Conf. on Very large Data Bases , pages 864-875, 2004. DOI: 10.1007/s00778-006-0004-3 Cited
on page(s) 10 , 15 , 41 , 51 , 52 , 74 , 87 , 132

Nilesh Dalvi and Dan Suciu. Management of probabilistic data: foundations and challenges. In
Proc. 26th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Syst. , pages 1-12,
2007a. DOI: 10.1145/1265530.1265531 Cited on page(s) 52 , 88

Nilesh Dalvi and Dan Suciu. Efficient query evaluation on probabilistic databases. Very Large Data
Bases J. , 16:523-544, 2007b. DOI: 10.1007/s00778-006-0004-3 Cited on page(s) 88

Nilesh Dalvi, Christopher Ré, and Dan Suciu. Queries and materialized views on probabilistic
databases. J. Comput. Syst. Sci. , 77:473-490, 2011. DOI: 10.1016/j.jcss.2010.04.006 Cited on

page(s) 141

Nilesh N. Dalvi and Dan Suciu. Management of probabilistic data: foundations and challenges. In
Proc. 26th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Syst. , pages 1-12,
2007c. DOI: 10.1145/1265530.1265531 Cited on page(s) 41 , 47 , 52 , 85 , 86

Nilesh N. Dalvi, Philip Bohannon, and Fei Sha. Robust web extraction: an approach based on a
probabilistic tree-edit model. In Proc. ACM SIGMOD Int. Conf. on Management of Data , pages
335-348, 2009. DOI: 10.1145/1559845.1559882 Cited on page(s) 11

Nilesh N. Dalvi, Karl Schnaitter, and Dan Suciu. Computing query probability with incidence
algebras. In Proc. 29th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Syst. ,
pages 203-214, 2010. DOI: 10.1145/1807085.1807113 Cited on page(s) 52 , 87

Adnan Darwiche. Decomposable negation normal form. J. ACM , 48(4):608-647, 2001.

DOI: 10.1145/502090.502091 Cited on page(s) 121

Adnan Darwiche. Searching while keeping a trace: The evolution from satisfiability to knowl-
edge compilation. In Proc. 3rd Int. Joint Conf. on Automated Reasoning , page 3, 2006.
DOI: 10.1007/11814771_2 Cited on page(s) 91 , 121