{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T20:34:45Z","timestamp":1774038885617,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"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,23]]},"DOI":"10.1145\/3649329.3656235","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Accelerating Regular Path Queries over Graph Database with Processing-in-Memory"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9548-3767","authenticated-orcid":false,"given":"Ruoyan","family":"Ma","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2485-760X","authenticated-orcid":false,"given":"Shengan","family":"Zheng","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5322-2431","authenticated-orcid":false,"given":"Guifeng","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5152-5773","authenticated-orcid":false,"given":"Jin","family":"Pu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2321-367X","authenticated-orcid":false,"given":"Yifan","family":"Hua","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5128-5749","authenticated-orcid":false,"given":"Wentao","family":"Wang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1531-7962","authenticated-orcid":false,"given":"Linpeng","family":"Huang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2018. Benchmarking RedisGraph 1.0. https:\/\/redis.com\/blog\/new-redisgraph-1-0-achieves-600x-faster-performance-graph-databases\/."},{"key":"e_1_3_2_1_2_1","unstructured":"2023. GraphBLAS. https:\/\/graphblas.org\/."},{"key":"e_1_3_2_1_3_1","unstructured":"2023. Neo4J. https:\/\/neo4j.com\/."},{"key":"e_1_3_2_1_4_1","unstructured":"2023. RedisGraph. https:\/\/redis.io\/docs\/stack\/graph\/design\/."},{"key":"e_1_3_2_1_5_1","unstructured":"2023. SNAP dataset. http:\/\/snap.stanford.edu\/snap\/."},{"key":"e_1_3_2_1_6_1","unstructured":"2023. UPMEM Technology. https:\/\/www.upmem.com\/technology\/."},{"key":"e_1_3_2_1_7_1","unstructured":"Junwhan Ahn et al. 2015. A scalable processing-in-memory accelerator for parallel graph processing. In ISCA."},{"key":"e_1_3_2_1_8_1","unstructured":"Renzo Angles. 2018. The Property Graph Database Model.. In AMW."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Maciej Besta et al. 2023. The Graph Database Interface: Scaling Online Transactional and Analytical Graph Workloads to Hundreds of Thousands of Cores. In SC.","DOI":"10.1145\/3581784.3607068"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Hongzhi Chen et al. 2022. G-tran: a high performance distributed graph database with a decentralized architecture. VLDB (2022).","DOI":"10.14778\/3551793.3551813"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Faloutsos et al. 1999. On power-law relationships of the internet topology. ACM SIGCOMM COMP COM (1999).","DOI":"10.1145\/316188.316229"},{"key":"e_1_3_2_1_12_1","volume-title":"Syncron: Efficient synchronization support for near-data-processing architectures. In HPCA.","author":"Christina Giannoula","year":"2021","unstructured":"Christina Giannoula et al. 2021. Syncron: Efficient synchronization support for near-data-processing architectures. In HPCA."},{"key":"e_1_3_2_1_13_1","unstructured":"Juan G\u00f3mez-Luna et al. 2021. Benchmarking a new paradigm: An experimental analysis of a real processing-in-memory architecture. arXiv (2021)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Yu Huang et al. 2020. A heterogeneous PIM hardware-software co-design for energy-efficient graph processing. In IPDPS.","DOI":"10.1109\/IPDPS47924.2020.00076"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Hongbo Kang et al. 2023. PIM-tree: A Skew-resistant Index for Processing-in-Memory. In HOPC. 13--14.","DOI":"10.1145\/3597635.3598029"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Hongbo Kang et al. 2023. PIM-trie: A Skew-resistant Trie for Processing-in-Memory. In SPAA.","DOI":"10.1145\/3558481.3591070"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Jeremy Kepner et al. 2015. Graphs matrices and the GraphBLAS: Seven good reasons. Procedia Computer Science (2015).","DOI":"10.1016\/j.procs.2015.05.353"},{"key":"e_1_3_2_1_18_1","unstructured":"Changji Li et al. 2022. ByteGraph: a high-performance distributed graph database in ByteDance. VLDB (2022)."},{"key":"e_1_3_2_1_19_1","unstructured":"Wim Martens et al. 2022. Representing paths in graph database pattern matching. arXiv (2022)."},{"key":"e_1_3_2_1_20_1","volume-title":"Systems: Looking Beyond Moore and Von Neumann.","author":"Onur Mutlu","year":"2022","unstructured":"Onur Mutlu et al. 2022. A modern primer on processing in memory. In Emerging Computing: From Devices to Systems: Looking Beyond Moore and Von Neumann."},{"key":"e_1_3_2_1_21_1","volume-title":"Pareto distributions and Zipf's law. Contemporary physics","author":"Mark EJ","year":"2005","unstructured":"Mark EJ Newman. 2005. Power laws, Pareto distributions and Zipf's law. Contemporary physics (2005)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Evangelos Papalexakis et al. 2016. Power-Hop: a pervasive observation for real complex networks. PloS one (2016).","DOI":"10.1371\/journal.pone.0151027"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Isabelle Stanton et al. 2012. Streaming graph partitioning for large distributed graphs. In SIGKDD.","DOI":"10.1145\/2339530.2339722"},{"key":"e_1_3_2_1_24_1","volume-title":"The world of graph databases from an industry perspective. SIGMOD","author":"Yuanyuan Tian","year":"2023","unstructured":"Yuanyuan Tian. 2023. The world of graph databases from an industry perspective. SIGMOD (2023)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Luis Vaquero et al. 2013. Adaptive partitioning for large-scale dynamic graphs. In SOCC.","DOI":"10.1145\/2523616.2525943"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Mingxing Zhang et al. 2018. GraphP: Reducing communication for PIM-based graph processing with efficient data partition. In HPCA.","DOI":"10.1109\/HPCA.2018.00053"}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","location":"San Francisco CA USA","acronym":"DAC '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3656235","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3656235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:55Z","timestamp":1750295875000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3656235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":26,"alternative-id":["10.1145\/3649329.3656235","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3656235","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}