{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T09:15:24Z","timestamp":1781082924427,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":16,"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"],"award-info":[{"award-number":["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":[[2017,5,9]]},"DOI":"10.1145\/3034786.3034788","type":"proceedings-article","created":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T18:09:00Z","timestamp":1494439740000},"page":"417-428","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries"],"prefix":"10.1145","author":[{"given":"Bas","family":"Ketsman","sequence":"first","affiliation":[{"name":"Hasselt University, Hasselt, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Suciu","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, 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\/1739041.1739056"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745759"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465224"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594558"},{"key":"e_1_3_2_1_7_1","volume-title":"K\u00f6nig-egerv\u00e1ry graphs, 2-bicritical graphs and fractional matchings. Discrete Applied Mathematics, 24(1--3):63--82","author":"Bourjolly J.","year":"1989","unstructured":"J. Bourjolly and W. R. Pulleyblank . K\u00f6nig-egerv\u00e1ry graphs, 2-bicritical graphs and fractional matchings. Discrete Applied Mathematics, 24(1--3):63--82 , 1989 . J. Bourjolly and W. R. Pulleyblank. K\u00f6nig-egerv\u00e1ry graphs, 2-bicritical graphs and fractional matchings. Discrete Applied Mathematics, 24(1--3):63--82, 1989."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2220357.2220363"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463704"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902292"},{"key":"e_1_3_2_1_11_1","first-page":"1","volume-title":"ICDT","author":"Koutris P.","year":"2016","unstructured":"P. Koutris , P. Beame , and D. Suciu . Worst-case optimal algorithms for parallel query processing . In ICDT , pages 8: 1 -- 8 :18, 2016 . P. Koutris, P. Beame, and D. Suciu. Worst-case optimal algorithms for parallel query processing. In ICDT, pages 8:1--8:18, 2016."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989310"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213565"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_3_2_1_15_1","volume-title":"Fractional graph theory: a rational approach to the theory of graphs","author":"Scheinerman E. R.","year":"1997","unstructured":"E. R. Scheinerman and D. H. Ullman . Fractional graph theory: a rational approach to the theory of graphs . Wiley , New York , 1997 . E. R. Scheinerman and D. H. Ullman. Fractional graph theory: a rational approach to the theory of graphs. Wiley, New York, 1997."},{"key":"e_1_3_2_1_16_1","first-page":"96","volume-title":"ICDT","author":"Veldhuizen T. L.","year":"2014","unstructured":"T. L. Veldhuizen . Triejoin : A simple, worst-case optimal join algorithm . In ICDT , pages 96 -- 106 , 2014 . T. L. Veldhuizen. Triejoin: A simple, worst-case optimal join algorithm. In ICDT, pages 96--106, 2014."}],"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.3034788","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3034786.3034788","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3034786.3034788","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.3034788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,9]]},"references-count":16,"alternative-id":["10.1145\/3034786.3034788","10.1145\/3034786"],"URL":"https:\/\/doi.org\/10.1145\/3034786.3034788","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"}}]}}