{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:47:56Z","timestamp":1765547276972,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T00:00:00Z","timestamp":1717891200000},"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":[[2024,6,14]]},"DOI":"10.1145\/3661304.3661898","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T09:12:06Z","timestamp":1717578726000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Space & Time Efficient Leapfrog Triejoin"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2509-8097","authenticated-orcid":false,"given":"Diego","family":"Arroyuelo","sequence":"first","affiliation":[{"name":"DCC, PUC Chile & IMFD, Santiago, Chile"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3004-9130","authenticated-orcid":false,"given":"Daniela","family":"Campos","sequence":"additional","affiliation":[{"name":"DCC, University of Chile, Santiago, Chile"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1216-2176","authenticated-orcid":false,"given":"Adri\u00e1n","family":"G\u00f3mez-Brand\u00f3n","sequence":"additional","affiliation":[{"name":"Universidade da Coru\u00f1a & IMFD, A Coru\u00f1a, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2286-741X","authenticated-orcid":false,"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[{"name":"DCC, University of Chile & IMFD, Santiago, Chile"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3328-9256","authenticated-orcid":false,"given":"Carlos","family":"Rojas","sequence":"additional","affiliation":[{"name":"IMFD, Santiago, Chile"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5854-2652","authenticated-orcid":false,"given":"Domagoj","family":"Vrgo\u010d","sequence":"additional","affiliation":[{"name":"IMC, PUC Chile & IMFD, Santiago, Chile"}]}],"member":"320","published-online":{"date-parts":[[2024,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056105"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457256"},{"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\/3308558.3313472"},{"key":"e_1_3_2_1_6_1","unstructured":"D. Clark. Compact Pat Trees. PhD thesis University of Waterloo 1996."},{"key":"e_1_3_2_1_7_1","volume-title":"a hybrid RDBMS\/graph column store. Data Engineering Bulletin, 35(1):3--8","author":"Erling O.","year":"2012","unstructured":"O. Erling. Virtuoso, a hybrid RDBMS\/graph column store. Data Engineering Bulletin, 35(1):3--8, 2012."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407797"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303979"},{"issue":"1","key":"e_1_3_2_1_10_1","first-page":"W3C","volume":"1","author":"Harris S.","year":"2013","unstructured":"S. Harris, A. Seaborne, and E. Prud'hommeaux. SPARQL 1.1 Query Language. W3C Recommendation, 2013. https:\/\/www.w3.org\/TR\/sparql11-query\/.","journal-title":"SPARQL"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30793-6_15"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63533"},{"key":"e_1_3_2_1_13_1","first-page":"282","volume-title":"Proc. 20th International Conference on Extending Database Technology (EDBT)","author":"Kalinsky O.","year":"2017","unstructured":"O. Kalinsky, Y. Etsion, and B. Kimelfeld. Flexible caching in trie joins. In Proc. 20th International Conference on Extending Database Technology (EDBT), pages 282--293, 2017."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2967101"},{"key":"e_1_3_2_1_15_1","unstructured":"J. Leskovec. Stanford Large Network Dataset Collection: LiveJournal social network. https:\/\/snap.stanford.edu\/data\/soc-LiveJournal1.html."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00668-6_23"},{"key":"e_1_3_2_1_17_1","first-page":"w3","author":"Manola F.","year":"2004","unstructured":"F. Manola and E. Miller. RDF Primer. W3C Recommendation. 2004. http:\/\/www.w3.org\/TR\/rdf-primer\/.","journal-title":"RDF Primer. W3C Recommendation."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62034-6_35"},{"key":"e_1_3_2_1_20_1","volume-title":"Fully-functional static and dynamic succinct trees. ACM Transactions on Algorithms, 10(3):article 16","author":"Navarro G.","year":"2014","unstructured":"G. Navarro and K. Sadakane. Fully-functional static and dynamic succinct trees. ACM Transactions on Algorithms, 10(3):article 16, 2014."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0165-y"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196990"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213565"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764947.2764948"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/582095.582099"},{"key":"e_1_3_2_1_27_1","first-page":"193","volume-title":"Linked Data Management","author":"Thompson B. B.","year":"2014","unstructured":"B. B. Thompson, M. Personick, and M. Cutcher. The Bigdata\u00aeRDF Graph Database. In Linked Data Management, pages 193--237. Chapman and Hall\/CRC, 2014."},{"key":"e_1_3_2_1_28_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 Proc. 17th International Conference on Database Theory (ICDT), pages 96--106, 2014."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629489"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1162\/dint_a_00229"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3611479.3611489"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589295"},{"key":"e_1_3_2_1_33_1","first-page":"82","volume-title":"Proc. 7th International Conference on Very Large Databases (VLDB)","author":"Yannakakis M.","year":"1981","unstructured":"M. Yannakakis. Algorithms for acyclic database schemes. In Proc. 7th International Conference on Very Large Databases (VLDB), pages 82--94, 1981."}],"event":{"name":"SIGMOD\/PODS '24: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Santiago AA Chile","acronym":"SIGMOD\/PODS '24"},"container-title":["Proceedings of the 7th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3661304.3661898","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3661304.3661898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T20:31:57Z","timestamp":1755981117000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3661304.3661898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,9]]},"references-count":33,"alternative-id":["10.1145\/3661304.3661898","10.1145\/3661304"],"URL":"https:\/\/doi.org\/10.1145\/3661304.3661898","relation":{},"subject":[],"published":{"date-parts":[[2024,6,9]]},"assertion":[{"value":"2024-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}