MiniClean: A Single-Machine System for Cleaning Big Graphs
Summary: MiniClean is a single-machine graph cleaning system unifying rule-based reasoning with ML for error detection and correction on billion-scale graphs. A CPU–GPU pipeline with memory bundling and compression, plus SIMD/pipelined/independent parallelism, delivers ~8x speedup vs a 32-node cluster. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Wenchao Bai (Southeast University)
- 2. Wenfei Fan (Beihang University; University of Edinburgh)
- 3. Jiahui Jin (Southeast University)
- 4. Daji Li (Shenzhen University)
- 5. Jian Li (Shenzhen University)
- 6. Shuhao Liu (Shenzhen University)
- 7. Mingliang Ouyang (Shenzhen University)
- 8. Qiang Yuan (Shenzhen University)
BibTeX Citation
@inproceedings{bai_sigmod25,
title = {{MiniClean: A Single-Machine System for Cleaning Big Graphs}},
author = {Bai, Wenchao and Fan, Wenfei and Jin, Jiahui and Li, Daji and Li, Jian and Liu, Shuhao and Ouyang, Mingliang and Yuan, Qiang},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3722212.3725115},
url = {https://dl.acm.org/doi/10.1145/3722212.3725115},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 141 | Deep Entity Matching with Pre-Trained Language Models | 2021 | VLDB | 0.0002964847 |
| 2,915 | GraphScope: A Unified Engine For Big Graph Processing | 2021 | VLDB | 7.9666977e-05 |
| 3,642 | CoroGraph: Bridging Cache Efficiency and Work Efficiency for Graph Algorithm Execution | 2024 | VLDB | 7.2312616e-05 |
| 7,380 | MiniGraph: Querying Big Graphs with a Single Machine | 2023 | VLDB | 5.6288836e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,564 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |
| 2 | 9,437 | GIDCL: A Graph-Enhanced Interpretable Data Cleaning Framework with Large Language Models | 2024 | SIGMOD |
| 3 | 10,205 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 4 | 6,408 | CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression | 2023 | SIGMOD |
| 5 | 2,398 | BigDansing: A System for Big Data Cleansing | 2015 | SIGMOD |
| 6 | 7,179 | CleanM: An Optimizable Query Language for Unified Scale-Out Data Cleaning | 2017 | VLDB |
| 7 | 10,966 | UniClean: A Scalable Data Cleaning Solution for Mixed Errors based on Unified Cleaners and Optimized Cleaning Workflow | 2025 | VLDB |
| 8 | 9,627 | Making It Tractable to Catch Duplicates and Conflicts in Graphs | 2023 | SIGMOD |
| 9 | 7,380 | MiniGraph: Querying Big Graphs with a Single Machine | 2023 | VLDB |
| 10 | 10,763 | Rule-Based Graph Cleaning with GPUs on a Single Machine | 2025 | SIGMOD |