{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:51:49Z","timestamp":1757631109206,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62232004"],"award-info":[{"award-number":["62232004"]}],"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":[[2025,6,22]]},"DOI":"10.1145\/3722212.3725115","type":"proceedings-article","created":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T09:00:26Z","timestamp":1750150826000},"page":"27-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["MiniClean: A Single-Machine System for Cleaning Big Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1632-4347","authenticated-orcid":false,"given":"Wenchao","family":"Bai","sequence":"first","affiliation":[{"name":"Southeast University, Nanjing, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5149-2656","authenticated-orcid":false,"given":"Wenfei","family":"Fan","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Computing Sciences, Shenzhen, Guangdong, China, University of Edinburgh, Edinburgh, Scotland, United Kingdom, and Beihang University, Beijing, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9570-1456","authenticated-orcid":false,"given":"Jiahui","family":"Jin","sequence":"additional","affiliation":[{"name":"Southeast University, Nanjing, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2858-8483","authenticated-orcid":false,"given":"Daji","family":"Li","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Computing Sciences, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2184-7099","authenticated-orcid":false,"given":"Jian","family":"Li","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Computing Sciences, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4892-0979","authenticated-orcid":false,"given":"Shuhao","family":"Liu","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Computing Sciences, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1367-5465","authenticated-orcid":false,"given":"Mingliang","family":"Ouyang","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Computing Sciences, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-7101-9267","authenticated-orcid":false,"given":"Qiang","family":"Yuan","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Computing Sciences, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2024. The BioGRID Database. https:\/\/thebiogrid.org\/."},{"key":"e_1_3_2_2_2_1","unstructured":"2024. SemanticScholar Academic Graph. https:\/\/www.semanticscholar.org\/."},{"key":"e_1_3_2_2_3_1","unstructured":"Congcong Ge et al. 2020. KGClean: An Embedding Powered Knowledge Graph Cleaning Framework. CoRR abs\/2004.14478 (2020)."},{"key":"e_1_3_2_2_4_1","first-page":"2879","article-title":"GraphScope: A Unified Engine For Big Graph Processing","volume":"14","author":"Wenfei Fan","year":"2021","unstructured":"Wenfei Fan et al. 2021. GraphScope: A Unified Engine For Big Graph Processing. PVLDB 14, 12 (2021), 2879--2892.","journal-title":"PVLDB"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Wenfei Fan et al. 2025. Making It Tractable to to Detect and Correct Errors in Graphs. ACM Trans. on Database Systems (2025) 16:1--16:75.","DOI":"10.1145\/3702315"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Xiangxiang Zeng et al. 2022. Toward better drug discovery with knowledge graph. Current opinion in structural biology 72 (2022) 114--126.","DOI":"10.1016\/j.sbi.2021.09.003"},{"key":"e_1_3_2_2_7_1","first-page":"891","article-title":"CoroGraph: Bridging Cache Efficiency and Work Efficiency for Graph Algorithm Execution","volume":"17","author":"Xiangyu Zhi","year":"2023","unstructured":"Xiangyu Zhi et al. 2023. CoroGraph: Bridging Cache Efficiency and Work Efficiency for Graph Algorithm Execution. PVLDB 17, 4 (2023), 891--903.","journal-title":"PVLDB"},{"key":"e_1_3_2_2_8_1","first-page":"2172","article-title":"MiniGraph: Querying Big Graphs with a Single Machine","volume":"16","author":"Xiaoke Zhu","year":"2023","unstructured":"Xiaoke Zhu et al. 2023. MiniGraph: Querying Big Graphs with a Single Machine. PVLDB 16, 9 (2023), 2172--2185.","journal-title":"PVLDB"},{"key":"e_1_3_2_2_9_1","first-page":"50","article-title":"Deep Entity Matching with Pre-Trained Language Models","volume":"14","author":"Yuliang Li","year":"2020","unstructured":"Yuliang Li et al. 2020. Deep Entity Matching with Pre-Trained Language Models. PVLDB 14, 1 (2020), 50--60.","journal-title":"PVLDB"},{"key":"e_1_3_2_2_10_1","first-page":"1","article-title":"Fishing Fort:ASystem for Graph Analytics with ML Prediction and Logic Deduction. In The Provenance of Elegance in Computation - Essays Dedicated to Val Tannen","volume":"6","author":"Fan Wenfei","year":"2024","unstructured":"Wenfei Fan and Shuhao Liu. 2024. Fishing Fort:ASystem for Graph Analytics with ML Prediction and Logic Deduction. In The Provenance of Elegance in Computation - Essays Dedicated to Val Tannen. Schloss Dagstuhl, 6:1--6:18.","journal-title":"Schloss Dagstuhl"},{"key":"e_1_3_2_2_11_1","first-page":"1","article-title":"Blaze","volume":"44","author":"Kim Juno","year":"2022","unstructured":"Juno Kim and Steven Swanson. 2022. Blaze: Fast Graph Processing on Fast SSDs. In SC. 44:1--44:15.","journal-title":"Fast Graph Processing on Fast SSDs. In SC."}],"event":{"name":"SIGMOD\/PODS '25: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Berlin Germany","acronym":"SIGMOD\/PODS '25"},"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.3725115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:40:00Z","timestamp":1757544000000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3722212.3725115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":11,"alternative-id":["10.1145\/3722212.3725115","10.1145\/3722212"],"URL":"https:\/\/doi.org\/10.1145\/3722212.3725115","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"}}]}}