{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T13:14:12Z","timestamp":1778073252995,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","funder":[{"name":"NSF (National Science Foundation)","award":["IIS 2314527"],"award-info":[{"award-number":["IIS 2314527"]}]},{"name":"NSF (National Science Foundation)","award":["SHF 2312195"],"award-info":[{"award-number":["SHF 2312195"]}]},{"name":"NSF (National Science Foundation)","award":["III 2507117"],"award-info":[{"award-number":["III 2507117"]}]},{"name":"Microsoft","award":["professorship"],"award-info":[{"award-number":["professorship"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,5,31]]},"DOI":"10.1145\/3788852.3805595","type":"proceedings-article","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T12:24:47Z","timestamp":1778070287000},"page":"2-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Query Optimization and Evaluation via Information Theory"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3894-6494","authenticated-orcid":false,"given":"Mahmoud","family":"Abo Khamis","sequence":"first","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3498-4744","authenticated-orcid":false,"given":"Hung Q.","family":"Ngo","sequence":"additional","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4144-0868","authenticated-orcid":false,"given":"Dan","family":"Suciu","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,5,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Foundations of Databases","author":"Abiteboul Serge","unstructured":"Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley. http:\/\/webdam.inria.fr\/Alice\/"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. ACM Manag. Data","author":"Khamis Mahmoud Abo","year":"2026","unstructured":"Mahmoud Abo Khamis, and Hubie Chen. 2026. Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time. Proc. ACM Manag. Data (2026). doi:10.1145\/3801904,"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3426865"},{"key":"e_1_3_2_1_4_1","first-page":"10","volume-title":"Proc. ACM Manag. Data","volume":"2","author":"Khamis Mahmoud Abo","year":"2024","unstructured":"Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu, and Dan Suciu. 2024. Join Size Bounds using lp-Norms on Degree Sequences. Proc. ACM Manag. Data, Vol. 2, 2, Article 96 (may 2024), 24 pages. doi:10.1145\/3651597,"},{"key":"e_1_3_2_1_5_1","first-page":"13","volume-title":"Proceedings of the 35th ACM PODS 2016","author":"Khamis Mahmoud Abo","year":"2016","unstructured":"Mahmoud Abo Khamis, Hung Q. Ngo, and Atri Rudra. 2016a. FAQ: Questions Asked Frequently. In Proceedings of the 35th ACM PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016. ACM, 13-28. doi:10.1145\/2902251.2902280,"},{"key":"e_1_3_2_1_6_1","first-page":"327","volume-title":"Proceedings of the 35th ACM PODS 2016","author":"Khamis Mahmoud Abo","year":"2016","unstructured":"Mahmoud Abo Khamis, Hung Q. Ngo, and Dan Suciu. 2016b. Computing Join Queries with Functional Dependencies. In Proceedings of the 35th ACM PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016. ACM, 327-342. doi:10.1145\/2902251.2902289,"},{"key":"e_1_3_2_1_7_1","first-page":"429","volume-title":"Proceedings of the 36th ACM PODS 2017","author":"Khamis Mahmoud Abo","year":"2017","unstructured":"Mahmoud Abo Khamis, Hung Q. Ngo, and Dan Suciu. 2017. What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?. In Proceedings of the 36th ACM PODS 2017, Chicago, IL, USA, May 14-19, 2017. ACM, 429-444. doi:10.1145\/3034786.3056105, Extended version available at http:\/\/arxiv.org\/abs\/1612.02503."},{"key":"e_1_3_2_1_8_1","volume-title":"TheoretiCS","volume":"4","author":"Khamis Mahmoud Abo","year":"2025","unstructured":"Mahmoud Abo Khamis, Hung Q. Ngo, and Dan Suciu. 2025. PANDA: Query Evaluation in Submodular Width. TheoretiCS, Vol. Volume 4, Article 12 (Apr 2025). doi:10.46298\/theoretics.25.12,"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. ACM Manag. Data","author":"Khamis Mahmoud Abo","year":"2026","unstructured":"Mahmoud Abo Khamis, Hung Q. Ngo, and Dan Suciu. 2026. PANDAExpress: a Simpler and Faster PANDA Algorithm. Proc. ACM Manag. Data (2026). doi:10.1145\/3801910,"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761855"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"key":"e_1_3_2_1_13_1","volume-title":"21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings (Lecture Notes in Computer Science","volume":"222","author":"Bagan Guillaume","year":"2007","unstructured":"Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. 2007. On Acyclic Conjunctive Queries and Constant Delay Enumeration. In Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings (Lecture Notes in Computer Science, Vol. 4646). Springer, 208-222. doi:10.1007\/978-3-540-74915-8_18,"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2503.20438"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","first-page":"2145","DOI":"10.1145\/3717823.3718141","volume-title":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC 2025","author":"Bringmann Karl","year":"2025","unstructured":"Karl Bringmann and Egor Gorbachev. 2025. A Fine-Grained Classification of Subquadratic Patterns for Subgraph Listing and Friends. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czechia, June 23-27, 2025. ACM, 2145-2156. doi:10.1145\/3717823.3718141,"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","first-page":"1992","DOI":"10.1109\/TIT.2002.1013138","article-title":"On a relation between information inequalities and group theory","volume":"48","author":"Chan Terence H.","year":"2002","unstructured":"Terence H. Chan and Raymond W. Yeung. 2002. On a relation between information inequalities and group theory. IEEE Transactions on Information Theory, Vol. 48, 7 (2002), 1992-1995.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_3_2_1_17_1","first-page":"77","volume-title":"Optimal Implementation of Conjunctive Queries in Relational Data Bases. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing","author":"Ashok","year":"1977","unstructured":"Ashok K. Chandra and Philip M. Merlin. 1977. Optimal Implementation of Conjunctive Queries in Relational Data Bases. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing, May 4-6, 1977, Boulder, Colorado, USA. ACM, 77-90. doi:10.1145\/800105.803397,"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/275487.275492","volume-title":"Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"Chaudhuri Surajit","year":"1998","unstructured":"Surajit Chaudhuri. 1998. An Overview of Query Optimization in Relational Systems. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 1-3, 1998, Seattle, Washington, USA. ACM Press, 34-43. doi:10.1145\/275487.275492,"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(86)90019-1"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","author":"Dalirrooyfard Mina","year":"2024","unstructured":"Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, and Yinzhan Xu. 2024. Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing (Vancouver, BC, Canada) (STOC 2024). Association for Computing Machinery, New York, NY, USA, 923\u2013934. doi:10.1145\/3618260.3649663,"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1335054"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00059-4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2025.17"},{"key":"e_1_3_2_1_24_1","first-page":"10","volume-title":"Proc. ACM Manag. Data","volume":"2","author":"Deep Shaleen","year":"2024","unstructured":"Shaleen Deep, Hangdong Zhao, Austen Z. Fan, and Paraschos Koutris. 2024. Output-sensitive Conjunctive Query Evaluation. Proc. ACM Manag. Data, Vol. 2, 5, Article 220 (Nov. 2024), 24 pages. doi:10.1145\/3695838,"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000077"},{"key":"e_1_3_2_1_26_1","volume-title":"50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"20","author":"Fan Austen Z.","year":"2023","unstructured":"Austen Z. Fan, Paraschos Koutris, and Hangdong Zhao. 2023. 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), Vol. 261). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 127:1-127:20. doi:10.4230\/LIPIcs.ICALP.2023.127,"},{"key":"e_1_3_2_1_27_1","first-page":"10","volume-title":"Proc. ACM Manag. Data","volume":"2","author":"Fan Austen Z.","year":"2024","unstructured":"Austen Z. Fan, Paraschos Koutris, and Hangdong Zhao. 2024. Tight Bounds of Circuits for Sum-Product Queries. Proc. ACM Manag. Data, Vol. 2, 2, Article 87 (May 2024), 20 pages. doi:10.1145\/3651588,"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/4145187"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02780332"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02780332"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/2902251.2902309","volume-title":"Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016","author":"Gottlob Georg","year":"2016","unstructured":"Georg Gottlob, Gianluigi Greco, Nicola Leone, and Francesco Scarcello. 2016. Hypertree Decompositions: Questions and Answers. In 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. ACM, 57-74. doi:10.1145\/2902251.2902309,"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009","author":"Gottlob Georg","year":"2009","unstructured":"Georg Gottlob, Stephanie Tien Lee, and Gregory Valiant. 2009. Size and treewidth bounds for conjunctive queries. In Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009, June 19 - July 1, 2009, Providence, Rhode Island, USA. ACM, 45-54. doi:10.1145\/1559795.1559804,"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2220357.2220363"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_3_2_1_35_1","volume-title":"Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems","author":"Green Todd J.","year":"2007","unstructured":"Todd J. Green, Grigoris Karvounarakis, and Val Tannen. 2007. Provenance semirings. In Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (Beijing, China) (PODS '07). Association for Computing Machinery, New York, NY, USA, 31\u201340. doi:10.1145\/1265530.1265535,"},{"key":"e_1_3_2_1_36_1","first-page":"93","volume-title":"Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017","author":"Todd","year":"2017","unstructured":"Todd J. Green and Val Tannen. 2017. The Semiring Framework for Database Provenance. In Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017. ACM, 93-99. doi:10.1145\/3034786.3056125,"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/1109557.1109590","volume-title":"Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006","author":"Grohe Martin","year":"2006","unstructured":"Martin Grohe and D\u00e1niel Marx. 2006. Constraint solving via fractional edge covers. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006. ACM Press, 289-298. http:\/\/dl.acm.org\/citation.cfm?id=1109557.1109590"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2636918"},{"key":"e_1_3_2_1_39_1","first-page":"10","volume-title":"Proc. ACM Manag. Data","volume":"3","author":"Hu Xiao","year":"2025","unstructured":"Xiao Hu. 2025. Output-Optimal Algorithms for Join-Aggregate Queries. Proc. ACM Manag. Data, Vol. 3, 2, Article 104 (June 2025), 27 pages. doi:10.1145\/3725241,"},{"key":"e_1_3_2_1_40_1","volume-title":"Proc. ACM Manag. Data","volume":"3","author":"Im Sungjin","year":"2025","unstructured":"Sungjin Im, Benjamin Moseley, Hung Q. Ngo, and Kirk Pruhs. 2025. Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints. Proc. ACM Manag. Data, Vol. 3, 2 (2025), 96:1-96:26. doi:10.1145\/3725233,"},{"key":"e_1_3_2_1_41_1","first-page":"1","volume-title":"Proceedings of the 9th Annual ACM Symposium on Theory of Computing","author":"Itai Alon","year":"1977","unstructured":"Alon Itai and Michael Rodeh. 1977. Finding a Minimum Circuit in a Graph. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing, May 4-6, 1977, Boulder, Colorado, USA. ACM, 1-10. doi:10.1145\/800105.803390,"},{"key":"e_1_3_2_1_42_1","volume-title":"Proc. ACM Manag. Data","volume":"3","author":"Khamis Mahmoud Abo","year":"2025","unstructured":"Mahmoud Abo Khamis, Xiao Hu, and Dan Suciu. 2025. Fast Matrix Multiplication meets the Submodular Width. Proc. ACM Manag. Data, Vol. 3, 2 (2025), 98:1-98:26. doi:10.1145\/3725235,"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2967101"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.4230\/DagRep.12.7.180"},{"key":"e_1_3_2_1_45_1","first-page":"205","volume-title":"Conjunctive-Query Containment and Constraint Satisfaction. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"Phokion","year":"1998","unstructured":"Phokion G. Kolaitis and Moshe Y. Vardi. 1998. Conjunctive-Query Containment and Constraint Satisfaction. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 1-3, 1998, Seattle, Washington, USA. ACM Press, 205-213. doi:10.1145\/275487.275511,"},{"key":"e_1_3_2_1_46_1","volume-title":"Probabilistic Graphical Models - Principles and Techniques","author":"Koller Daphne","year":"1886","unstructured":"Daphne Koller and Nir Friedman. 2009. Probabilistic Graphical Models - Principles and Techniques. MIT Press. http:\/\/mitpress.mit.edu\/catalog\/item\/default.asp?ttype=2&tid=11886"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_3_2_1_48_1","unstructured":"David Maier. 1983. Theory of Relational Databases. Computer Science Pr."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535926"},{"key":"e_1_3_2_1_50_1","first-page":"37","volume-title":"Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2012","author":"Ngo Hung Q.","year":"2012","unstructured":"Hung Q. Ngo, Ely Porat, Christopher R\u00e9, and Atri Rudra. 2012. Worst-case optimal join algorithms: [extended abstract]. In Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2012, Scottsdale, AZ, USA, May 20-24, 2012. ACM, 37-48. doi:10.1145\/2213556.2213565,"},{"key":"e_1_3_2_1_51_1","first-page":"10","volume-title":"ACM","volume":"65","author":"Ngo Hung Q.","year":"2018","unstructured":"Hung Q. Ngo, Ely Porat, Christopher R\u00e9, and Atri Rudra. 2018. Worst-case Optimal Join Algorithms. J. ACM, Vol. 65, 3, Article 16 (March 2018), 40 pages. doi:10.1145\/3180143,"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_3_2_1_53_1","volume-title":"Database management systems (3. ed.)","author":"Ramakrishnan Raghu","unstructured":"Raghu Ramakrishnan and Johannes Gehrke. 2003. Database management systems (3. ed.). McGraw-Hill."},{"key":"e_1_3_2_1_54_1","first-page":"96","volume-title":"Worst-Case Optimal Join Algorithm. In Proc. 17th International Conference on Database Theory (ICDT)","author":"Veldhuizen Todd L.","year":"2014","unstructured":"Todd L. Veldhuizen. 2014. Triejoin: A Simple, Worst-Case Optimal Join Algorithm. In Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014. OpenProceedings.org, 96-106. doi:10.5441\/002\/icdt.2014.13,"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2112.01003"},{"key":"e_1_3_2_1_56_1","first-page":"82","volume-title":"7th International Conference","author":"Yannakakis Mihalis","year":"1981","unstructured":"Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In Very Large Data Bases, 7th International Conference, September 9-11, 1981, Cannes, France, Proceedings. IEEE Computer Society, 82-94."},{"key":"e_1_3_2_1_57_1","first-page":"254","volume-title":"SODA","volume":"4","author":"Yuster Raphael","year":"2004","unstructured":"Raphael Yuster and Uri Zwick. 2004. Detecting short directed cycles using rectangular matrix multiplication and dynamic programming.. In SODA, Vol. 4. 254-260."},{"key":"e_1_3_2_1_58_1","volume-title":"Zhang and David Poole","author":"Norman","year":"1994","unstructured":"Norman X. Zhang and David Poole. 1994. A simple approach to Bayesian network computations. In Proceedings of the Canadian AI Conference. Springer, 207-214. https:\/\/www.semanticscholar.org\/paper\/A-simple-approach-to-Bayesian-network-computations-Zhang-Poole\/b1b8a329df99d7f26fcd99ae49fd2654cdddafb6"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","first-page":"1982","DOI":"10.1109\/18.641561","article-title":"A non-Shannon-type conditional inequality of information quantities","volume":"43","author":"Zhang Zhen","year":"1997","unstructured":"Zhen Zhang and Raymond W. Yeung. 1997. A non-Shannon-type conditional inequality of information quantities. IEEE Trans. Information Theory, Vol. 43, 6 (1997), 1982-1986.","journal-title":"IEEE Trans. Information Theory"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1109\/18.681320","article-title":"On characterization of entropy function via information inequalities","volume":"44","author":"Zhang Zhen","year":"1998","unstructured":"Zhen Zhang and Raymond W Yeung. 1998. On characterization of entropy function via information inequalities. IEEE Transactions on Information Theory, Vol. 44, 4 (1998), 1440-1452.","journal-title":"IEEE Transactions on Information Theory"}],"event":{"name":"SIGMOD\/PODS '26: International Conference on Management of Data","location":"Bengaluru India","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Companion of the 45th Symposium on Principles of Database Systems"],"original-title":[],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T12:25:34Z","timestamp":1778070334000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3788852.3805595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,30]]},"references-count":60,"alternative-id":["10.1145\/3788852.3805595","10.1145\/3788852"],"URL":"https:\/\/doi.org\/10.1145\/3788852.3805595","relation":{},"subject":[],"published":{"date-parts":[[2026,5,30]]},"assertion":[{"value":"2026-05-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}