{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T03:29:15Z","timestamp":1773804555527,"version":"3.50.1"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"8","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Millennium Institute for Foundational Research on Data","award":["ICN17_002"],"award-info":[{"award-number":["ICN17_002"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1145\/3653314","type":"journal-article","created":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T12:37:10Z","timestamp":1721133430000},"page":"40-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Tackling Challenges in Implementing Large-Scale Graph Databases"],"prefix":"10.1145","volume":"67","author":[{"given":"Diego","family":"Arroyuelo","sequence":"first","affiliation":[{"name":"Pontificia Universidad Cat\u00f3lica, Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aidan","family":"Hogan","sequence":"additional","affiliation":[{"name":"University of Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[{"name":"University of Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Reutter","sequence":"additional","affiliation":[{"name":"Pontificia Universidad Cat\u00f3lica, Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domagoj","family":"Vrgo\u010d","sequence":"additional","affiliation":[{"name":"Pontificia Universidad Cat\u00f3lica, Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,8]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00711-3"},{"issue":"5","key":"e_1_3_1_4_2","first-page":"68:1","article-title":"Foundations of modern query languages for graph databases","volume":"50","author":"Angles R.","year":"2017","unstructured":"Angles, R. et al. Foundations of modern query languages for graph databases. ACM Com. Surveys 50, 5 (2017), 68:1\u201368:40.","journal-title":"ACM Com. Surveys"},{"key":"e_1_3_1_5_2","doi-asserted-by":"crossref","unstructured":"Arroyuelo D. et al. Worst-case-optimal similarity joins on graph databases. In Proceedings of 2024 ACM Intern. Conf. Management of Data. To appear.","DOI":"10.1145\/3639294"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-023-00811-2"},{"key":"e_1_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Arroyuelo D. et al. The ring: Worst-case optimal joins in graph databases using (almost) no extra space. ACM Trans. Database Systems 2024 to appear.","DOI":"10.1145\/3644824"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"issue":"1","key":"e_1_3_1_9_2","first-page":"3","article-title":"Virtuoso, a hybrid RDBMS\/graph column store","volume":"35","author":"Erling O.","year":"2012","unstructured":"Erling, O. Virtuoso, a hybrid RDBMS\/graph column store. Data Engineering Bulletin 35, 1 (2012), 3\u20138.","journal-title":"Data Engineering Bulletin"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082039"},{"key":"e_1_3_1_11_2","doi-asserted-by":"crossref","unstructured":"Francis N. et al. Cypher: An evolving query language for property graphs. In Proceedings of the 2018 SIGMOD Intern. Conf. Management of Data 1433\u20131445.","DOI":"10.1145\/3183713.3190657"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/367390.367400"},{"key":"e_1_3_1_13_2","article-title":"SPARQL 1.1 query language","author":"Harris S.","year":"2013","unstructured":"Harris, S., Seaborne, A., and Prud\u2019hommeaux, E. SPARQL 1.1 query language. W3C Recommendation, 2013; https:\/\/www.w3.org\/TR\/sparql11-query\/.","journal-title":"W3C Recommendation"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51580-5"},{"key":"e_1_3_1_15_2","volume-title":"Knowledge Graphs. Synthesis Lectures on Data, Semantics, and Knowledge","author":"Hogan A.","year":"2021","unstructured":"Hogan, A. et al. Knowledge Graphs. Synthesis Lectures on Data, Semantics, and Knowledge. Morgan & Claypool Publishers, 2021."},{"key":"e_1_3_1_16_2","doi-asserted-by":"crossref","unstructured":"Hogan A. Riveros C. Rojas C. and Soto A. A worst-case optimal join algorithm for SPARQL. In Proceedings of the 18th Intern. Semantic Web Conf. 2019 258\u2013275.","DOI":"10.1007\/978-3-030-30793-6_15"},{"key":"e_1_3_1_17_2","unstructured":"Kalinsky O. Etsion Y. and Kimelfeld B. Flexible caching in trie joins. In Proceedings of the 20th Intern. Conf. Extending Database Tech. 2017 282\u2013293."},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/2967101"},{"key":"e_1_3_1_19_2","doi-asserted-by":"crossref","unstructured":"Malyshev S. et al. Getting the most out of wikidata: Semantic technology usage in wikipedia\u2019s knowledge graph. In Proceedings of the 17th Intern. Semantic Web Conf. 2018 376\u2013394.","DOI":"10.1007\/978-3-030-00668-6_23"},{"key":"e_1_3_1_20_2","unstructured":"Manola F. and Miller E. W3C Recommendation 2004; http:\/\/www.w3.org\/TR\/rdf-primer\/."},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_3_1_23_2","unstructured":"Miller J.J. Graph database applications and concepts with Neo4j. In Proceedings of Southern Assoc. Info. Systems Conf. 2013 141\u2013147."},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2013.07.004"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316135228"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0165-y"},{"key":"e_1_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Ngo H.Q. Worst-case optimal join algorithms: Techniques results and open problems. In Proceedings of the 37th Symp. Principles of Database Systems 2018 111\u2013124.","DOI":"10.1145\/3196959.3196990"},{"key":"e_1_3_1_28_2","doi-asserted-by":"crossref","unstructured":"Ngo H.Q. Porat E. R\u00e9 C. and Rudra A. Worst-case optimal join algorithms. In Proceedings of the 31st Symp. Principles of Database Systems 2012 37\u201348.","DOI":"10.1145\/2213556.2213565"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_3_1_30_2","unstructured":"Nguyen D. et al. Join processing for graph patterns: An old dog with new tricks. In Proceedings of the 3rd Intern. Workshop on Graph Data Management Experiences and Systems 2015 2:1\u20132:8."},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.5555\/2846367"},{"key":"e_1_3_1_32_2","first-page":"193","volume-title":"Linked Data Management","author":"Thompson B.B.","year":"2014","unstructured":"Thompson, B.B., Personick, M., and Cutcher, M. The Bigdata\u00aeRDF graph database. Linked Data Management. Chapman and Hall\/CRC, 2014, 193\u2013237."},{"key":"e_1_3_1_33_2","unstructured":"Veldhuizen T.L. Triejoin: A simple worst-case optimal join algorithm. In Proceedings of the 17th Intern. Conf. Database Theory 2014 96\u2013106."},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/2629489"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1162\/dint_a_00229"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3653314","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3653314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:44:25Z","timestamp":1750290265000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3653314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":34,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10.1145\/3653314"],"URL":"https:\/\/doi.org\/10.1145\/3653314","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8]]},"assertion":[{"value":"2024-08-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}