{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:08:11Z","timestamp":1775912891152,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1145\/3722212.3724439","type":"proceedings-article","created":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T09:00:26Z","timestamp":1750150826000},"page":"391-403","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["GES: High-Performance Graph Processing Engine and Service in Huawei"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2151-9969","authenticated-orcid":false,"given":"Sen","family":"Gao","sequence":"first","affiliation":[{"name":"Huawei &amp; SJTU, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8929-0395","authenticated-orcid":false,"given":"Jianwen","family":"Zhao","sequence":"additional","affiliation":[{"name":"Huawei, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0026-9283","authenticated-orcid":false,"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Huawei, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4060-9438","authenticated-orcid":false,"given":"Shixuan","family":"Sun","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5253-7674","authenticated-orcid":false,"given":"Chen","family":"Liang","sequence":"additional","affiliation":[{"name":"Huawei, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9944-414X","authenticated-orcid":false,"given":"Gongye","family":"Chen","sequence":"additional","affiliation":[{"name":"Huawei, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1900-6487","authenticated-orcid":false,"given":"Wenliang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Huawei, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-8523-5487","authenticated-orcid":false,"given":"Bo","family":"Ren","sequence":"additional","affiliation":[{"name":"Huawei, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8409-2688","authenticated-orcid":false,"given":"Chao","family":"Liu","sequence":"additional","affiliation":[{"name":"Huawei, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9997-3901","authenticated-orcid":false,"given":"Chenyi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Huawei, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5832-0347","authenticated-orcid":false,"given":"Quan","family":"Chen","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6218-4659","authenticated-orcid":false,"given":"Chao","family":"Li","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5660-5493","authenticated-orcid":false,"given":"Jingwen","family":"Leng","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0034-2302","authenticated-orcid":false,"given":"Minyi","family":"Guo","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"AgensGraph. 2025. AgensGraph Database. https:\/\/bitnine.net\/agensgraph\/. Accessed: 2025-04--13."},{"key":"e_1_3_2_1_2_1","volume-title":"ISWC (1) (Lecture Notes in Computer Science","author":"Alu\u00e7 G\u00fcnes","unstructured":"G\u00fcnes Alu\u00e7, Olaf Hartig, M. Tamer \u00d6zsu, and Khuzaima Daudjee. 2014. Diversified Stress Testing of RDF Data Management Systems. In ISWC (1) (Lecture Notes in Computer Science, Vol. 8796). Springer, 197--212."},{"key":"e_1_3_2_1_3_1","unstructured":"Amazon Web Services. 2025. Amazon Neptune. https:\/\/aws.amazon.com\/neptune\/. Accessed: 2025-04--13."},{"key":"e_1_3_2_1_4_1","first-page":"223","article-title":"An Introduction to Graph Data Management","volume":"36","author":"Angles Renzo","year":"2011","unstructured":"Renzo Angles and Claudio Guti\u00e9rrez. 2011. An Introduction to Graph Data Management. Information Systems 36, 4 (2011), 223--246.","journal-title":"Information Systems"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2022.105766"},{"key":"e_1_3_2_1_6_1","volume-title":"gMark: Schema-Driven Generation of Graphs and Queries","author":"Bagan Guillaume","unstructured":"Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aur\u00e9lien Lemay, and Nicky Advokaat. 2017. gMark: Schema-Driven Generation of Graphs and Queries. In ICDE. IEEE Computer Society, 63--64."},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data. ACM","author":"Bakibayev Nazim","year":"2012","unstructured":"Nazim Bakibayev, Dan Olteanu, and J\u00e1n Z\u00e1vodn\u00fd. 2012. Factorized Representations of Query Results: Size Bounds and Readability. In Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data. ACM, New York, NY, USA, 325--336."},{"key":"e_1_3_2_1_8_1","volume-title":"Graph Data Management","author":"Bonifati Angela","unstructured":"Angela Bonifati, George H. L. Fletcher, Jan Hidders, and Alexandru Iosup. 2018. A Survey of Benchmarks for Graph-Processing Systems. In Graph Data Management. Springer, 163--186."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742786"},{"key":"e_1_3_2_1_11_1","volume-title":"The LDBC Social Network Benchmark: Interactive Workload. In SIGMOD Conference. ACM, 619--630","author":"Erling Orri","unstructured":"Orri Erling, Alex Averbuch, Josep Llu\u00eds Larriba-Pey, Hassan Chafi, Andrey Gubichev, Arnau Prat-P\u00e9rez, Minh-Duc Pham, and Peter A. Boncz. 2015. The LDBC Social Network Benchmark: Interactive Workload. In SIGMOD Conference. ACM, 619--630."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476311.3476369"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2489791"},{"key":"e_1_3_2_1_14_1","unstructured":"GraphDB. 2025. GraphDB. https:\/\/www.ontotext.com\/products\/graphdb\/. Accessed: 2025-04--13."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476297"},{"key":"e_1_3_2_1_16_1","volume-title":"GES: High-Performance Graph Processing Engine and Service in Huawei (Technical Report). https:\/\/github.com\/Gawssin\/GES\/blob\/main\/GES_Technical_Report.pdf.","year":"2025","unstructured":"Huawei. 2025. GES: High-Performance Graph Processing Engine and Service in Huawei (Technical Report). https:\/\/github.com\/Gawssin\/GES\/blob\/main\/GES_Technical_Report.pdf."},{"key":"e_1_3_2_1_17_1","unstructured":"JanusGraph Community. 2025. JanusGraph: Distributed Graph Database. https:\/\/janusgraph.org\/. Accessed: 2025-04--13."},{"key":"e_1_3_2_1_18_1","unstructured":"Guodong Jin Xiyang Feng Ziyi Chen Chang Liu and Semih Salihoglu. 2023. K\u00d9ZU Graph Database Management System. In CIDR. www.cidrdb.org."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056445"},{"key":"e_1_3_2_1_20_1","unstructured":"LDBC. 2021. LDBC SNB Datagen Hadoop. https:\/\/github.com\/ldbc\/ldbc_snb_datagen_hadoop."},{"key":"e_1_3_2_1_21_1","unstructured":"LDBC. 2021. LDBC SNB Specification. https:\/\/ldbcouncil.org\/ldbc_snb_docs\/ldbcsnb-specification.pdf."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554824"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3297753.3297759"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151113.3151114"},{"key":"e_1_3_2_1_26_1","first-page":"1","article-title":"LSQB: a large-scale subgraph query benchmark. In GRADES-NDA@SIGMOD","volume":"8","author":"Mhedhbi Amine","year":"2021","unstructured":"Amine Mhedhbi, Matteo Lissandrini, Laurens Kuiper, Jack Waudby, and G\u00e1bor Sz\u00e1rnyas. 2021. LSQB: a large-scale subgraph query benchmark. In GRADES-NDA@SIGMOD. ACM, 8:1--8:11.","journal-title":"ACM"},{"key":"e_1_3_2_1_27_1","first-page":"516","article-title":"Factorized Databases Meet Big Data: A Survey","volume":"27","author":"Nakai Shunsuke","year":"2019","unstructured":"Shunsuke Nakai and Hiroyuki Kitagawa. 2019. Factorized Databases Meet Big Data: A Survey. Journal of Information Processing 27 (2019), 516--526.","journal-title":"Journal of Information Processing"},{"key":"e_1_3_2_1_28_1","unstructured":"Neo4j. 2021. Neo4j Graph Database Platform. https:\/\/neo4j.com\/. Accessed: 2021--10-01."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3003665.3003667"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656335"},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the VLDB Endowment","volume":"5","author":"Olteanu Dan","year":"2012","unstructured":"Dan Olteanu and J\u00e1n Z\u00e1vodn\u00fd. 2012. Factorized Representations of Uncertain and Probabilistic Databases. In Proceedings of the VLDB Endowment, Vol. 5. VLDB Endowment, 1796--1807."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656335"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3603581.3603604"},{"key":"e_1_3_2_1_34_1","unstructured":"PostgreSQL. 2025. PostgreSQL Database. https:\/\/www.postgresql.org\/. Accessed: 2025-04--13."},{"key":"e_1_3_2_1_35_1","volume-title":"Graph Databases: New Opportunities for Connected Data","author":"Robinson Ian","year":"2015","unstructured":"Ian Robinson, Jim Webber, and Emil Eifrem. 2015. Graph Databases: New Opportunities for Connected Data (2nd ed.). O'Reilly Media, Inc.","edition":"2"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3324961"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882939"},{"key":"e_1_3_2_1_38_1","volume-title":"Carey","author":"Shekita Eugene J.","year":"1990","unstructured":"Eugene J. Shekita and Michael J. Carey. 1990. A Performance Evaluation of Pointer-Based Joins. In SIGMOD Conference. ACM Press, 300--311."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10270-016-0571-8"},{"key":"e_1_3_2_1_40_1","unstructured":"TigerGraph. 2025. TigerGraph Database. https:\/\/www.tigergraph.com\/. Accessed: 2025-04--13."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Ke Tu Wei Qu Zhengwei Wu Zhiqiang Zhang Zhongyi Liu Yiming Zhao Le Wu Jun Zhou and Guannan Zhang. 2023. Disentangled Interest importance aware Knowledge Graph Neural Network for Fund Recommendation. In CIKM. ACM 2482--2491.","DOI":"10.1145\/3583780.3614846"},{"key":"e_1_3_2_1_42_1","unstructured":"TuGraph. 2025. TuGraph Database. https:\/\/tugraph.tech\/. Accessed: 2025-04--13."},{"key":"e_1_3_2_1_43_1","volume-title":"KSEM (1) (Lecture Notes in Computer Science","author":"Wang Ran","unstructured":"Ran Wang, Zhengyi Yang, Wenjie Zhang, and Xuemin Lin. 2020. An Empirical Study on Recent Graph Database Systems. In KSEM (1) (Lecture Notes in Computer Science, Vol. 12274). Springer, 328--340."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.109"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_1_46_1","first-page":"396","article-title":"A Review of Knowledge Graph","volume":"13","author":"Zamini Mohamad","year":"2022","unstructured":"Mohamad Zamini, Hassan Reza, and Minou Rabiei. 2022. A Review of Knowledge Graph Completion. Inf. 13, 8 (2022), 396.","journal-title":"Completion. Inf."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Zhilun Zhou Yu Liu Jingtao Ding Depeng Jin and Yong Li. 2023. Hierarchical Knowledge Graph Learning Enabled Socioeconomic Indicator Prediction in Location-Based Social Network. In WWW. ACM 122--132.","DOI":"10.1145\/3543507.3583239"},{"key":"e_1_3_2_1_48_1","first-page":"264","article-title":"Graph Pattern Matching: A Survey","volume":"7","author":"Zou Lijun","year":"2013","unstructured":"Lijun Zou, Lei Chen, and M. Tamer \u00d6zsu. 2013. Graph Pattern Matching: A Survey. Frontiers of Computer Science 7, 3 (2013), 264--277.","journal-title":"Frontiers of Computer Science"}],"event":{"name":"SIGMOD\/PODS '25: International Conference on Management of Data","location":"Berlin Germany","acronym":"SIGMOD\/PODS '25","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Companion of the 2025 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3722212.3724439","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:37:22Z","timestamp":1757543842000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3722212.3724439"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":48,"alternative-id":["10.1145\/3722212.3724439","10.1145\/3722212"],"URL":"https:\/\/doi.org\/10.1145\/3722212.3724439","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]},"assertion":[{"value":"2025-06-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}