Bibliography - Probabilistic Databases - page 157

Michalis Potamias, Francesco Bonchi, Aristides Gionis, and George Kollios. k-nearest neighbors
in uncertain graphs. Proc. Very Large Data Bases , 3:997-1008, 2010. Cited on page(s) 12
J. Scott Provan and Michael O. Ball. The complexity of counting cuts and of computing the
probability that a graph is connected. SIAM Journal on Computing , 12(4):777-788, 1983.
DOI: 10.1137/0212053 Cited on page(s) 46 , 47 , 51
Yinian Qi, Rohit Jain, Sarvjeet Singh, and Sunil Prabhakar. Threshold query optimization for
uncertain data. In Proc. ACM SIGMOD Int. Conf. on Management of Data , pages 315-326, 2010.
DOI: 10.1145/1807167.1807203 Cited on page(s) 137
Lawrence R. Rabiner. A tutorial on hidden markov models and selected applications in speech
recognition. In Alex Waibel and Kai-Fu Lee, editors, Readings in speech recognition , pages 267-
296. Morgan Kaufmann Publishers Inc., 1990. ISBN 1-55860-124-4. Cited on page(s) 130
Vibhor Rastogi, Dan Suciu, and Evan Welbourne. Access control over uncertain data. Proc. Very
Large Data Bases , 1:821-832, 2008. DOI: 10.1145/1453856.1453945 Cited on page(s) 12
Christopher Ré and Dan Suciu. Approximate lineage for probabilistic databases. Proc. Very Large
Data Bases , 1:797-808, 2008. DOI: 10.1145/1453856.1453943 Cited on page(s) 121 , 141
Christopher Ré and Dan Suciu. The trichotomy of having queries on a probabilistic database. Ve r y
Large Data Bases J. , 18(5):1091-1116, 2009. DOI: 10.1007/s00778-009-0151-4 Cited on page(s)
52
Christopher Ré, Nilesh N. Dalvi, and Dan Suciu. Query evaluation on probabilistic databases. IEEE
Data Eng. Bull. , 29(1):25-31, 2006. Cited on page(s) 88
Christopher Ré, Nilesh N. Dalvi, and Dan Suciu. Efficient top-k query evaluation on prob-
abilistic data. In Proc. 2007 IEEE 23rd Int. Conf. on Data Eng. , pages 886-895, 2007.
DOI: 10.1109/ICDE.2007.367934 Cited on page(s) 125 , 140
Christopher Ré, Julie Letchner, Magdalena Balazinksa, and Dan Suciu. Event queries on correlated
probabilistic streams. In Proc. ACM SIGMOD Int. Conf. on Management of Data , pages 715-728,
2008. DOI: 10.1145/1376616.1376688 Cited on page(s) 5 , 11 , 130 , 132
Sudeepa Roy, Vittorio Perduca, and Val Tannen. Faster query answering in probabilistic databases
using read-once functions. In Proc. 14th Int. Conf. on Database Theory , pages 232-243, 2011.
DOI: 10.1145/1938551.1938582 Cited on page(s) 121
A. Das Sarma, J.D. Ullman, and J. Widom. Schema design for uncertain databases. In Proc. 3rd
AlbertoMendelzonWorkshop on Foundations of DataManagement , 2009a. paper 2. Cited on page(s)
42