PANDA: Query Evaluation in Submodular Width (2402.02001v5)
Abstract: In recent years, several information-theoretic upper bounds have been introduced on the output size and evaluation cost of database join queries. These bounds vary in their power depending on both the type of statistics on input relations and the query plans that they support. This motivated the search for algorithms that can compute the output of a join query in times that are bounded by the corresponding information-theoretic bounds. In this paper, we describe PANDA, an algorithm that takes a Shannon-inequality that underlies the bound, and translates each proof step into an algorithmic step corresponding to some database operation. PANDA computes answers to a conjunctive query in time given by the the submodular width plus the output size of the query. The version in this paper represents a significant simplification of the original version [ANS, PODS'17].
- Size bounds and query plans for relational joins. SIAM J. Comput., 42(4):1737–1767, 2013.
- Bag query containment and information theory. ACM Trans. Database Syst., 46(3):12:1–12:39, 2021.
- Join Size Bounds using Lp-Norms on Degree Sequences. arXiv e-prints, page arXiv:2306.14075, June 2023.
- Computing join queries with functional dependencies. In Tova Milo and Wang-Chiew Tan, editors, 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 327–342. ACM, 2016.
- What do shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? In Emanuel Sallinger, Jan Van den Bussche, and Floris Geerts, editors, Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017, pages 429–444. ACM, 2017. Extended version available at http://arxiv.org/abs/1612.02503.
- On the number of copies of one hypergraph in another. Israel Journal of Mathematics, 105(1):251–256, 1998.
- Hypertree decompositions and tractable queries. Journal of Computer and System Sciences, 64(3):579–627, 2002.
- Size and treewidth bounds for conjunctive queries. J. ACM, 59(3):16:1–16:35, 2012.
- Constraint solving via fractional edge covers. ACM Trans. Algorithms, 11(1):4:1–4:20, 2014.
- Dániel Marx. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. J. ACM, 60(6):42:1–42:51, 2013.
- Hung Q. Ngo. Worst-case optimal join algorithms: Techniques, results, and open problems. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS ’18, page 111–124, New York, NY, USA, 2018. Association for Computing Machinery.
- Worst-case optimal join algorithms. J. ACM, 65(3):16:1–16:40, 2018.
- Todd L. Veldhuizen. Triejoin: A simple, worst-case optimal join algorithm. In Nicole Schweikardt, Vassilis Christophides, and Vincent Leroy, editors, Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014, pages 96–106. OpenProceedings.org, 2014.
- A non-shannon-type conditional inequality of information quantities. IEEE Trans. Information Theory, 43(6):1982–1986, 1997.
- On characterization of entropy function via information inequalities. IEEE Transactions on Information Theory, 44(4):1440–1452, 1998.