143 lines
5.2 KiB
BibTeX
143 lines
5.2 KiB
BibTeX
@inproceedings{triang-hard,
|
|
author = {Tsvi Kopelowitz and
|
|
Virginia Vassilevska Williams},
|
|
editor = {Artur Czumaj and
|
|
Anuj Dawar and
|
|
Emanuela Merelli},
|
|
title = {Towards Optimal Set-Disjointness and Set-Intersection Data Structures},
|
|
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
|
|
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
|
|
Conference)},
|
|
series = {LIPIcs},
|
|
volume = {168},
|
|
pages = {74:1--74:16},
|
|
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
|
|
year = {2020},
|
|
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.74},
|
|
doi = {10.4230/LIPIcs.ICALP.2020.74},
|
|
timestamp = {Tue, 30 Jun 2020 17:15:44 +0200},
|
|
biburl = {https://dblp.org/rec/conf/icalp/KopelowitzW20.bib},
|
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
|
}
|
|
|
|
@book{arith-complexity,
|
|
author = {Peter B{\"{u}}rgisser and
|
|
Michael Clausen and
|
|
Mohammad Amin Shokrollahi},
|
|
title = {Algebraic complexity theory},
|
|
series = {Grundlehren der mathematischen Wissenschaften},
|
|
volume = {315},
|
|
publisher = {Springer},
|
|
year = {1997},
|
|
isbn = {3-540-60582-7},
|
|
timestamp = {Thu, 31 Jan 2013 18:02:56 +0100},
|
|
biburl = {https://dblp.org/rec/books/daglib/0090316.bib},
|
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
|
}
|
|
|
|
@article{NPRR,
|
|
author = {Hung Q. Ngo and
|
|
Ely Porat and
|
|
Christopher R{\'{e}} and
|
|
Atri Rudra},
|
|
title = {Worst-case Optimal Join Algorithms},
|
|
journal = {J. {ACM}},
|
|
volume = {65},
|
|
number = {3},
|
|
pages = {16:1--16:40},
|
|
year = {2018},
|
|
url = {https://doi.org/10.1145/3180143},
|
|
doi = {10.1145/3180143},
|
|
timestamp = {Wed, 21 Nov 2018 12:44:29 +0100},
|
|
biburl = {https://dblp.org/rec/journals/jacm/NgoPRR18.bib},
|
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
|
}
|
|
|
|
@article{skew,
|
|
author = {Hung Q. Ngo and
|
|
Christopher R{\'{e}} and
|
|
Atri Rudra},
|
|
title = {Skew strikes back: new developments in the theory of join algorithms},
|
|
journal = {{SIGMOD} Rec.},
|
|
volume = {42},
|
|
number = {4},
|
|
pages = {5--16},
|
|
year = {2013},
|
|
url = {https://doi.org/10.1145/2590989.2590991},
|
|
doi = {10.1145/2590989.2590991},
|
|
timestamp = {Fri, 06 Mar 2020 21:55:55 +0100},
|
|
biburl = {https://dblp.org/rec/journals/sigmod/NgoRR13.bib},
|
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
|
}
|
|
|
|
@article{factorized-db,
|
|
author = {Dan Olteanu and
|
|
Maximilian Schleich},
|
|
title = {Factorized Databases},
|
|
journal = {{SIGMOD} Rec.},
|
|
volume = {45},
|
|
number = {2},
|
|
pages = {5--16},
|
|
year = {2016},
|
|
url = {https://doi.org/10.1145/3003665.3003667},
|
|
doi = {10.1145/3003665.3003667},
|
|
timestamp = {Fri, 06 Mar 2020 21:56:19 +0100},
|
|
biburl = {https://dblp.org/rec/journals/sigmod/OlteanuS16.bib},
|
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
|
}
|
|
|
|
@inproceedings{ngo-survey,
|
|
author = {Hung Q. Ngo},
|
|
editor = {Jan Van den Bussche and
|
|
Marcelo Arenas},
|
|
title = {Worst-Case Optimal Join Algorithms: Techniques, Results, and Open
|
|
Problems},
|
|
booktitle = {Proceedings of the 37th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
|
|
of Database Systems, Houston, TX, USA, June 10-15, 2018},
|
|
pages = {111--124},
|
|
publisher = {{ACM}},
|
|
year = {2018},
|
|
url = {https://doi.org/10.1145/3196959.3196990},
|
|
doi = {10.1145/3196959.3196990},
|
|
timestamp = {Wed, 21 Nov 2018 12:44:18 +0100},
|
|
biburl = {https://dblp.org/rec/conf/pods/000118.bib},
|
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
|
}
|
|
|
|
@inproceedings{ajar,
|
|
author = {Manas R. Joglekar and
|
|
Rohan Puttagunta and
|
|
Christopher R{\'{e}}},
|
|
editor = {Tova Milo and
|
|
Wang{-}Chiew Tan},
|
|
title = {{AJAR:} Aggregations and Joins over Annotated Relations},
|
|
booktitle = {Proceedings of the 35th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
|
|
of Database Systems, {PODS} 2016, San Francisco, CA, USA, June 26
|
|
- July 01, 2016},
|
|
pages = {91--106},
|
|
publisher = {{ACM}},
|
|
year = {2016},
|
|
url = {https://doi.org/10.1145/2902251.2902293},
|
|
doi = {10.1145/2902251.2902293},
|
|
timestamp = {Tue, 06 Nov 2018 16:58:02 +0100},
|
|
biburl = {https://dblp.org/rec/conf/pods/JoglekarPR16.bib},
|
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
|
}
|
|
|
|
@article{AGM,
|
|
author = {Albert Atserias and
|
|
Martin Grohe and
|
|
D{\'{a}}niel Marx},
|
|
title = {Size Bounds and Query Plans for Relational Joins},
|
|
journal = {{SIAM} J. Comput.},
|
|
volume = {42},
|
|
number = {4},
|
|
pages = {1737--1767},
|
|
year = {2013},
|
|
url = {https://doi.org/10.1137/110859440},
|
|
doi = {10.1137/110859440},
|
|
timestamp = {Thu, 08 Jun 2017 08:59:24 +0200},
|
|
biburl = {https://dblp.org/rec/journals/siamcomp/AtseriasGM13.bib},
|
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
|
}
|