@book{DBLP:series/synthesis/2011Suciu, author = {Dan Suciu and Dan Olteanu and Christopher R{\'{e}} and Christoph Koch}, title = {Probabilistic Databases}, series = {Synthesis Lectures on Data Management}, publisher = {Morgan {\&} Claypool Publishers}, year = {2011}, url = {https://doi.org/10.2200/S00362ED1V01Y201105DTM016}, doi = {10.2200/S00362ED1V01Y201105DTM016}, timestamp = {Tue, 16 May 2017 14:24:20 +0200}, biburl = {https://dblp.org/rec/series/synthesis/2011Suciu.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{10.1145/1265530.1265571, author = {Dalvi, Nilesh and Suciu, Dan}, title = {The Dichotomy of Conjunctive Queries on Probabilistic Structures}, year = {2007}, isbn = {9781595936851}, publisher = {Association for Computing Machinery}, address = {New York, NY, USA}, url = {https://doi-org.gate.lib.buffalo.edu/10.1145/1265530.1265571}, doi = {10.1145/1265530.1265571}, abstract = {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.}, booktitle = {Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems}, pages = {293–302}, numpages = {10}, keywords = {probabilistic databases, dichotomy, conjunctive queries}, location = {Beijing, China}, series = {PODS '07} } @inproceedings{DBLP:conf/icde/OlteanuHK10, author = {Dan Olteanu and Jiewen Huang and Christoph Koch}, editor = {Feifei Li and Mirella M. Moro and Shahram Ghandeharizadeh and Jayant R. Haritsa and Gerhard Weikum and Michael J. Carey and Fabio Casati and Edward Y. Chang and Ioana Manolescu and Sharad Mehrotra and Umeshwar Dayal and Vassilis J. Tsotras}, title = {Approximate confidence computation in probabilistic databases}, booktitle = {Proceedings of the 26th International Conference on Data Engineering, {ICDE} 2010, March 1-6, 2010, Long Beach, California, {USA}}, pages = {145--156}, publisher = {{IEEE} Computer Society}, year = {2010}, url = {https://doi.org/10.1109/ICDE.2010.5447826}, doi = {10.1109/ICDE.2010.5447826}, timestamp = {Wed, 16 Oct 2019 14:14:56 +0200}, biburl = {https://dblp.org/rec/conf/icde/OlteanuHK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/icde/AntovaKO07a, author = {Lyublena Antova and Christoph Koch and Dan Olteanu}, editor = {Rada Chirkova and Asuman Dogac and M. Tamer {\"{O}}zsu and Timos K. Sellis}, title = {MayBMS: Managing Incomplete Information with Probabilistic World-Set Decompositions}, booktitle = {Proceedings of the 23rd International Conference on Data Engineering, {ICDE} 2007, The Marmara Hotel, Istanbul, Turkey, April 15-20, 2007}, pages = {1479--1480}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/ICDE.2007.369042}, doi = {10.1109/ICDE.2007.369042}, timestamp = {Wed, 16 Oct 2019 14:14:56 +0200}, biburl = {https://dblp.org/rec/conf/icde/AntovaKO07a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/sigmod/BoulosDMMRS05, author = {Jihad Boulos and Nilesh N. Dalvi and Bhushan Mandhani and Shobhit Mathur and Christopher R{\'{e}} and Dan Suciu}, editor = {Fatma {\"{O}}zcan}, title = {{MYSTIQ:} a system for finding more answers by using probabilities}, booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data, Baltimore, Maryland, USA, June 14-16, 2005}, pages = {891--893}, publisher = {{ACM}}, year = {2005}, url = {https://doi.org/10.1145/1066157.1066277}, doi = {10.1145/1066157.1066277}, timestamp = {Tue, 06 Nov 2018 11:07:39 +0100}, biburl = {https://dblp.org/rec/conf/sigmod/BoulosDMMRS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/sigmod/SinghMMPHS08, author = {Sarvjeet Singh and Chris Mayfield and Sagar Mittal and Sunil Prabhakar and Susanne E. Hambrusch and Rahul Shah}, editor = {Jason Tsong{-}Li Wang}, title = {Orion 2.0: native support for uncertain data}, booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data, {SIGMOD} 2008, Vancouver, BC, Canada, June 10-12, 2008}, pages = {1239--1242}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1376616.1376744}, doi = {10.1145/1376616.1376744}, timestamp = {Tue, 06 Nov 2018 11:07:37 +0100}, biburl = {https://dblp.org/rec/conf/sigmod/SinghMMPHS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{AF18, author = {Arab, Bahareh and Feng, Su and Glavic, Boris and Lee, Seokki and Niu, Xing and Zeng, Qitian}, bibsource = {dblp computer science bibliography, https://dblp.org}, biburl = {https://dblp.org/rec/bib/journals/debu/ArabFGLNZ17}, journal = {{IEEE} Data Engineering Bulletin}, keywords = {GProM; Provenance; Annotations}, number = {1}, pages = {51--62}, pdfurl = {http://sites.computer.org/debull/A18mar/p51.pdf}, projects = {GProM; Reenactment}, timestamp = {Fri, 02 Mar 2018 18:50:49 +0100}, title = {{GProM} - {A} Swiss Army Knife for Your Provenance Needs}, venueshort = {Data Eng. Bull.}, volume = {41}, year = {2018}, bdsk-url-1 = {http://sites.computer.org/debull/A18mar/p51.pdf} } @inproceedings{DBLP:conf/tapp/Zavodny11, author = {Jakub Z{\'{a}}vodn{\'{y}}}, editor = {Peter Buneman and Juliana Freire}, title = {On Factorisation of Provenance Polynomials}, booktitle = {3rd Workshop on the Theory and Practice of Provenance, TaPP'11, Heraklion, Crete, Greece, June 20-21, 2011}, publisher = {{USENIX} Association}, year = {2011}, url = {https://www.usenix.org/conference/tapp11/factorisation-provenance-polynomials}, timestamp = {Wed, 04 Jul 2018 13:06:34 +0200}, biburl = {https://dblp.org/rec/conf/tapp/Zavodny11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }