{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T07:46:01Z","timestamp":1792136761926,"version":"4.4.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,9]],"date-time":"2017-05-09T00:00:00Z","timestamp":1494288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1535565, 1614738"],"award-info":[{"award-number":["1535565, 1614738"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["#FA8750-15-2-0009"],"award-info":[{"award-number":["#FA8750-15-2-0009"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,9]]},"DOI":"10.1145\/3034786.3056105","type":"proceedings-article","created":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T18:09:00Z","timestamp":1494439740000},"page":"429-444","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":79,"title":["What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?"],"prefix":"10.1145","author":[{"given":"Mahmoud","family":"Abo Khamis","sequence":"first","affiliation":[{"name":"LogicBlox Inc., Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hung Q.","family":"Ngo","sequence":"additional","affiliation":[{"name":"LogicBlox Inc., Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Suciu","sequence":"additional","affiliation":[{"name":"LogicBlox Inc. &l University of Washington, Seattle, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,5,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745776"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902280"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902289"},{"key":"e_1_3_2_1_4_1","volume-title":"What do shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? CoRR, abs\/1612.02503","author":"Khamis M. Abo","year":"2016","unstructured":"M. Abo Khamis , H. Q. Ngo , and D. Suciu . What do shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? CoRR, abs\/1612.02503 , 2016 . M. Abo Khamis, H. Q. Ngo, and D. Suciu. What do shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? CoRR, abs\/1612.02503, 2016."},{"key":"e_1_3_2_1_5_1","volume-title":"Width functions for hypertree decompositions","author":"Adler I.","year":"2006","unstructured":"I. Adler . Width functions for hypertree decompositions . 2006 . Ph.D. Dissertation, Albert-Ludwigs-Universit\u00e4t Freiburg . 2006. I. Adler. Width functions for hypertree decompositions. 2006. Ph.D. Dissertation, Albert-Ludwigs-Universit\u00e4t Freiburg. 2006."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.825794"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761855"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24206-9_17"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078334"},{"key":"e_1_3_2_1_11_1","volume-title":"CIDR 2009, Fourth Biennial Conference on Innovative Data Systems Research, Asilomar, CA, USA, January 4-7, 2009, Online Proceedings","author":"Armbrust M.","year":"2009","unstructured":"M. Armbrust , A. Fox , D. A. Patterson , N. Lanham , B. Trushkowsky , J. Trutna , and H. Oh . SCADS: scale-independent storage for social computing applications . In CIDR 2009, Fourth Biennial Conference on Innovative Data Systems Research, Asilomar, CA, USA, January 4-7, 2009, Online Proceedings , 2009 . M. Armbrust, A. Fox, D. A. Patterson, N. Lanham, B. Trushkowsky, J. Trutna, and H. Oh. SCADS: scale-independent storage for social computing applications. In CIDR 2009, Fourth Biennial Conference on Innovative Data Systems Research, Asilomar, CA, USA, January 4-7, 2009, Online Proceedings, 2009."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465333"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.43"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556579"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735703.2735708"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847523"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732996"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(86)90019-1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00059-4"},{"key":"e_1_3_2_1_20_1","volume-title":"Minimax and Applications. Nonconvex Optimization and Its Applications","author":"Du D.","year":"1995","unstructured":"D. Du and P. Pardalos . Minimax and Applications. Nonconvex Optimization and Its Applications . Springer US , 1995 . D. Du and P. Pardalos. Minimax and Applications. Nonconvex Optimization and Its Applications. Springer US, 1995."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/261124.261126"},{"key":"e_1_3_2_1_22_1","volume-title":"Nov.","author":"Fischl W.","year":"2016","unstructured":"W. Fischl , G. Gottlob , and R. Pichler . General and Fractional Hypertree Decompositions: Hard and Easy Cases. ArXiv e-prints , Nov. 2016 . W. Fischl, G. Gottlob, and R. Pichler. General and Fractional Hypertree Decompositions: Hard and Easy Cases. ArXiv e-prints, Nov. 2016."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1865499.1865500"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02780332"},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. 20th International Conference on Database Theory (ICDT)","author":"Gogacz T.","year":"2017","unstructured":"T. Gogacz and S. Toru\u0144czyk . Entropy bounds for conjunctive queries with functional dependencies . In Proc. 20th International Conference on Database Theory (ICDT) , 2017 . T. Gogacz and S. Toru\u0144czyk. Entropy bounds for conjunctive queries with functional dependencies. In Proc. 20th International Conference on Database Theory (ICDT), 2017."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902309"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2220357.2220363"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109590"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2636918"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-009-9248-9"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535926"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557201"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213565"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/17634"},{"key":"e_1_3_2_1_37_1","first-page":"96","volume-title":"Proc. 17th International Conference on Database Theory (ICDT)","author":"Veldhuizen T. L.","year":"2014","unstructured":"T. L. Veldhuizen . Triejoin : A simple, worst-case optimal join algorithm. In N. Schweikardt, V. Christophides, and V. Leroy, editors , Proc. 17th International Conference on Database Theory (ICDT) , Athens, Greece , March 24-28, 2014 ., pages 96 -- 106 . OpenProceedings.org, 2014. T. L. Veldhuizen. Triejoin: A simple, worst-case optimal join algorithm. In N. Schweikardt, V. Christophides, and V. Leroy, editors, Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014., pages 96--106. OpenProceedings.org, 2014."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1457455"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.681320"}],"event":{"name":"SIGMOD\/PODS'17: International Conference on Management of Data","location":"Chicago Illinois USA","acronym":"SIGMOD\/PODS'17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3034786.3056105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3034786.3056105","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3034786.3056105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:50:05Z","timestamp":1750218605000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3034786.3056105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,9]]},"references-count":39,"alternative-id":["10.1145\/3034786.3056105","10.1145\/3034786"],"URL":"https:\/\/doi.org\/10.1145\/3034786.3056105","relation":{},"subject":[],"published":{"date-parts":[[2017,5,9]]},"assertion":[{"value":"2017-05-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}