Tight Fine-Grained Bounds for Direct Access on Join Queries

Author:

Bringmann Karl1,Carmeli Nofar2,Mengel Stefan3

Affiliation:

1. Saarland University & Max Planck Institute for Informatics, Saarbrücken, Germany

2. DI ENS, ENS, CNRS, PSL University & Inria, Paris, France

3. Univ. Artois, CNRS, Centre de Recherche en Informatique de Lens (CRIL), Lens, France

Funder

European Research Council

Agence Nationale de la Recherche

Publisher

ACM

Reference22 articles.

1. More consequences of falsifying SETH and the orthogonal vectors conjecture

2. Amir Abboud , Virginia Vassilevska Williams, and Oren Weimann . 2014 . Con- sequences of Faster Alignment of Sequences. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8--11, 2014, Proceedings, Part I (Lecture Notes in Computer Science), Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.), Vol. 8572 . Springer , 39--51. https://doi.org/10.1007/978--3--662--43948--7_4 10.1007/978--3--662--43948--7_4 Amir Abboud, Virginia Vassilevska Williams, and Oren Weimann. 2014. Con- sequences of Faster Alignment of Sequences. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8--11, 2014, Proceedings, Part I (Lecture Notes in Computer Science), Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.), Vol. 8572. Springer, 39--51. https://doi.org/10.1007/978--3--662--43948--7_4

3. Size Bounds and Query Plans for Relational Joins

4. Arturs Backurs , Nishanth Dikkala , and Christos Tzamos . 2016 . Tight Hardness Results for Maximum Weight Rectangles. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 , July 11 --15 , 2016, Rome, Italy (LIPIcs), Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (Eds.), Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 81:1--81:13. https://doi.org/10.4230/LIPIcs.ICALP.2016.81 10.4230/LIPIcs.ICALP.2016.81 Arturs Backurs, Nishanth Dikkala, and Christos Tzamos. 2016. Tight Hardness Results for Maximum Weight Rectangles. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11--15, 2016, Rome, Italy (LIPIcs), Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (Eds.), Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 81:1--81:13. https://doi.org/10.4230/LIPIcs.ICALP.2016.81

5. Arturs Backurs and Christos Tzamos . 2017 . Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms . In Proceedings of the 34th International Conference on Machine Learning, ICML 2017 , Sydney, NSW, Australia, 6- -11 August 2017 (Proceedings of Machine Learning Research), Doina Precup and Yee Whye Teh (Eds.), Vol. 70 . PMLR, 311--321. http://proceedings.mlr.press/v70/backurs17a.html Arturs Backurs and Christos Tzamos. 2017. Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. In Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6--11 August 2017 (Proceedings of Machine Learning Research), Doina Precup and Yee Whye Teh (Eds.), Vol. 70. PMLR, 311--321. http://proceedings.mlr.press/v70/backurs17a.html

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3