{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:20:39Z","timestamp":1768108839274,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T00:00:00Z","timestamp":1713744000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1955650, CNS-2053383, CCF-2028714, CCF-2002554, CCF-2226448"],"award-info":[{"award-number":["CNS-1955650, CNS-2053383, CCF-2028714, CCF-2002554, CCF-2226448"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,4,22]]},"DOI":"10.1145\/3627703.3629571","type":"proceedings-article","created":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T06:28:28Z","timestamp":1713421708000},"page":"18-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Core Graph: Exploiting Edge Centrality to Speedup the Evaluation of Iterative Graph Queries"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-1711-9269","authenticated-orcid":false,"given":"Xiaolin","family":"Jiang","sequence":"first","affiliation":[{"name":"CSE Department, UC Riverside USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9999-2529","authenticated-orcid":false,"given":"Mahbod","family":"Afarin","sequence":"additional","affiliation":[{"name":"CSE Department, UC Riverside USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2616-4241","authenticated-orcid":false,"given":"Zhijia","family":"Zhao","sequence":"additional","affiliation":[{"name":"CSE Department, UC Riverside USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9485-5370","authenticated-orcid":false,"given":"Nael","family":"Abu-Ghazaleh","sequence":"additional","affiliation":[{"name":"CSE Department, UC Riverside USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9348-3974","authenticated-orcid":false,"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[{"name":"CSE Department, UC Riverside USA"}]}],"member":"320","published-online":{"date-parts":[[2024,4,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Friendster data set. In http:\/\/konect.cc\/networks\/friendster\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Snap: Stanford network analysis platform. In https:\/\/snap.stanford.edu\/snap\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3575693.3575713"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3597635.3598022"},{"key":"e_1_3_2_1_5_1","volume-title":"Graph analytics on evolving data (abstract). In arXiv preprint arXiv:2308.14834","author":"Afarin Mahbod","year":"2023","unstructured":"Mahbod Afarin, Chao Gao, Shafiur Rahman, Nael Abu-Ghazaleh, and Rajiv Gupta. Graph analytics on evolving data (abstract). In arXiv preprint arXiv:2308.14834, 2023."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018756"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v4i1.14033"},{"key":"e_1_3_2_1_8_1","series-title":"SIAM Data Mining","volume-title":"R-mat: A recursive model for graph mining","author":"Chakrabarti Deepayan","year":"2004","unstructured":"Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. R-mat: A recursive model for graph mining. In SIAM Data Mining, 2004."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3613424.3614260"},{"key":"e_1_3_2_1_10_1","volume-title":"Morgan Kaufmann","author":"Golbeck Jennifer","year":"2013","unstructured":"Jennifer Golbeck. Analyzing the Social Web. Morgan Kaufmann, 2013."},{"key":"e_1_3_2_1_11_1","first-page":"17","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Gonzalez Joseph E","year":"2012","unstructured":"Joseph E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 17--30, 2012."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2017.41"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2017.48"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447786.3456226"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.15"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600227"},{"key":"e_1_3_2_1_17_1","first-page":"447","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Kim Min-Soo","year":"2016","unstructured":"Min-Soo Kim, Kyuhyeon An, Himchan Park, Hyunseok Seo, and Jinwook Kim. Gts: A fast and scalable graph processing method based on streaming topology to gpus. In Proceedings of the ACM SIGMOD International Conference on Management of Data, page 447--461, 2016."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2907294.2907312"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_20_1","first-page":"31","volume-title":"USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola, Guy E. Blelloch, and Carlos Guestrin. Graphchi: Large-scale graph computation on just a PC. In USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 31--46. USENIX Association, 2012."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304044"},{"key":"e_1_3_2_1_23_1","volume-title":"Graphlab: A new framework for parallel machine learning. arXiv preprint arXiv:1408.2041","author":"Low Yucheng","year":"2014","unstructured":"Yucheng Low, Joseph E Gonzalez, Aapo Kyrola, Danny Bickson, Carlos E Guestrin, and Joseph Hellerstein. Graphlab: A new framework for parallel machine learning. arXiv preprint arXiv:1408.2041, 2014."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9863-7_874"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_26_1","volume-title":"Introducing the graph 500","author":"Murphy Richard C","year":"2010","unstructured":"Richard C Murphy, Kyle B Wheeler, Brian W Barrett, and James A Ang. Introducing the graph 500. Cray Users Group (CUG), 19:45--74, 2010."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3296957.3173180"},{"key":"e_1_3_2_1_29_1","first-page":"56","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2020","author":"Pandey Santosh","year":"2020","unstructured":"Santosh Pandey, Lingda Li, Adolfy Hoisie, Xiaoye S. Li, and Hang Liu. C-SAW: a framework for graph sampling and random walk on gpus. In Christine Cuicchi, Irene Qualters, and William T. Kramer, editors, Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2020, Virtual Event \/ Atlanta, Georgia, USA, November 9-19, 2020, page 56. IEEE\/ACM, 2020."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480126"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_32_1","first-page":"1","volume-title":"Proceedings of the Fifteenth EuroSys Conference, EuroSys '20","author":"Nodehi Sabet Amir Hossein","year":"2020","unstructured":"Amir Hossein Nodehi Sabet, Zhijia Zhao, and Rajiv Gupta. Subway: minimizing data transfer during out-of-gpu-memory graph processing. In Proceedings of the Fifteenth EuroSys Conference, EuroSys '20, pages 12:1--12:16, 2020."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.16"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_35_1","volume-title":"Data analysis in public social networks","author":"Takac L.","year":"2012","unstructured":"L. Takac. Data analysis in public social networks. 2012."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037747"},{"key":"e_1_3_2_1_37_1","first-page":"507","volume-title":"USENIX Annual Technical Conference (USENIX ATC) 2016","author":"Vora Keval","year":"2016","unstructured":"Keval Vora, Guoqing Xu, and Rajiv Gupta. Load the edges you need: A generic I\/O optimization for disk-based graph processing. In Ajay Gulati and Hakim Weatherspoon, editors, USENIX Annual Technical Conference (USENIX ATC) 2016, Denver, CO, USA, June 22-24, 2016, pages 507--522. USENIX Association, 2016."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3108140"},{"key":"e_1_3_2_1_39_1","first-page":"1946","volume-title":"SIGMOD '21: International Conference on Management of Data","author":"Wang Ye","year":"2021","unstructured":"Ye Wang, Qing Wang, Henning Koehler, and Yu Lin. Query-by-sketch: Scaling shortest path graph queries on very large networks. In SIGMOD '21: International Conference on Management of Data, Virtual Event, China, June 20-25, 2021, pages 1946--1958. ACM, 2021."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304012"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359634"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3173162.3173208"},{"key":"e_1_3_2_1_43_1","volume-title":"USENIX Annual Technical Conference (USENIX ATC), July 8-10","author":"Zhu Xiaowei","year":"2015","unstructured":"Xiaowei Zhu, Wentao Han, and Wenguang Chen. Gridgraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning. In USENIX Annual Technical Conference (USENIX ATC), July 8-10, Santa Clara, CA, USA, pages 375--386, 2015."}],"event":{"name":"EuroSys '24: Nineteenth European Conference on Computer Systems","location":"Athens Greece","acronym":"EuroSys '24","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the Nineteenth European Conference on Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627703.3629571","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627703.3629571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T01:07:41Z","timestamp":1755824861000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627703.3629571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,22]]},"references-count":43,"alternative-id":["10.1145\/3627703.3629571","10.1145\/3627703"],"URL":"https:\/\/doi.org\/10.1145\/3627703.3629571","relation":{},"subject":[],"published":{"date-parts":[[2024,4,22]]},"assertion":[{"value":"2024-04-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}