{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T08:25:01Z","timestamp":1772180701133,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,31]],"date-time":"2015-05-31T00:00:00Z","timestamp":1433030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,31]]},"DOI":"10.1145\/2764947.2764948","type":"proceedings-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T05:35:02Z","timestamp":1433223302000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Join Processing for Graph Patterns"],"prefix":"10.1145","author":[{"given":"Dung","family":"Nguyen","sequence":"first","affiliation":[{"name":"LogicBlox"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Molham","family":"Aref","sequence":"additional","affiliation":[{"name":"LogicBlox"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Bravenboer","sequence":"additional","affiliation":[{"name":"LogicBlox"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Kollias","sequence":"additional","affiliation":[{"name":"LogicBlox"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung Q.","family":"Ngo","sequence":"additional","affiliation":[{"name":"SUNY Buffalo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"R\u00e9","sequence":"additional","affiliation":[{"name":"Stanford"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atri","family":"Rudra","sequence":"additional","affiliation":[{"name":"SUNY Buffalo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Mar.","author":"Aberger C.","year":"2015","unstructured":"C. Aberger , A. N\u00f6tzli , K. Olukotun , and C. R\u00e9 . EmptyHeaded: Boolean Algebra Based Graph Processing. ArXiv e-prints , Mar. 2015 . C. Aberger, A. N\u00f6tzli, K. Olukotun, and C. R\u00e9. EmptyHeaded: Boolean Algebra Based Graph Processing. ArXiv e-prints, Mar. 2015."},{"key":"e_1_3_2_1_2_1","volume-title":"Foundations of Databases","author":"Abiteboul S.","year":"1995","unstructured":"S. Abiteboul , R. Hull , and V. Vianu . Foundations of Databases . Addison-Wesley , 1995 . S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322390"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109590"},{"key":"e_1_3_2_1_7_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014.  J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594547"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213565"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_3_2_1_11_1","volume-title":"BTW","author":"Rudolf M.","year":"2013","unstructured":"M. Rudolf , M. Paradies , C. Bornh\u00f6vd , and W. Lehner . The graph story of the sap hana database . In BTW , 2013 . M. Rudolf, M. Paradies, C. Bornh\u00f6vd, and W. Lehner. The graph story of the sap hana database. In BTW, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/582095.582099"},{"key":"e_1_3_2_1_13_1","volume-title":"Incremental maintenance for leapfrog triejoin. CoRR, abs\/1303.5313","author":"Veldhuizen T. L.","year":"2013","unstructured":"T. L. Veldhuizen . Incremental maintenance for leapfrog triejoin. CoRR, abs\/1303.5313 , 2013 . T. L. Veldhuizen. Incremental maintenance for leapfrog triejoin. CoRR, abs\/1303.5313, 2013."},{"key":"e_1_3_2_1_14_1","first-page":"96","volume-title":"ICDT","author":"Veldhuizen T. L.","year":"2014","unstructured":"T. L. Veldhuizen . Leapfrog triejoin : A simple, worst-case optimal join algorithm . In ICDT , pages 96 -- 106 , 2014 . T. L. Veldhuizen. Leapfrog triejoin: A simple, worst-case optimal join algorithm. In ICDT, pages 96--106, 2014."},{"key":"e_1_3_2_1_15_1","volume-title":"Transaction repair: Full serializability without locks. CoRR, abs\/1403.5645","author":"Veldhuizen T. L.","year":"2014","unstructured":"T. L. Veldhuizen . Transaction repair: Full serializability without locks. CoRR, abs\/1403.5645 , 2014 . T. L. Veldhuizen. Transaction repair: Full serializability without locks. CoRR, abs\/1403.5645, 2014."},{"key":"e_1_3_2_1_16_1","first-page":"82","volume-title":"VLDB","author":"Yannakakis M.","year":"1981","unstructured":"M. Yannakakis . Algorithms for acyclic database schemes . In VLDB , pages 82 -- 94 , 1981 . M. Yannakakis. Algorithms for acyclic database schemes. In VLDB, pages 82--94, 1981."}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","location":"Melbourne VIC Australia","acronym":"SIGMOD\/PODS'15","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the GRADES'15"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764947.2764948","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2764947.2764948","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:24Z","timestamp":1750227144000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764947.2764948"}},"subtitle":["An Old Dog with New Tricks"],"short-title":[],"issued":{"date-parts":[[2015,5,31]]},"references-count":16,"alternative-id":["10.1145\/2764947.2764948","10.1145\/2764947"],"URL":"https:\/\/doi.org\/10.1145\/2764947.2764948","relation":{},"subject":[],"published":{"date-parts":[[2015,5,31]]},"assertion":[{"value":"2015-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}