{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:15:39Z","timestamp":1779174939855,"version":"3.51.4"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"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":["SIGMOD Rec."],"published-print":{"date-parts":[[2023,6,7]]},"abstract":"<jats:p>Despite the wide adoption of graph processing across many different application domains, there is no underlying data structure that can serve a variety of graph workloads (analytics, traversals, and pattern matching) on dynamic graphs with single edge updates updates.<\/jats:p>","DOI":"10.1145\/3604437.3604442","type":"journal-article","created":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T22:22:01Z","timestamp":1686262921000},"page":"17-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Sortledton: a Universal Graph Data Structure"],"prefix":"10.1145","volume":"52","author":[{"given":"Per","family":"Fuchs","sequence":"first","affiliation":[{"name":"TU Munich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domagoj","family":"Margan","sequence":"additional","affiliation":[{"name":"Imperial College London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jana","family":"Giceva","sequence":"additional","affiliation":[{"name":"TU Munich \/\/ MDSI"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Direction-optimizing breadth-first search. Sci. Program., 21(3--4):137--148","author":"Beamer S.","year":"2013","unstructured":"S. Beamer , K. Asanovic , and D. A. Patterson . Direction-optimizing breadth-first search. Sci. Program., 21(3--4):137--148 , 2013 . S. Beamer, K. Asanovic, and D. A. Patterson. Direction-optimizing breadth-first search. Sci. Program., 21(3--4):137--148, 2013."},{"key":"e_1_2_1_2_1","volume-title":"The GAP benchmark suite. CoRR, abs\/1508.03619","author":"Beamer S.","year":"2015","unstructured":"S. Beamer , K. Asanovic , and D. A. Patterson . The GAP benchmark suite. CoRR, abs\/1508.03619 , 2015 . S. Beamer, K. Asanovic, and D. A. Patterson. The GAP benchmark suite. CoRR, abs\/1508.03619, 2015."},{"key":"e_1_2_1_3_1","first-page":"56","volume-title":"IEEE IISWC","author":"Beamer S.","year":"2015","unstructured":"S. Beamer , K. Asanovic , and D. A. Patterson . Locality exists in graph processing: Workload characterization on an ivy bridge server . In IEEE IISWC , pages 56 -- 65 , 2015 . S. Beamer, K. Asanovic, and D. A. Patterson. Locality exists in graph processing: Workload characterization on an ivy bridge server. In IEEE IISWC, pages 56--65, 2015."},{"key":"e_1_2_1_4_1","volume-title":"Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries. CoRR, abs\/1910.09017","author":"Besta M.","year":"2019","unstructured":"M. Besta , E. Peter , R. Gerstenberger , M. Fischer , M. Podstawski , C. Barthels , G. Alonso , and T. Hoefler . Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries. CoRR, abs\/1910.09017 , 2019 . M. Besta, E. Peter, R. Gerstenberger, M. Fischer, M. Podstawski, C. Barthels, G. Alonso, and T. Hoefler. Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries. CoRR, abs\/1910.09017, 2019."},{"key":"e_1_2_1_5_1","first-page":"1","volume-title":"ACM GRADES","author":"Capota M.","year":"2015","unstructured":"M. Capota , T. Hegeman , A. Iosup , A. Prat-P\u00b4erez , O. Erling , and P. A. Boncz . Graphalytics: A big data benchmark for graph-processing platforms . In ACM GRADES , pages 7: 1 -- 7 :6, 2015 . M. Capota, T. Hegeman, A. Iosup, A. Prat-P\u00b4erez, O. Erling, and P. A. Boncz. Graphalytics: A big data benchmark for graph-processing platforms. In ACM GRADES, pages 7:1--7:6, 2015."},{"key":"e_1_2_1_6_1","first-page":"142","volume-title":"Lock-free dynamically resizable arrays","author":"Dechev D.","year":"2006","unstructured":"D. Dechev , P. Pirkelbauer , and B. Stroustrup . Lock-free dynamically resizable arrays . In Springer OPODIS , volume 4305 , pages 142 -- 156 , 2006 . D. Dechev, P. Pirkelbauer, and B. Stroustrup. Lock-free dynamically resizable arrays. In Springer OPODIS, volume 4305, pages 142--156, 2006."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314598"},{"key":"e_1_2_1_8_1","volume-title":"Alibaba sponsor talk at VLDB","author":"Ding B.","year":"2020","unstructured":"B. Ding , K. Zeng , and W. Yu . Alibaba sponsor talk at VLDB , 2020 . B. Ding, K. Zeng, and W. Yu. Alibaba sponsor talk at VLDB, 2020."},{"key":"e_1_2_1_9_1","first-page":"1357","volume-title":"ACM SIGMOD","author":"dos Santos Dias V. V.","year":"2019","unstructured":"V. V. dos Santos Dias , C. H. C. Teixeira , D. O. Guedes , W. M. Jr. , and S. Parthasarathy . Fractal: A general-purpose graph pattern mining system . In ACM SIGMOD , pages 1357 -- 1374 , 2019 . V. V. dos Santos Dias, C. H. C. Teixeira, D. O. Guedes, W. M. Jr., and S. Parthasarathy. Fractal: A general-purpose graph pattern mining system. In ACM SIGMOD, pages 1357--1374, 2019."},{"key":"e_1_2_1_10_1","first-page":"1","volume-title":"IEEE HPEC","author":"Ediger D.","year":"2012","unstructured":"D. Ediger , R. McColl , E. J. Riedy , and D. A. Bader . STINGER: high performance data structure for streaming graphs . In IEEE HPEC , pages 1 -- 5 , 2012 . D. Ediger, R. McColl, E. J. Riedy, and D. A. Bader. STINGER: high performance data structure for streaming graphs. In IEEE HPEC, pages 1--5, 2012."},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1145\/2723372.2742786","volume-title":"ACM SIGMOD","author":"Erling O.","year":"2015","unstructured":"O. Erling , A. Averbuch , J. L. Larriba-Pey , H. Chafi , A. Gubichev , A. Prat-P\u00b4erez , M. Pham , and P. A. Boncz . The LDBC social network benchmark: Interactive workload . In ACM SIGMOD , pages 619 -- 630 , 2015 . O. Erling, A. Averbuch, J. L. Larriba-Pey, H. Chafi, A. Gubichev, A. Prat-P\u00b4erez, M. Pham, and P. A. Boncz. The LDBC social network benchmark: Interactive workload. In ACM SIGMOD, pages 619--630, 2015."},{"key":"e_1_2_1_12_1","volume-title":"Integrating column-oriented storage and query processing techniques into graph database management systems. CoRR, abs\/2103.02284","author":"Gupta P.","year":"2021","unstructured":"P. Gupta , A. Mhedhbi , and S. Salihoglu . Integrating column-oriented storage and query processing techniques into graph database management systems. CoRR, abs\/2103.02284 , 2021 . P. Gupta, A. Mhedhbi, and S. Salihoglu. Integrating column-oriented storage and query processing techniques into graph database management systems. CoRR, abs\/2103.02284, 2021."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733010"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562164.1562188"},{"key":"e_1_2_1_15_1","first-page":"249","volume-title":"USENIX FAST","author":"Kumar P.","year":"2019","unstructured":"P. Kumar and H. H. Huang . Graphone: A data store for real-time analytics on evolving graphs . In USENIX FAST , pages 249 -- 263 , 2019 . P. Kumar and H. H. Huang. Graphone: A data store for real-time analytics on evolving graphs. In USENIX FAST, pages 249--263, 2019."},{"key":"e_1_2_1_16_1","first-page":"1","volume-title":"ACM GRADES-NDA","author":"Leo D. D.","year":"2019","unstructured":"D. D. Leo and P. A. Boncz . Fast concurrent reads and updates with pmas . In ACM GRADES-NDA , pages 8: 1 -- 8 :8, 2019 . D. D. Leo and P. A. Boncz. Fast concurrent reads and updates with pmas. In ACM GRADES-NDA, pages 8:1--8:8, 2019."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447708"},{"key":"e_1_2_1_18_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_2_1_19_1","first-page":"363","volume-title":"IEEE ICDE","author":"Macko P.","year":"2015","unstructured":"P. Macko , V. J. Marathe , D. W. Margo , and M. I. Seltzer . LLAMA: efficient graph analytics using large multiversioned arrays . In IEEE ICDE , pages 363 -- 374 , 2015 . P. Macko, V. J. Marathe, D. W. Margo, and M. I. Seltzer. LLAMA: efficient graph analytics using large multiversioned arrays. In IEEE ICDE, pages 363--374, 2015."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_2_1_21_1","first-page":"1372","volume-title":"SIGMOD '21: International Conference on Management of Data","author":"Pandey P.","year":"2021","unstructured":"P. Pandey , B. Wheatman , H. Xu , and A. Bulu\u00b8c . Terrace: A hierarchical graph container for skewed dynamic graphs. In G. Li, Z. Li, S. Idreos, and D. Srivastava, editors , SIGMOD '21: International Conference on Management of Data , Virtual Event, China, June 20--25 , 2021 , pages 1372 -- 1385 . ACM, 2021. P. Pandey, B. Wheatman, H. Xu, and A. Bulu\u00b8c. Terrace: A hierarchical graph container for skewed dynamic graphs. In G. Li, Z. Li, S. Idreos, and D. Srivastava, editors, SIGMOD '21: International Conference on Management of Data, Virtual Event, China, June 20--25, 2021, pages 1372--1385. ACM, 2021."},{"key":"e_1_2_1_22_1","first-page":"1579","volume-title":"IEEE ICDCS","author":"Platz K.","year":"2019","unstructured":"K. Platz , N. Mittal , and S. Venkatesan . Concurrent unrolled skiplist . In IEEE ICDCS , pages 1579 -- 1589 , 2019 . K. Platz, N. Mittal, and S. Venkatesan. Concurrent unrolled skiplist. In IEEE ICDCS, pages 1579--1589, 2019."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"key":"e_1_2_1_24_1","volume-title":"Intel threading building blocks - outfitting C++ for multi-core processor parallelism. O'Reilly","author":"Reinders J.","year":"2007","unstructured":"J. Reinders . Intel threading building blocks - outfitting C++ for multi-core processor parallelism. O'Reilly , 2007 . J. Reinders. Intel threading building blocks - outfitting C++ for multi-core processor parallelism. O'Reilly, 2007."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164139"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007267"},{"key":"e_1_2_1_27_1","first-page":"135","volume-title":"ACM SIGPLAN PPoPP","author":"Shun J.","year":"2013","unstructured":"J. Shun and G. E. Blelloch . Ligra: a lightweight graph processing framework for shared memory . In ACM SIGPLAN PPoPP , pages 135 -- 146 , 2013 . J. Shun and G. E. Blelloch. Ligra: a lightweight graph processing framework for shared memory. In ACM SIGPLAN PPoPP, pages 135--146, 2013."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384351"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604437.3604442","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3604437.3604442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:18Z","timestamp":1750178838000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604437.3604442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,7]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,6,7]]}},"alternative-id":["10.1145\/3604437.3604442"],"URL":"https:\/\/doi.org\/10.1145\/3604437.3604442","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":[],"published":{"date-parts":[[2023,6,7]]},"assertion":[{"value":"2023-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}