Document Open Access Logo

The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems

Authors Austen Z. Fan , Paraschos Koutris , Hangdong Zhao

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2023.127.pdf
  • Filesize: 0.83 MB
  • 20 pages

Document Identifiers

Author Details

Austen Z. Fan
  • Department of Computer Sciences, University of Wisconsin-Madison, WI, USA
Paraschos Koutris
  • Department of Computer Sciences, University of Wisconsin-Madison, WI, USA
Hangdong Zhao
  • Department of Computer Sciences, University of Wisconsin-Madison, WI, USA

Funding

NSF IIS-1910014.

Cite As Get BibTex

Austen Z. Fan, Paraschos Koutris, and Hangdong Zhao. The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 127:1-127:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.ICALP.2023.127

Abstract

We study the fine-grained complexity of evaluating Boolean Conjunctive Queries and their generalization to sum-of-product problems over an arbitrary semiring. For these problems, we present a general semiring-oblivious reduction from the k-clique problem to any query structure (hypergraph). Our reduction uses the notion of embedding a graph to a hypergraph, first introduced by Marx [Dániel Marx, 2013]. As a consequence of our reduction, we can show tight conditional lower bounds for many classes of hypergraphs, including cycles, Loomis-Whitney joins, some bipartite graphs, and chordal graphs. These lower bounds have a dependence on what we call the clique embedding power of a hypergraph H, which we believe is a quantity of independent interest. We show that the clique embedding power is always less than the submodular width of the hypergraph, and present a decidable algorithm for computing it. We conclude with many open problems for future research.

Subject Classification

ACM Subject Classification
  • Theory of computation → Database theory
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • Fine-grained complexity
  • conjunctive queries
  • semiring-oblivious reduction

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams. If the current clique algorithms are optimal, so is Valiant’s parser. In FOCS, pages 98-117. IEEE Computer Society, 2015. Google Scholar
  2. Noga Alon, Raphael Yuster, and Uri Zwick. Finding and counting given length cycles. Algorithmica, 17(3):209-223, 1997. Google Scholar
  3. Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. On acyclic conjunctive queries and constant delay enumeration. In CSL, volume 4646 of Lecture Notes in Computer Science, pages 208-222. Springer, 2007. Google Scholar
  4. Karl Bringmann and Nofar Carmeli. Unbalanced triangle detection and enumeration hardness for unions of conjunctive queries. CoRR, abs/2210.11996, 2022. URL: https://arxiv.org/abs/2210.11996.
  5. Nofar Carmeli, Batya Kenig, Benny Kimelfeld, and Markus Kröll. Efficiently enumerating minimal triangulations. Discret. Appl. Math., 303:216-236, 2021. Google Scholar
  6. Nofar Carmeli and Luc Segoufin. Conjunctive queries with self-joins, towards a fine-grained complexity analysis. CoRR, abs/2206.04988, 2022. URL: https://arxiv.org/abs/2206.04988.
  7. Katrin Casel and Markus L. Schmid. Fine-grained complexity of regular path queries. In ICDT, volume 186 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. Google Scholar
  8. Arnaud Durand. Fine-grained complexity analysis of queries: From decision to counting and enumeration. In PODS, pages 331-346. ACM, 2020. Google Scholar
  9. Austen Z. Fan, Paraschos Koutris, and Hangdong Zhao. The fine-grained complexity of boolean conjunctive queries and sum-product problems. CoRR, 2023. URL: https://arxiv.org/abs/2304.14557.
  10. Todd J. Green, Gregory Karvounarakis, and Val Tannen. Provenance semirings. In PODS, pages 31-40. ACM, 2007. Google Scholar
  11. Martin Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM (JACM), 54(1):1-24, 2007. Google Scholar
  12. Pinar Heggernes. Treewidth, partial k-trees, and chordal graphs. Partial curriculum in INF334-Advanced algorithmical techniques, Department of Informatics, University of Bergen, Norway, 2005. Google Scholar
  13. Manas Joglekar and Christopher Ré. It’s all a matter of degree - using degree information to optimize multiway joins. Theory Comput. Syst., 62(4):810-853, 2018. Google Scholar
  14. Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, and Maximilian Schleich. On functional aggregate queries with additive inequalities. In PODS, pages 414-431. ACM, 2019. Google Scholar
  15. Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, and Dan Suciu. Bag query containment and information theory. In PODS, pages 95-112. ACM, 2020. Google Scholar
  16. Mahmoud Abo Khamis, Hung Q. Ngo, and Atri Rudra. FAQ: questions asked frequently. In PODS, pages 13-28. ACM, 2016. Google Scholar
  17. Mahmoud Abo Khamis, Hung Q. Ngo, and Dan Suciu. What do shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? In PODS, pages 429-444. ACM, 2017. Google Scholar
  18. Andrea Lincoln, Virginia Vassilevska Williams, and R. Ryan Williams. Tight hardness for shortest cycles and paths in sparse graphs. In SODA, pages 1236-1252. SIAM, 2018. Google Scholar
  19. Dániel Marx. Can you beat treewidth? Theory Comput., 6(1):85-112, 2010. Google Scholar
  20. Dániel Marx. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. J. ACM, 60(6):42:1-42:51, 2013. Google Scholar
  21. Jaroslav Nešetřil and Svatopluk Poljak. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, 26(2):415-419, 1985. Google Scholar
  22. Hung Q. Ngo, Ely Porat, Christopher Ré, and Atri Rudra. Worst-case optimal join algorithms. J. ACM, 65(3):16:1-16:40, 2018. Google Scholar
  23. Hung Q. Ngo, Christopher Ré, and Atri Rudra. Skew strikes back: new developments in the theory of join algorithms. SIGMOD Rec., 42(4):5-16, 2013. Google Scholar
  24. Alexander Schrijver. Theory of linear and integer programming. Wiley-Interscience series in discrete mathematics and optimization. Wiley, 1999. Google Scholar
  25. Virginia Vassilevska Williams and R. Ryan Williams. Subcubic equivalences between path, matrix, and triangle problems. J. ACM, 65(5):27:1-27:38, 2018. Google Scholar
  26. Virginia Vassilevska Williams and Yinzhan Xu. Monochromatic triangles, triangle listing and APSP. In FOCS, pages 786-797. IEEE, 2020. Google Scholar
  27. Mihalis Yannakakis. Algorithms for acyclic database schemes. In VLDB, pages 82-94. IEEE Computer Society, 1981. Google Scholar
  28. Hangdong Zhao, Shaleen Deep, and Paraschos Koutris. Space-time tradeoffs for conjunctive queries with access patterns. CoRR, 2023. URL: https://arxiv.org/abs/2304.06221.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact