594 lines
14 KiB
BibTeX
594 lines
14 KiB
BibTeX
misc{pdbench,
|
|
howpublished = {r̆lhttp://pdbench.sourceforge.net/},
|
|
note = {Accessed: 2020-12-15},
|
|
title = {pdbench}
|
|
}
|
|
|
|
@article{AF18,
|
|
author = {Arab, Bahareh and Feng, Su and Glavic, Boris and Lee, Seokki and Niu, Xing and Zeng, Qitian},
|
|
journal = {IEEE Data Eng. Bull.},
|
|
number = {1},
|
|
pages = {51--62},
|
|
title = {GProM - A Swiss Army Knife for Your Provenance Needs},
|
|
volume = {41},
|
|
year = {2018}
|
|
}
|
|
|
|
@inproceedings{10.1145/1265530.1265571,
|
|
author = {Dalvi, Nilesh and Suciu, Dan},
|
|
booktitle = {PODS},
|
|
numpages = {10},
|
|
pages = {293--302},
|
|
title = {The Dichotomy of Conjunctive Queries on Probabilistic Structures},
|
|
year = {2007}
|
|
}
|
|
|
|
@inproceedings{DBLP:conf/icde/OlteanuHK10,
|
|
author = {Dan Olteanu and
|
|
Jiewen Huang and
|
|
Christoph Koch},
|
|
booktitle = {ICDE},
|
|
pages = {145--156},
|
|
title = {Approximate confidence computation in probabilistic databases},
|
|
year = {2010}
|
|
}
|
|
|
|
@book{DBLP:series/synthesis/2011Suciu,
|
|
author = {Dan Suciu and
|
|
Dan Olteanu and
|
|
Christopher Ré and
|
|
Christoph Koch},
|
|
publisher = {Morgan \& Claypool Publishers},
|
|
title = {Probabilistic Databases},
|
|
year = {2011}
|
|
}
|
|
|
|
@inproceedings{feng:2019:sigmod:uncertainty,
|
|
author = {Feng, Su and Huber, Aaron and Glavic, Boris and Kennedy, Oliver},
|
|
booktitle = {SIGMOD},
|
|
title = {Uncertainty Annotated Databases - A Lightweight Approach for Approximating Certain Answers},
|
|
year = {2019}
|
|
}
|
|
|
|
@article{FH12,
|
|
author = {Fink, Robert and Han, Larisa and Olteanu, Dan},
|
|
journal = {PVLDB},
|
|
number = {5},
|
|
pages = {490--501},
|
|
title = {Aggregation in probabilistic databases via knowledge compilation},
|
|
volume = {5},
|
|
year = {2012}
|
|
}
|
|
|
|
|
|
|
|
@inproceedings{DBLP:conf/tapp/Zavodny11,
|
|
author = {Jakub Závodný},
|
|
booktitle = {TaPP},
|
|
title = {On Factorisation of Provenance Polynomials},
|
|
year = {2011}
|
|
}
|
|
|
|
|
|
@inproceedings{kennedy:2010:icde:pip,
|
|
author = {Kennedy, Oliver and Koch, Christoph},
|
|
booktitle = {ICDE},
|
|
title = {PIP: A Database System for Great and Small Expectations},
|
|
year = {2010}
|
|
}
|
|
|
|
@inproceedings{DBLP:conf/icde/AntovaKO07a,
|
|
author = {Lyublena Antova and
|
|
Christoph Koch and
|
|
Dan Olteanu},
|
|
booktitle = {ICDE},
|
|
title = {MayBMS: Managing Incomplete Information with Probabilistic World-Set
|
|
Decompositions},
|
|
year = {2007}
|
|
}
|
|
|
|
@misc{Antova_fastand,
|
|
author = {Lyublena Antova and Thomas Jansen and Christoph Koch and Dan Olteanu},
|
|
title = {Fast and Simple Relational Processing of Uncertain Data},
|
|
year = {}
|
|
}
|
|
|
|
@inproceedings{DBLP:conf/pods/KhamisNR16,
|
|
author = {Mahmoud Abo Khamis and
|
|
Hung Q. Ngo and
|
|
Atri Rudra},
|
|
booktitle = {PODS},
|
|
pages = {13--28},
|
|
title = {FAQ: Questions Asked Frequently},
|
|
year = {2016}
|
|
}
|
|
|
|
@article{DBLP:journals/sigmod/GuagliardoL17,
|
|
author = {Paolo Guagliardo and
|
|
Leonid Libkin},
|
|
journal = {SIGMOD Rec.},
|
|
number = {3},
|
|
pages = {5--16},
|
|
title = {Correctness of SQL Queries on Databases with Nulls},
|
|
volume = {46},
|
|
year = {2017}
|
|
}
|
|
|
|
@inproceedings{DBLP:conf/vldb/AgrawalBSHNSW06,
|
|
author = {Parag Agrawal and
|
|
Omar Benjelloun and
|
|
Anish Das Sarma and
|
|
Chris Hayworth and
|
|
Shubha U. Nabar and
|
|
Tomoe Sugihara and
|
|
Jennifer Widom},
|
|
booktitle = {VLDB},
|
|
pages = {1151--1154},
|
|
title = {Trio: A System for Data, Uncertainty, and Lineage},
|
|
year = {2006}
|
|
}
|
|
|
|
@inproceedings{k-match,
|
|
author = {Radu Curticapean},
|
|
booktitle = {ICALP},
|
|
pages = {352--363},
|
|
title = {Counting Matchings of Size k Is W[1]-Hard},
|
|
volume = {7965},
|
|
year = {2013}
|
|
}
|
|
|
|
|
|
@inproceedings{DBLP:conf/sigmod/SinghMMPHS08,
|
|
author = {Sarvjeet Singh and
|
|
Chris Mayfield and
|
|
Sagar Mittal and
|
|
Sunil Prabhakar and
|
|
Susanne E. Hambrusch and
|
|
Rahul Shah},
|
|
booktitle = {SIGMOD},
|
|
pages = {1239--1242},
|
|
title = {Orion 2.0: native support for uncertain data},
|
|
year = {2008}
|
|
}
|
|
|
|
@inproceedings{DBLP:conf/pods/GreenKT07,
|
|
author = {Todd J. Green and
|
|
Gregory Karvounarakis and
|
|
Val Tannen},
|
|
booktitle = {PODS},
|
|
pages = {31--40},
|
|
title = {Provenance semirings},
|
|
year = {2007}
|
|
}
|
|
|
|
|
|
@inproceedings{ngo-survey,
|
|
author = {Hung Q. Ngo},
|
|
booktitle = {PODS},
|
|
title = {Worst-Case Optimal Join Algorithms: Techniques, Results, and Open
|
|
Problems},
|
|
year = {2018}
|
|
}
|
|
|
|
|
|
|
|
@article{skew,
|
|
author = {Hung Q. Ngo and
|
|
Christopher Ré and
|
|
Atri Rudra},
|
|
journal = {SIGMOD Rec.},
|
|
number = {4},
|
|
pages = {5--16},
|
|
title = {Skew strikes back: new developments in the theory of join algorithms},
|
|
volume = {42},
|
|
year = {2013}
|
|
}
|
|
|
|
@article{NPRR,
|
|
author = {Hung Q. Ngo and
|
|
Ely Porat and
|
|
Christopher Ré and
|
|
Atri Rudra},
|
|
journal = {J. ACM},
|
|
number = {3},
|
|
pages = {16:1--16:40},
|
|
title = {Worst-case Optimal Join Algorithms},
|
|
volume = {65},
|
|
year = {2018}
|
|
}
|
|
|
|
@book{arith-complexity,
|
|
author = {Peter Bürgisser and
|
|
Michael Clausen and
|
|
Mohammad Amin Shokrollahi},
|
|
publisher = {Springer},
|
|
title = {Algebraic complexity theory},
|
|
volume = {315},
|
|
year = {1997}
|
|
}
|
|
|
|
@inproceedings{triang-hard,
|
|
author = {Tsvi Kopelowitz and
|
|
Virginia Vassilevska Williams},
|
|
booktitle = {ICALP},
|
|
pages = {74:1--74:16},
|
|
title = {Towards Optimal Set-Disjointness and Set-Intersection Data Structures},
|
|
volume = {168},
|
|
year = {2020}
|
|
}
|
|
|
|
@article{LL97,
|
|
author = {Lakshmanan, L.V.S. and Leone, N. and Ross, R. and Subrahmanian, VS},
|
|
journal = {TODS},
|
|
number = {3},
|
|
pages = {419--469},
|
|
title = {Probview: A flexible probabilistic database system},
|
|
volume = {22},
|
|
year = {1997}
|
|
}
|
|
|
|
@article{jha-13-kcmdt,
|
|
author = {Jha, Abhay and Suciu, Dan},
|
|
title = {Knowledge Compilation Meets Database Theory: Compiling Queries
|
|
To Decision Diagrams},
|
|
journal = {Theory of Computing Systems},
|
|
volume = 52,
|
|
number = 3,
|
|
pages = {403--440},
|
|
year = 2013,
|
|
publisher = {Springer},
|
|
}
|
|
@inproceedings{BS06,
|
|
author = {Omar Benjelloun and Anish Das Sarma and Alon Y. Halevy and Jennifer Widom},
|
|
booktitle = {VLDB},
|
|
pages = {953--964},
|
|
title = {ULDBs: Databases with Uncertainty and Lineage},
|
|
year = {2006}
|
|
}
|
|
|
|
@conference{RS07,
|
|
author = {Ré, C. and Suciu, D.},
|
|
booktitle = {VLDB},
|
|
pages = {51--62},
|
|
title = {Materialized views in probabilistic databases: for information exchange and query optimization},
|
|
year = {2007}
|
|
}
|
|
|
|
|
|
|
|
@article{VS17,
|
|
Author = {Van den Broeck, Guy and Suciu, Dan},
|
|
Title = {Query Processing on Probabilistic Data: A Survey},
|
|
Year = {2017},
|
|
}
|
|
|
|
@incollection{GT06,
|
|
author = {Green, Todd J and Tannen, Val},
|
|
booktitle = {EDBT},
|
|
pages = {278--296},
|
|
title = {Models for incomplete and probabilistic information},
|
|
year = {2006}
|
|
}
|
|
|
|
@article{IL84a,
|
|
author = {Imieli\'nski, Tomasz and Lipski Jr, Witold},
|
|
journal = {JACM},
|
|
number = {4},
|
|
pages = {761--791},
|
|
title = {Incomplete Information in Relational Databases},
|
|
volume = {31},
|
|
year = {1984}
|
|
}
|
|
|
|
@article{DS12,
|
|
author = {Dalvi, Nilesh and Suciu, Dan},
|
|
journal = {JACM},
|
|
number = {6},
|
|
pages = {30},
|
|
title = {The dichotomy of probabilistic inference for unions of conjunctive queries},
|
|
volume = {59},
|
|
year = {2012}
|
|
}
|
|
|
|
|
|
@inproceedings{heuvel-19-anappdsd,
|
|
author = {Maarten Van den Heuvel and Peter Ivanov and Wolfgang Gatterbauer and Floris Geerts and Martin Theobald},
|
|
booktitle = {SIGMOD},
|
|
pages = {1295--1312},
|
|
title = {Anytime Approximation in Probabilistic Databases via Scaled Dissociations},
|
|
year = {2019}
|
|
}
|
|
|
|
|
|
@article{AB15,
|
|
author = {Amarilli, Antoine and Bourhis, Pierre and Senellart, Pierre},
|
|
journal = {PODS},
|
|
title = {Probabilities and provenance via tree decompositions},
|
|
year = {2015}
|
|
}
|
|
|
|
|
|
@inproceedings{OH09a,
|
|
author = {Olteanu, Dan and Huang, Jiewen},
|
|
booktitle = {SIGMOD},
|
|
pages = {389--402},
|
|
title = {Secondary-storage confidence computation for conjunctive queries with inequalities},
|
|
year = {2009}
|
|
}
|
|
|
|
@article{FO16,
|
|
author = {Robert Fink and Dan Olteanu},
|
|
journal = {TODS},
|
|
number = {1},
|
|
pages = {4:1--4:47},
|
|
title = {Dichotomies for Queries with Negation in Probabilistic Databases},
|
|
volume = {41},
|
|
year = {2016}
|
|
}
|
|
|
|
@article{FH13,
|
|
author = {Robert Fink and Jiewen Huang and Dan Olteanu},
|
|
journal = {VLDBJ},
|
|
number = {6},
|
|
pages = {823--848},
|
|
title = {Anytime approximation in probabilistic databases},
|
|
volume = {22},
|
|
year = {2013}
|
|
}
|
|
|
|
@inproceedings{AB15c,
|
|
author = {Antoine Amarilli and Pierre Bourhis and Pierre Senellart},
|
|
booktitle = {ICALP},
|
|
pages = {56--68},
|
|
title = {Provenance Circuits for Trees and Treelike Instances},
|
|
year = {2015}
|
|
}
|
|
|
|
@inproceedings{kenig-13-nclexpdc,
|
|
author = {Batya Kenig and Avigdor Gal and Ofer Strichman},
|
|
booktitle = {SUM},
|
|
pages = {219--232},
|
|
title = {A New Class of Lineage Expressions over Probabilistic Databases Computable in P-Time},
|
|
volume = {8078},
|
|
year = {2013}
|
|
}
|
|
|
|
@inproceedings{cavallo-87-tpd,
|
|
author = {Roger Cavallo and Michael Pittarelli},
|
|
booktitle = {VLDB},
|
|
pages = {71--81},
|
|
title = {The Theory of Probabilistic Databases},
|
|
year = {1987}
|
|
}
|
|
|
|
@inproceedings{roy-11-f,
|
|
author = {Sudeepa Roy and Vittorio Perduca and Val Tannen},
|
|
booktitle = {ICDT},
|
|
title = {Faster query answering in probabilistic databases using read-once functions},
|
|
year = {2011}
|
|
}
|
|
|
|
@article{sen-10-ronfqevpd,
|
|
author = {Prithviraj Sen and Amol Deshpande and Lise Getoor},
|
|
journal = {PVLDB},
|
|
number = {1},
|
|
pages = {1068--1079},
|
|
title = {Read-Once Functions and Query Evaluation in Probabilistic Databases},
|
|
volume = {3},
|
|
year = {2010}
|
|
}
|
|
@article{provan-83-ccccptg,
|
|
author = {J. Scott Provan and Michael O. Ball},
|
|
journal = {SIAM J. Comput.},
|
|
number = {4},
|
|
pages = {777--788},
|
|
title = {The Complexity of Counting Cuts and of Computing the Probability That a Graph Is Connected},
|
|
volume = {12},
|
|
year = {1983}
|
|
}
|
|
|
|
@article{valiant-79-cenrp,
|
|
author = {Leslie G. Valiant},
|
|
journal = {SIAM J. Comput.},
|
|
number = {3},
|
|
pages = {410--421},
|
|
title = {The Complexity of Enumeration and Reliability Problems},
|
|
volume = {8},
|
|
year = {1979}
|
|
}
|
|
|
|
@inproceedings{AD11d,
|
|
author = {Amsterdamer, Yael and Deutch, Daniel and Tannen, Val},
|
|
booktitle = {PODS},
|
|
pages = {153--164},
|
|
title = {Provenance for Aggregate Queries},
|
|
year = {2011}
|
|
}
|
|
|
|
|
|
|
|
@article{S18a,
|
|
author = {Senellart, Pierre},
|
|
journal = {SIGMOD Record},
|
|
number = {4},
|
|
pages = {5--15},
|
|
title = {Provenance and Probabilities in Relational Databases},
|
|
volume = {46},
|
|
year = {2018}
|
|
}
|
|
|
|
@article{RS09b,
|
|
author = {Christopher Ré and Dan Suciu},
|
|
journal = {VLDBJ},
|
|
number = {5},
|
|
pages = {1091--1116},
|
|
title = {The trichotomy of HAVING queries on a probabilistic database},
|
|
volume = {18},
|
|
year = {2009}
|
|
}
|
|
|
|
@article{gatterbauer-17-dpaplinws,
|
|
author = {Wolfgang Gatterbauer and Dan Suciu},
|
|
title = {Dissociation and Propagation for Approximate Lifted Inference
|
|
With Standard Relational Database Management Systems},
|
|
journal = {{VLDB} J.},
|
|
volume = 26,
|
|
number = 1,
|
|
pages = {5--30},
|
|
year = 2017
|
|
}
|
|
|
|
@inproceedings{fink-11,
|
|
author = {Robert Fink and Dan Olteanu},
|
|
booktitle = {ICDT},
|
|
pages = {174--185},
|
|
title = {On the optimal approximation of queries using tractable propositional languages},
|
|
year = {2011}
|
|
}
|
|
|
|
@article{jha-12-pdwm,
|
|
author = {Abhay Kumar Jha and Dan Suciu},
|
|
journal = {PVLDB},
|
|
number = {11},
|
|
pages = {1160--1171},
|
|
title = {Probabilistic Databases With Markoviews},
|
|
volume = {5},
|
|
year = {2012}
|
|
}
|
|
|
|
|
|
|
|
@conference{BD05,
|
|
author = {Boulos, J. and Dalvi, N. and Mandhani, B. and Mathur, S. and Re, C. and Suciu, D.},
|
|
booktitle = {SIGMOD},
|
|
title = {MYSTIQ: a system for finding more answers by using probabilities},
|
|
year = {2005}
|
|
}
|
|
|
|
@article{DS07,
|
|
author = {Dalvi, N. and Suciu, D.},
|
|
journal = {VLDB},
|
|
number = {4},
|
|
pages = {544},
|
|
title = {Efficient query evaluation on probabilistic databases},
|
|
volume = {16},
|
|
year = {2007}
|
|
}
|
|
|
|
@inproceedings{re-07-eftqevpd,
|
|
author = {Christopher Ré and Nilesh N. Dalvi and Dan Suciu},
|
|
booktitle = {ICDE},
|
|
pages = {886--895},
|
|
title = {Efficient Top-k Query Evaluation on Probabilistic Data},
|
|
year = {2007}
|
|
}
|
|
|
|
@inproceedings{DM14c,
|
|
author = {Deutch, Daniel and Milo, Tova and Roy, Sudeepa and Tannen, Val},
|
|
booktitle = {ICDT},
|
|
pages = {201--212},
|
|
title = {Circuits for Datalog Provenance},
|
|
year = {2014}
|
|
}
|
|
|
|
@inproceedings{bahar-93-al,
|
|
author = {R. Iris Bahar and Erica A. Frohm and Charles M. Gaona and Gary
|
|
D. Hachtel and Enrico Macii and Abelardo Pardo and Fabio
|
|
Somenzi},
|
|
booktitle = {IEEE CAD},
|
|
title = {Algebraic decision diagrams and their applications},
|
|
year = {1993}
|
|
}
|
|
|
|
@inproceedings{gogate-13-smp,
|
|
author = {Vibhav Gogate and Pedro M. Domingos},
|
|
booktitle = {UAI},
|
|
title = {Structured Message Passing},
|
|
year = {2013}
|
|
}
|
|
|
|
@article{chen-10-cswssr,
|
|
author = {Hubie Chen and Martin Grohe},
|
|
journal = {J. Comput. Syst. Sci.},
|
|
number = {8},
|
|
pages = {847--860},
|
|
title = {Constraint Satisfaction With Succinctly Specified Relations},
|
|
volume = {76},
|
|
year = {2010}
|
|
}
|
|
|
|
@inproceedings{GL16,
|
|
author = {Paolo Guagliardo and
|
|
Leonid Libkin},
|
|
booktitle = {PODS},
|
|
title = {Making SQL Queries Correct on Incomplete Databases: A Feasibility
|
|
Study},
|
|
year = {2016}
|
|
}
|
|
|
|
@inproceedings{jampani2008mcdb,
|
|
author = {Jampani, Ravi and Xu, Fei and Wu, Mingxi and Perez, Luis Leopoldo and Jermaine, Christopher and Haas, Peter J},
|
|
booktitle = {SIGMOD},
|
|
title = {MCDB: a monte carlo approach to managing uncertain data},
|
|
year = {2008}
|
|
}
|
|
|
|
|
|
@article{yang:2015:pvldb:lenses,
|
|
author = {Yang, Ying and Meneghetti, Niccolò and Fehling, Ronny and Liu, Zhen Hua and Gawlick, Dieter and Kennedy, Oliver},
|
|
title = {Lenses: An On-Demand Approach to ETL},
|
|
journal = {PVLDB},
|
|
volume = {8},
|
|
number = {12},
|
|
year = {2015},
|
|
pages = {1578--1589}
|
|
}
|
|
|
|
@misc{pdbench,
|
|
title = {pdbench},
|
|
howpublished = {\url{http://pdbench.sourceforge.net/}},
|
|
note = {Accessed: 2020-12-15}
|
|
}
|
|
|
|
@article{factorized-db,
|
|
author = {Dan Olteanu and
|
|
Maximilian Schleich},
|
|
journal = {SIGMOD Rec.},
|
|
number = {2},
|
|
pages = {5--16},
|
|
title = {Factorized Databases},
|
|
volume = {45},
|
|
year = {2016}
|
|
}
|
|
|
|
@article{virgi-survey,
|
|
author = {Virginia Vassilevska Williams},
|
|
title = {Some Open Problems in Fine-Grained Complexity},
|
|
journal = {{SIGACT} News},
|
|
volume = {49},
|
|
number = {4},
|
|
pages = {29--35},
|
|
year = {2018},
|
|
url = {https://doi.org/10.1145/3300150.3300158},
|
|
doi = {10.1145/3300150.3300158},
|
|
timestamp = {Tue, 18 Dec 2018 15:19:27 +0100},
|
|
biburl = {https://dblp.org/rec/journals/sigact/Williams18.bib},
|
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
|
}
|
|
|
|
@book{param-comp,
|
|
author = {J{\"{o}}rg Flum and
|
|
Martin Grohe},
|
|
title = {Parameterized Complexity Theory},
|
|
series = {Texts in Theoretical Computer Science. An {EATCS} Series},
|
|
publisher = {Springer},
|
|
year = {2006},
|
|
url = {https://doi.org/10.1007/3-540-29953-X},
|
|
doi = {10.1007/3-540-29953-X},
|
|
isbn = {978-3-540-29952-3},
|
|
timestamp = {Tue, 16 May 2017 14:24:38 +0200},
|
|
biburl = {https://dblp.org/rec/series/txtcs/FlumG06.bib},
|
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
|
}
|
|
|