607 lines
23 KiB
BibTeX
607 lines
23 KiB
BibTeX
%%% -*-BibTeX-*-
|
||
%%% Do NOT edit. File created by BibTeX with style
|
||
%%% ACM-Reference-Format-Journals [18-Jan-2012].
|
||
|
||
\begin{thebibliography}{50}
|
||
|
||
%%% ====================================================================
|
||
%%% NOTE TO THE USER: you can override these defaults by providing
|
||
%%% customized versions of any of these macros before the \bibliography
|
||
%%% command. Each of them MUST provide its own final punctuation,
|
||
%%% except for \shownote{}, \showDOI{}, and \showURL{}. The latter two
|
||
%%% do not use final punctuation, in order to avoid confusing it with
|
||
%%% the Web address.
|
||
%%%
|
||
%%% To suppress output of a particular field, define its macro to expand
|
||
%%% to an empty string, or better, \unskip, like this:
|
||
%%%
|
||
%%% \newcommand{\showDOI}[1]{\unskip} % LaTeX syntax
|
||
%%%
|
||
%%% \def \showDOI #1{\unskip} % plain TeX syntax
|
||
%%%
|
||
%%% ====================================================================
|
||
|
||
\ifx \showCODEN \undefined \def \showCODEN #1{\unskip} \fi
|
||
\ifx \showDOI \undefined \def \showDOI #1{#1}\fi
|
||
\ifx \showISBNx \undefined \def \showISBNx #1{\unskip} \fi
|
||
\ifx \showISBNxiii \undefined \def \showISBNxiii #1{\unskip} \fi
|
||
\ifx \showISSN \undefined \def \showISSN #1{\unskip} \fi
|
||
\ifx \showLCCN \undefined \def \showLCCN #1{\unskip} \fi
|
||
\ifx \shownote \undefined \def \shownote #1{#1} \fi
|
||
\ifx \showarticletitle \undefined \def \showarticletitle #1{#1} \fi
|
||
\ifx \showURL \undefined \def \showURL {\relax} \fi
|
||
% The following commands are used for tagged output and should be
|
||
% invisible to TeX
|
||
\providecommand\bibfield[2]{#2}
|
||
\providecommand\bibinfo[2]{#2}
|
||
\providecommand\natexlab[1]{#1}
|
||
\providecommand\showeprint[2][]{arXiv:#2}
|
||
|
||
\bibitem[Agrawal et~al\mbox{.}(2006)]%
|
||
{DBLP:conf/vldb/AgrawalBSHNSW06}
|
||
\bibfield{author}{\bibinfo{person}{Parag Agrawal}, \bibinfo{person}{Omar
|
||
Benjelloun}, \bibinfo{person}{Anish~Das Sarma}, \bibinfo{person}{Chris
|
||
Hayworth}, \bibinfo{person}{Shubha~U. Nabar}, \bibinfo{person}{Tomoe
|
||
Sugihara}, {and} \bibinfo{person}{Jennifer Widom}.}
|
||
\bibinfo{year}{2006}\natexlab{}.
|
||
\newblock \showarticletitle{Trio: A System for Data, Uncertainty, and Lineage}.
|
||
In \bibinfo{booktitle}{\emph{VLDB}}. \bibinfo{pages}{1151--1154}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Amarilli et~al\mbox{.}(2015)]%
|
||
{AB15}
|
||
\bibfield{author}{\bibinfo{person}{Antoine Amarilli}, \bibinfo{person}{Pierre
|
||
Bourhis}, {and} \bibinfo{person}{Pierre Senellart}.}
|
||
\bibinfo{year}{2015}\natexlab{}.
|
||
\newblock \showarticletitle{Probabilities and provenance via tree
|
||
decompositions}.
|
||
\newblock \bibinfo{journal}{\emph{PODS}} (\bibinfo{year}{2015}).
|
||
\newblock
|
||
|
||
|
||
\bibitem[Amsterdamer et~al\mbox{.}(2011)]%
|
||
{AD11d}
|
||
\bibfield{author}{\bibinfo{person}{Yael Amsterdamer}, \bibinfo{person}{Daniel
|
||
Deutch}, {and} \bibinfo{person}{Val Tannen}.}
|
||
\bibinfo{year}{2011}\natexlab{}.
|
||
\newblock \showarticletitle{Provenance for Aggregate Queries}. In
|
||
\bibinfo{booktitle}{\emph{PODS}}. \bibinfo{pages}{153--164}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Antova et~al\mbox{.}(2008)]%
|
||
{4497507}
|
||
\bibfield{author}{\bibinfo{person}{Lyublena Antova}, \bibinfo{person}{Thomas
|
||
Jansen}, \bibinfo{person}{Christoph Koch}, {and} \bibinfo{person}{Dan
|
||
Olteanu}.} \bibinfo{year}{2008}\natexlab{}.
|
||
\newblock \showarticletitle{Fast and Simple Relational Processing of Uncertain
|
||
Data}. In \bibinfo{booktitle}{\emph{2008 IEEE 24th International Conference
|
||
on Data Engineering}}. \bibinfo{pages}{983--992}.
|
||
\newblock
|
||
\urldef\tempurl%
|
||
\url{https://doi.org/10.1109/ICDE.2008.4497507}
|
||
\showDOI{\tempurl}
|
||
|
||
|
||
\bibitem[Atserias et~al\mbox{.}(2013)]%
|
||
{AGM}
|
||
\bibfield{author}{\bibinfo{person}{Albert Atserias}, \bibinfo{person}{Martin
|
||
Grohe}, {and} \bibinfo{person}{D{\'{a}}niel Marx}.}
|
||
\bibinfo{year}{2013}\natexlab{}.
|
||
\newblock \showarticletitle{Size Bounds and Query Plans for Relational Joins}.
|
||
\newblock \bibinfo{journal}{\emph{{SIAM} J. Comput.}} \bibinfo{volume}{42},
|
||
\bibinfo{number}{4} (\bibinfo{year}{2013}), \bibinfo{pages}{1737--1767}.
|
||
\newblock
|
||
\urldef\tempurl%
|
||
\url{https://doi.org/10.1137/110859440}
|
||
\showDOI{\tempurl}
|
||
|
||
|
||
\bibitem[Bahar et~al\mbox{.}(1993)]%
|
||
{bahar-93-al}
|
||
\bibfield{author}{\bibinfo{person}{R.~Iris Bahar}, \bibinfo{person}{Erica~A.
|
||
Frohm}, \bibinfo{person}{Charles~M. Gaona}, \bibinfo{person}{Gary~D.
|
||
Hachtel}, \bibinfo{person}{Enrico Macii}, \bibinfo{person}{Abelardo Pardo},
|
||
{and} \bibinfo{person}{Fabio Somenzi}.} \bibinfo{year}{1993}\natexlab{}.
|
||
\newblock \showarticletitle{Algebraic Decision Diagrams and Their
|
||
Applications}. In \bibinfo{booktitle}{\emph{IEEE CAD}}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Beskales et~al\mbox{.}(2010)]%
|
||
{DBLP:journals/pvldb/BeskalesIG10}
|
||
\bibfield{author}{\bibinfo{person}{George Beskales}, \bibinfo{person}{Ihab~F.
|
||
Ilyas}, {and} \bibinfo{person}{Lukasz Golab}.}
|
||
\bibinfo{year}{2010}\natexlab{}.
|
||
\newblock \showarticletitle{Sampling the Repairs of Functional Dependency
|
||
Violations under Hard Constraints}.
|
||
\newblock \bibinfo{journal}{\emph{Proc. {VLDB} Endow.}} \bibinfo{volume}{3},
|
||
\bibinfo{number}{1} (\bibinfo{year}{2010}), \bibinfo{pages}{197--207}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Bürgisser et~al\mbox{.}(1997)]%
|
||
{arith-complexity}
|
||
\bibfield{author}{\bibinfo{person}{Peter Bürgisser}, \bibinfo{person}{Michael
|
||
Clausen}, {and} \bibinfo{person}{Mohammad~Amin Shokrollahi}.}
|
||
\bibinfo{year}{1997}\natexlab{}.
|
||
\newblock \bibinfo{booktitle}{\emph{Algebraic complexity theory}}.
|
||
Vol.~\bibinfo{volume}{315}.
|
||
\newblock \bibinfo{publisher}{Springer}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Chen and Grohe(2010)]%
|
||
{chen-10-cswssr}
|
||
\bibfield{author}{\bibinfo{person}{Hubie Chen} {and} \bibinfo{person}{Martin
|
||
Grohe}.} \bibinfo{year}{2010}\natexlab{}.
|
||
\newblock \showarticletitle{Constraint Satisfaction With Succinctly Specified
|
||
Relations}.
|
||
\newblock \bibinfo{journal}{\emph{J. Comput. Syst. Sci.}} \bibinfo{volume}{76},
|
||
\bibinfo{number}{8} (\bibinfo{year}{2010}), \bibinfo{pages}{847--860}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Chen et~al\mbox{.}(2006)]%
|
||
{CHEN20061346}
|
||
\bibfield{author}{\bibinfo{person}{Jianer Chen}, \bibinfo{person}{Xiuzhen
|
||
Huang}, \bibinfo{person}{Iyad~A. Kanj}, {and} \bibinfo{person}{Ge Xia}.}
|
||
\bibinfo{year}{2006}\natexlab{}.
|
||
\newblock \showarticletitle{Strong computational lower bounds via parameterized
|
||
complexity}.
|
||
\newblock \bibinfo{journal}{\emph{J. Comput. System Sci.}}
|
||
\bibinfo{volume}{72}, \bibinfo{number}{8} (\bibinfo{year}{2006}),
|
||
\bibinfo{pages}{1346--1367}.
|
||
\newblock
|
||
\showISSN{0022-0000}
|
||
\urldef\tempurl%
|
||
\url{https://doi.org/10.1016/j.jcss.2006.04.007}
|
||
\showDOI{\tempurl}
|
||
|
||
|
||
\bibitem[Curticapean(2013)]%
|
||
{k-match}
|
||
\bibfield{author}{\bibinfo{person}{Radu Curticapean}.}
|
||
\bibinfo{year}{2013}\natexlab{}.
|
||
\newblock \showarticletitle{Counting Matchings of Size k Is W[1]-Hard}. In
|
||
\bibinfo{booktitle}{\emph{ICALP}}, Vol.~\bibinfo{volume}{7965}.
|
||
\bibinfo{pages}{352--363}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Curticapean and Marx(2014)]%
|
||
{10.1109/FOCS.2014.22}
|
||
\bibfield{author}{\bibinfo{person}{Radu Curticapean} {and}
|
||
\bibinfo{person}{D\'{a}niel Marx}.} \bibinfo{year}{2014}\natexlab{}.
|
||
\newblock \showarticletitle{Complexity of Counting Subgraphs: Only the
|
||
Boundedness of the Vertex-Cover Number Counts}. In
|
||
\bibinfo{booktitle}{\emph{Proceedings of the 2014 IEEE 55th Annual Symposium
|
||
on Foundations of Computer Science}} \emph{(\bibinfo{series}{FOCS '14})}.
|
||
\bibinfo{publisher}{IEEE Computer Society}, \bibinfo{address}{USA},
|
||
\bibinfo{pages}{130–139}.
|
||
\newblock
|
||
\showISBNx{9781479965175}
|
||
\urldef\tempurl%
|
||
\url{https://doi.org/10.1109/FOCS.2014.22}
|
||
\showDOI{\tempurl}
|
||
|
||
|
||
\bibitem[Dalvi and Suciu(2007a)]%
|
||
{10.1145/1265530.1265571}
|
||
\bibfield{author}{\bibinfo{person}{Nilesh Dalvi} {and} \bibinfo{person}{Dan
|
||
Suciu}.} \bibinfo{year}{2007}\natexlab{a}.
|
||
\newblock \showarticletitle{The Dichotomy of Conjunctive Queries on
|
||
Probabilistic Structures}. In \bibinfo{booktitle}{\emph{PODS}}.
|
||
\bibinfo{pages}{293--302}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Dalvi and Suciu(2007b)]%
|
||
{DS07}
|
||
\bibfield{author}{\bibinfo{person}{N. Dalvi} {and} \bibinfo{person}{D. Suciu}.}
|
||
\bibinfo{year}{2007}\natexlab{b}.
|
||
\newblock \showarticletitle{Efficient query evaluation on probabilistic
|
||
databases}.
|
||
\newblock \bibinfo{journal}{\emph{VLDB}} \bibinfo{volume}{16},
|
||
\bibinfo{number}{4} (\bibinfo{year}{2007}), \bibinfo{pages}{544}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Dalvi and Suciu(2012)]%
|
||
{DS12}
|
||
\bibfield{author}{\bibinfo{person}{Nilesh Dalvi} {and} \bibinfo{person}{Dan
|
||
Suciu}.} \bibinfo{year}{2012}\natexlab{}.
|
||
\newblock \showarticletitle{The dichotomy of probabilistic inference for unions
|
||
of conjunctive queries}.
|
||
\newblock \bibinfo{journal}{\emph{JACM}} \bibinfo{volume}{59},
|
||
\bibinfo{number}{6} (\bibinfo{year}{2012}), \bibinfo{pages}{30}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[den Heuvel et~al\mbox{.}(2019)]%
|
||
{heuvel-19-anappdsd}
|
||
\bibfield{author}{\bibinfo{person}{Maarten~Van den Heuvel},
|
||
\bibinfo{person}{Peter Ivanov}, \bibinfo{person}{Wolfgang Gatterbauer},
|
||
\bibinfo{person}{Floris Geerts}, {and} \bibinfo{person}{Martin Theobald}.}
|
||
\bibinfo{year}{2019}\natexlab{}.
|
||
\newblock \showarticletitle{Anytime Approximation in Probabilistic Databases
|
||
via Scaled Dissociations}. In \bibinfo{booktitle}{\emph{SIGMOD}}.
|
||
\bibinfo{pages}{1295--1312}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Deutch et~al\mbox{.}(2014)]%
|
||
{DM14c}
|
||
\bibfield{author}{\bibinfo{person}{Daniel Deutch}, \bibinfo{person}{Tova Milo},
|
||
\bibinfo{person}{Sudeepa Roy}, {and} \bibinfo{person}{Val Tannen}.}
|
||
\bibinfo{year}{2014}\natexlab{}.
|
||
\newblock \showarticletitle{Circuits for Datalog Provenance}. In
|
||
\bibinfo{booktitle}{\emph{ICDT}}. \bibinfo{pages}{201--212}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Feng et~al\mbox{.}(2021)]%
|
||
{feng:2021:sigmod:efficient}
|
||
\bibfield{author}{\bibinfo{person}{Su Feng}, \bibinfo{person}{Boris Glavic},
|
||
\bibinfo{person}{Aaron Huber}, {and} \bibinfo{person}{Oliver Kennedy}.}
|
||
\bibinfo{year}{2021}\natexlab{}.
|
||
\newblock \showarticletitle{Efficient Uncertainty Tracking for Complex Queries
|
||
with Attribute-level Bounds}. In \bibinfo{booktitle}{\emph{SIGMOD}}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Feng et~al\mbox{.}(2019)]%
|
||
{feng:2019:sigmod:uncertainty}
|
||
\bibfield{author}{\bibinfo{person}{Su Feng}, \bibinfo{person}{Aaron Huber},
|
||
\bibinfo{person}{Boris Glavic}, {and} \bibinfo{person}{Oliver Kennedy}.}
|
||
\bibinfo{year}{2019}\natexlab{}.
|
||
\newblock \showarticletitle{Uncertainty Annotated Databases - A Lightweight
|
||
Approach for Approximating Certain Answers}. In
|
||
\bibinfo{booktitle}{\emph{SIGMOD}}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Fink et~al\mbox{.}(2012)]%
|
||
{FH12}
|
||
\bibfield{author}{\bibinfo{person}{Robert Fink}, \bibinfo{person}{Larisa Han},
|
||
{and} \bibinfo{person}{Dan Olteanu}.} \bibinfo{year}{2012}\natexlab{}.
|
||
\newblock \showarticletitle{Aggregation in probabilistic databases via
|
||
knowledge compilation}.
|
||
\newblock \bibinfo{journal}{\emph{PVLDB}} \bibinfo{volume}{5},
|
||
\bibinfo{number}{5} (\bibinfo{year}{2012}), \bibinfo{pages}{490--501}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Fink et~al\mbox{.}(2013)]%
|
||
{FH13}
|
||
\bibfield{author}{\bibinfo{person}{Robert Fink}, \bibinfo{person}{Jiewen
|
||
Huang}, {and} \bibinfo{person}{Dan Olteanu}.}
|
||
\bibinfo{year}{2013}\natexlab{}.
|
||
\newblock \showarticletitle{Anytime approximation in probabilistic databases}.
|
||
\newblock \bibinfo{journal}{\emph{VLDBJ}} \bibinfo{volume}{22},
|
||
\bibinfo{number}{6} (\bibinfo{year}{2013}), \bibinfo{pages}{823--848}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Fink and Olteanu(2016)]%
|
||
{FO16}
|
||
\bibfield{author}{\bibinfo{person}{Robert Fink} {and} \bibinfo{person}{Dan
|
||
Olteanu}.} \bibinfo{year}{2016}\natexlab{}.
|
||
\newblock \showarticletitle{Dichotomies for Queries with Negation in
|
||
Probabilistic Databases}.
|
||
\newblock \bibinfo{journal}{\emph{TODS}} \bibinfo{volume}{41},
|
||
\bibinfo{number}{1} (\bibinfo{year}{2016}), \bibinfo{pages}{4:1--4:47}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Flum and Grohe(2002)]%
|
||
{10.5555/645413.652181}
|
||
\bibfield{author}{\bibinfo{person}{J\"{o}rg Flum} {and} \bibinfo{person}{Martin
|
||
Grohe}.} \bibinfo{year}{2002}\natexlab{}.
|
||
\newblock \showarticletitle{The Parameterized Complexity of Counting Problems}.
|
||
In \bibinfo{booktitle}{\emph{Proceedings of the 43rd Symposium on Foundations
|
||
of Computer Science}} \emph{(\bibinfo{series}{FOCS '02})}.
|
||
\bibinfo{publisher}{IEEE Computer Society}, \bibinfo{address}{USA},
|
||
\bibinfo{pages}{538}.
|
||
\newblock
|
||
\showISBNx{0769518222}
|
||
|
||
|
||
\bibitem[Flum and Grohe(2006)]%
|
||
{param-comp}
|
||
\bibfield{author}{\bibinfo{person}{J{\"o}rg Flum} {and} \bibinfo{person}{Martin
|
||
Grohe}.} \bibinfo{year}{2006}\natexlab{}.
|
||
\newblock \showarticletitle{Parameterized Complexity Theory}. In
|
||
\bibinfo{booktitle}{\emph{Texts in Theoretical Computer Science. An EATCS
|
||
Series}}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Garcia{-}Molina et~al\mbox{.}(2009)]%
|
||
{DBLP:books/daglib/0020812}
|
||
\bibfield{author}{\bibinfo{person}{Hector Garcia{-}Molina},
|
||
\bibinfo{person}{Jeffrey~D. Ullman}, {and} \bibinfo{person}{Jennifer Widom}.}
|
||
\bibinfo{year}{2009}\natexlab{}.
|
||
\newblock \bibinfo{booktitle}{\emph{Database Systems - The Complete Book {(2.}
|
||
ed.)}}.
|
||
\newblock \bibinfo{publisher}{Pearson Education}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Green et~al\mbox{.}(2007)]%
|
||
{DBLP:conf/pods/GreenKT07}
|
||
\bibfield{author}{\bibinfo{person}{Todd~J. Green}, \bibinfo{person}{Gregory
|
||
Karvounarakis}, {and} \bibinfo{person}{Val Tannen}.}
|
||
\bibinfo{year}{2007}\natexlab{}.
|
||
\newblock \showarticletitle{Provenance semirings}. In
|
||
\bibinfo{booktitle}{\emph{PODS}}. \bibinfo{pages}{31--40}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Green and Tannen(2006)]%
|
||
{GT06}
|
||
\bibfield{author}{\bibinfo{person}{Todd~J Green} {and} \bibinfo{person}{Val
|
||
Tannen}.} \bibinfo{year}{2006}\natexlab{}.
|
||
\newblock \showarticletitle{Models for incomplete and probabilistic
|
||
information}.
|
||
\newblock In \bibinfo{booktitle}{\emph{EDBT}}. \bibinfo{pages}{278--296}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Grohe et~al\mbox{.}(2022)]%
|
||
{https://doi.org/10.48550/arxiv.2201.11524}
|
||
\bibfield{author}{\bibinfo{person}{Martin Grohe}, \bibinfo{person}{Peter
|
||
Lindner}, {and} \bibinfo{person}{Christoph Standke}.}
|
||
\bibinfo{year}{2022}\natexlab{}.
|
||
\newblock \bibinfo{title}{Probabilistic Query Evaluation with Bag Semantics}.
|
||
\newblock
|
||
\newblock
|
||
\urldef\tempurl%
|
||
\url{https://doi.org/10.48550/ARXIV.2201.11524}
|
||
\showDOI{\tempurl}
|
||
|
||
|
||
\bibitem[Imieli\'nski and Lipski~Jr(1984)]%
|
||
{IL84a}
|
||
\bibfield{author}{\bibinfo{person}{Tomasz Imieli\'nski} {and}
|
||
\bibinfo{person}{Witold Lipski~Jr}.} \bibinfo{year}{1984}\natexlab{}.
|
||
\newblock \showarticletitle{Incomplete Information in Relational Databases}.
|
||
\newblock \bibinfo{journal}{\emph{JACM}} \bibinfo{volume}{31},
|
||
\bibinfo{number}{4} (\bibinfo{year}{1984}), \bibinfo{pages}{761--791}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Jha and Suciu(2012)]%
|
||
{jha-12-pdwm}
|
||
\bibfield{author}{\bibinfo{person}{Abhay~Kumar Jha} {and} \bibinfo{person}{Dan
|
||
Suciu}.} \bibinfo{year}{2012}\natexlab{}.
|
||
\newblock \showarticletitle{Probabilistic Databases With Markoviews}.
|
||
\newblock \bibinfo{journal}{\emph{PVLDB}} \bibinfo{volume}{5},
|
||
\bibinfo{number}{11} (\bibinfo{year}{2012}), \bibinfo{pages}{1160--1171}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Karp et~al\mbox{.}(1989)]%
|
||
{DBLP:journals/jal/KarpLM89}
|
||
\bibfield{author}{\bibinfo{person}{Richard~M. Karp}, \bibinfo{person}{Michael
|
||
Luby}, {and} \bibinfo{person}{Neal Madras}.} \bibinfo{year}{1989}\natexlab{}.
|
||
\newblock \showarticletitle{Monte-Carlo Approximation Algorithms for
|
||
Enumeration Problems}.
|
||
\newblock \bibinfo{journal}{\emph{J. Algorithms}} \bibinfo{volume}{10},
|
||
\bibinfo{number}{3} (\bibinfo{year}{1989}), \bibinfo{pages}{429--448}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Kenig et~al\mbox{.}(2013)]%
|
||
{kenig-13-nclexpdc}
|
||
\bibfield{author}{\bibinfo{person}{Batya Kenig}, \bibinfo{person}{Avigdor Gal},
|
||
{and} \bibinfo{person}{Ofer Strichman}.} \bibinfo{year}{2013}\natexlab{}.
|
||
\newblock \showarticletitle{A New Class of Lineage Expressions over
|
||
Probabilistic Databases Computable in P-Time}. In
|
||
\bibinfo{booktitle}{\emph{SUM}}, Vol.~\bibinfo{volume}{8078}.
|
||
\bibinfo{pages}{219--232}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Khamis et~al\mbox{.}(2016)]%
|
||
{DBLP:conf/pods/KhamisNR16}
|
||
\bibfield{author}{\bibinfo{person}{Mahmoud~Abo Khamis},
|
||
\bibinfo{person}{Hung~Q. Ngo}, {and} \bibinfo{person}{Atri Rudra}.}
|
||
\bibinfo{year}{2016}\natexlab{}.
|
||
\newblock \showarticletitle{FAQ: Questions Asked Frequently}. In
|
||
\bibinfo{booktitle}{\emph{PODS}}. \bibinfo{pages}{13--28}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Kopelowitz and Williams(2020)]%
|
||
{triang-hard}
|
||
\bibfield{author}{\bibinfo{person}{Tsvi Kopelowitz} {and}
|
||
\bibinfo{person}{Virginia~Vassilevska Williams}.}
|
||
\bibinfo{year}{2020}\natexlab{}.
|
||
\newblock \showarticletitle{Towards Optimal Set-Disjointness and
|
||
Set-Intersection Data Structures}. In \bibinfo{booktitle}{\emph{ICALP}},
|
||
Vol.~\bibinfo{volume}{168}. \bibinfo{pages}{74:1--74:16}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Kumari et~al\mbox{.}(2016)]%
|
||
{kumari:2016:qdb:communicating}
|
||
\bibfield{author}{\bibinfo{person}{Poonam Kumari}, \bibinfo{person}{Said
|
||
Achmiz}, {and} \bibinfo{person}{Oliver Kennedy}.}
|
||
\bibinfo{year}{2016}\natexlab{}.
|
||
\newblock \showarticletitle{Communicating Data Quality in On-Demand Curation}.
|
||
In \bibinfo{booktitle}{\emph{QDB}}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Ngo(2018)]%
|
||
{ngo-survey}
|
||
\bibfield{author}{\bibinfo{person}{Hung~Q. Ngo}.}
|
||
\bibinfo{year}{2018}\natexlab{}.
|
||
\newblock \showarticletitle{Worst-Case Optimal Join Algorithms: Techniques,
|
||
Results, and Open Problems}. In \bibinfo{booktitle}{\emph{PODS}}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Ngo et~al\mbox{.}(2013)]%
|
||
{skew}
|
||
\bibfield{author}{\bibinfo{person}{Hung~Q. Ngo}, \bibinfo{person}{Christopher
|
||
Ré}, {and} \bibinfo{person}{Atri Rudra}.} \bibinfo{year}{2013}\natexlab{}.
|
||
\newblock \showarticletitle{Skew strikes back: new developments in the theory
|
||
of join algorithms}.
|
||
\newblock \bibinfo{journal}{\emph{SIGMOD Rec.}} \bibinfo{volume}{42},
|
||
\bibinfo{number}{4} (\bibinfo{year}{2013}), \bibinfo{pages}{5--16}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Olteanu et~al\mbox{.}(2010)]%
|
||
{DBLP:conf/icde/OlteanuHK10}
|
||
\bibfield{author}{\bibinfo{person}{Dan Olteanu}, \bibinfo{person}{Jiewen
|
||
Huang}, {and} \bibinfo{person}{Christoph Koch}.}
|
||
\bibinfo{year}{2010}\natexlab{}.
|
||
\newblock \showarticletitle{Approximate confidence computation in probabilistic
|
||
databases}. In \bibinfo{booktitle}{\emph{ICDE}}. \bibinfo{pages}{145--156}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Olteanu and Schleich(2016)]%
|
||
{factorized-db}
|
||
\bibfield{author}{\bibinfo{person}{Dan Olteanu} {and}
|
||
\bibinfo{person}{Maximilian Schleich}.} \bibinfo{year}{2016}\natexlab{}.
|
||
\newblock \showarticletitle{Factorized Databases}.
|
||
\newblock \bibinfo{journal}{\emph{SIGMOD Rec.}} \bibinfo{volume}{45},
|
||
\bibinfo{number}{2} (\bibinfo{year}{2016}), \bibinfo{pages}{5--16}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[pdbench utility(2008)]%
|
||
{pdbench}
|
||
pdbench utility \bibinfo{year}{2008}\natexlab{}.
|
||
\newblock \bibinfo{title}{pdbench}.
|
||
\newblock
|
||
\newblock
|
||
\urldef\tempurl%
|
||
\url{http://pdbench.sourceforge.net/}
|
||
\showURL{%
|
||
\tempurl}
|
||
\newblock
|
||
\shownote{Accessed: 2020-12-15}.
|
||
|
||
|
||
\bibitem[Rekatsinas et~al\mbox{.}(2017)]%
|
||
{DBLP:journals/pvldb/RekatsinasCIR17}
|
||
\bibfield{author}{\bibinfo{person}{Theodoros Rekatsinas}, \bibinfo{person}{Xu
|
||
Chu}, \bibinfo{person}{Ihab~F. Ilyas}, {and} \bibinfo{person}{Christopher
|
||
R{\'{e}}}.} \bibinfo{year}{2017}\natexlab{}.
|
||
\newblock \showarticletitle{HoloClean: Holistic Data Repairs with Probabilistic
|
||
Inference}.
|
||
\newblock \bibinfo{journal}{\emph{Proc. {VLDB} Endow.}} \bibinfo{volume}{10},
|
||
\bibinfo{number}{11} (\bibinfo{year}{2017}), \bibinfo{pages}{1190--1201}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Roy et~al\mbox{.}(2011)]%
|
||
{roy-11-f}
|
||
\bibfield{author}{\bibinfo{person}{Sudeepa Roy}, \bibinfo{person}{Vittorio
|
||
Perduca}, {and} \bibinfo{person}{Val Tannen}.}
|
||
\bibinfo{year}{2011}\natexlab{}.
|
||
\newblock \showarticletitle{Faster query answering in probabilistic databases
|
||
using read-once functions}. In \bibinfo{booktitle}{\emph{ICDT}}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Ré and Suciu(2007)]%
|
||
{RS07}
|
||
\bibfield{author}{\bibinfo{person}{C. Ré} {and} \bibinfo{person}{D. Suciu}.}
|
||
\bibinfo{year}{2007}\natexlab{}.
|
||
\newblock \showarticletitle{Materialized views in probabilistic databases: for
|
||
information exchange and query optimization}. In
|
||
\bibinfo{booktitle}{\emph{VLDB}}. \bibinfo{pages}{51--62}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Sa et~al\mbox{.}(2017)]%
|
||
{DBLP:journals/vldb/SaRR0W0Z17}
|
||
\bibfield{author}{\bibinfo{person}{Christopher~De Sa},
|
||
\bibinfo{person}{Alexander Ratner}, \bibinfo{person}{Christopher R{\'{e}}},
|
||
\bibinfo{person}{Jaeho Shin}, \bibinfo{person}{Feiran Wang},
|
||
\bibinfo{person}{Sen Wu}, {and} \bibinfo{person}{Ce Zhang}.}
|
||
\bibinfo{year}{2017}\natexlab{}.
|
||
\newblock \showarticletitle{Incremental knowledge base construction using
|
||
DeepDive}.
|
||
\newblock \bibinfo{journal}{\emph{{VLDB} J.}} \bibinfo{volume}{26},
|
||
\bibinfo{number}{1} (\bibinfo{year}{2017}), \bibinfo{pages}{81--105}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Sen et~al\mbox{.}(2010)]%
|
||
{sen-10-ronfqevpd}
|
||
\bibfield{author}{\bibinfo{person}{Prithviraj Sen}, \bibinfo{person}{Amol
|
||
Deshpande}, {and} \bibinfo{person}{Lise Getoor}.}
|
||
\bibinfo{year}{2010}\natexlab{}.
|
||
\newblock \showarticletitle{Read-Once Functions and Query Evaluation in
|
||
Probabilistic Databases}.
|
||
\newblock \bibinfo{journal}{\emph{PVLDB}} \bibinfo{volume}{3},
|
||
\bibinfo{number}{1} (\bibinfo{year}{2010}), \bibinfo{pages}{1068--1079}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Senellart(2018)]%
|
||
{S18a}
|
||
\bibfield{author}{\bibinfo{person}{Pierre Senellart}.}
|
||
\bibinfo{year}{2018}\natexlab{}.
|
||
\newblock \showarticletitle{Provenance and Probabilities in Relational
|
||
Databases}.
|
||
\newblock \bibinfo{journal}{\emph{SIGMOD Record}} \bibinfo{volume}{46},
|
||
\bibinfo{number}{4} (\bibinfo{year}{2018}), \bibinfo{pages}{5--15}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Valiant(1979)]%
|
||
{valiant-79-cenrp}
|
||
\bibfield{author}{\bibinfo{person}{Leslie~G. Valiant}.}
|
||
\bibinfo{year}{1979}\natexlab{}.
|
||
\newblock \showarticletitle{The Complexity of Enumeration and Reliability
|
||
Problems}.
|
||
\newblock \bibinfo{journal}{\emph{SIAM J. Comput.}} \bibinfo{volume}{8},
|
||
\bibinfo{number}{3} (\bibinfo{year}{1979}), \bibinfo{pages}{410--421}.
|
||
\newblock
|
||
|
||
|
||
\bibitem[Van~den Broeck and Suciu(2017)]%
|
||
{VS17}
|
||
\bibfield{author}{\bibinfo{person}{Guy Van~den Broeck} {and}
|
||
\bibinfo{person}{Dan Suciu}.} \bibinfo{year}{2017}\natexlab{}.
|
||
\newblock \showarticletitle{Query Processing on Probabilistic Data: A Survey}.
|
||
\newblock (\bibinfo{year}{2017}).
|
||
\newblock
|
||
|
||
|
||
\bibitem[Williams(2018)]%
|
||
{virgi-survey}
|
||
\bibfield{author}{\bibinfo{person}{Virginia~Vassilevska Williams}.}
|
||
\bibinfo{year}{2018}\natexlab{}.
|
||
\newblock \showarticletitle{Some Open Problems in Fine-Grained Complexity}.
|
||
\newblock \bibinfo{journal}{\emph{{SIGACT} News}} \bibinfo{volume}{49},
|
||
\bibinfo{number}{4} (\bibinfo{year}{2018}), \bibinfo{pages}{29--35}.
|
||
\newblock
|
||
\urldef\tempurl%
|
||
\url{https://doi.org/10.1145/3300150.3300158}
|
||
\showDOI{\tempurl}
|
||
|
||
|
||
\bibitem[Yang et~al\mbox{.}(2015)]%
|
||
{yang:2015:pvldb:lenses}
|
||
\bibfield{author}{\bibinfo{person}{Ying Yang}, \bibinfo{person}{Niccolò
|
||
Meneghetti}, \bibinfo{person}{Ronny Fehling}, \bibinfo{person}{Zhen~Hua Liu},
|
||
\bibinfo{person}{Dieter Gawlick}, {and} \bibinfo{person}{Oliver Kennedy}.}
|
||
\bibinfo{year}{2015}\natexlab{}.
|
||
\newblock \showarticletitle{Lenses: An On-Demand Approach to ETL}.
|
||
\newblock \bibinfo{journal}{\emph{PVLDB}} \bibinfo{volume}{8},
|
||
\bibinfo{number}{12} (\bibinfo{year}{2015}), \bibinfo{pages}{1578--1589}.
|
||
\newblock
|
||
|
||
|
||
\end{thebibliography}
|