{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:17:41Z","timestamp":1787757461030,"version":"build-2784847793"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,15]],"date-time":"2016-06-15T00:00:00Z","timestamp":1465948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"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"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1319402,CNF-1409551,AITF-1535565"],"award-info":[{"award-number":["CCF-1319402,CNF-1409551,AITF-1535565"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,15]]},"DOI":"10.1145\/2902251.2902289","type":"proceedings-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T20:16:05Z","timestamp":1466108165000},"page":"327-342","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Computing Join Queries with Functional Dependencies"],"prefix":"10.1145","author":[{"given":"Mahmoud","family":"Abo Khamis","sequence":"first","affiliation":[{"name":"LogicBlox Inc. and SUNY at Buffalo, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hung Q.","family":"Ngo","sequence":"additional","affiliation":[{"name":"LogicBlox Inc. and SUNY at Buffalo, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Suciu","sequence":"additional","affiliation":[{"name":"LogicBlox Inc. and University of Washington, Seattle, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Emptyheaded: Boolean algebra based graph processing. CoRR, abs\/1503.02368","author":"Aberger C. R.","year":"2015","unstructured":"C. R. Aberger , A. N\u00f6tzli , K. Olukotun , and C. R\u00e9 . Emptyheaded: Boolean algebra based graph processing. CoRR, abs\/1503.02368 , 2015 . C. R. Aberger, A. N\u00f6tzli, K. Olukotun, and C. R\u00e9. Emptyheaded: Boolean algebra based graph processing. CoRR, abs\/1503.02368, 2015."},{"key":"e_1_3_2_1_2_1","volume-title":"Computing join queries with functional dependencies. CoRR, abs\/1604.00111","author":"Abo Khamis M.","year":"2016","unstructured":"M. Abo Khamis , H. Q. Ngo , and D. Suciu . Computing join queries with functional dependencies. CoRR, abs\/1604.00111 , 2016 . M. Abo Khamis, H. Q. Ngo, and D. Suciu. Computing join queries with functional dependencies. CoRR, abs\/1604.00111, 2016."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742796"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.43"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-012-2453-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735703.2735708"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2750545"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(86)90019-1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90028-9"},{"key":"e_1_3_2_1_11_1","volume-title":"Entropy bounds for conjunctive queries with functional dependencies. CoRR, abs\/1512.01808","author":"Gogacz T.","year":"2015","unstructured":"T. Gogacz and S. Torunczyk . Entropy bounds for conjunctive queries with functional dependencies. CoRR, abs\/1512.01808 , 2015 . T. Gogacz and S. Torunczyk. Entropy bounds for conjunctive queries with functional dependencies. CoRR, abs\/1512.01808, 2015."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2220357.2220363"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109590"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings WITMSE 2011","author":"Harremo\u00ebs P.","year":"2011","unstructured":"P. Harremo\u00ebs . Functional dependences and Bayesian networks . In Proceedings WITMSE 2011 , Helsinki , 2011 . P. Harremo\u00ebs. Functional dependences and Bayesian networks. In Proceedings WITMSE 2011, Helsinki, 2011."},{"key":"e_1_3_2_1_15_1","volume-title":"It's all a matter of degree: Using degree information to optimize multiway joins. CoRR, abs\/1508.01239","author":"Joglekar M.","year":"2015","unstructured":"M. Joglekar and C. R\u00e9 . It's all a matter of degree: Using degree information to optimize multiway joins. CoRR, abs\/1508.01239 , 2015 . M. Joglekar and C. R\u00e9. It's all a matter of degree: Using degree information to optimize multiway joins. CoRR, abs\/1508.01239, 2015."},{"issue":"2","key":"e_1_3_2_1_16_1","first-page":"181","article-title":"A lattice view of functional dependencies in incomplete relations","volume":"12","author":"Levene M.","year":"1995","unstructured":"M. Levene . A lattice view of functional dependencies in incomplete relations . Acta Cybern. , 12 ( 2 ): 181 -- 207 , 1995 . M. Levene. A lattice view of functional dependencies in incomplete relations. Acta Cybern., 12(2):181--207, 1995.","journal-title":"Acta Cybern."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535926"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213565"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_3_2_1_20_1","volume-title":"entropy and counting. Computational Mathematics, Modelling and Algorithms, page 146","author":"Radhakrishnan J.","year":"2003","unstructured":"J. Radhakrishnan . 6. entropy and counting. Computational Mathematics, Modelling and Algorithms, page 146 , 2003 . J. Radhakrishnan. 6. entropy and counting. Computational Mathematics, Modelling and Algorithms, page 146, 2003."},{"key":"e_1_3_2_1_21_1","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial optimization. Polyhedra and efficiency","author":"Schrijver A.","year":"2003","unstructured":"A. Schrijver . Combinatorial optimization. Polyhedra and efficiency . Vol. B, volume 24 of Algorithms and Combinatorics . Springer-Verlag , Berlin , 2003 . Matroids, trees, stable sets, Chapters 39--69. A. Schrijver. Combinatorial optimization. Polyhedra and efficiency. Vol. B, volume 24 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 2003. Matroids, trees, stable sets, Chapters 39--69."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2124415"},{"key":"e_1_3_2_1_23_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_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1457455"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.681320"}],"event":{"name":"SIGMOD\/PODS'16: International Conference on Management of Data","location":"San Francisco California USA","acronym":"SIGMOD\/PODS'16","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2902251.2902289","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2902251.2902289","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2902251.2902289","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:59Z","timestamp":1750222499000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2902251.2902289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,15]]},"references-count":25,"alternative-id":["10.1145\/2902251.2902289","10.1145\/2902251"],"URL":"https:\/\/doi.org\/10.1145\/2902251.2902289","relation":{},"subject":[],"published":{"date-parts":[[2016,6,15]]},"assertion":[{"value":"2016-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}