Rule-Based Graph Cleaning with GPUs on a Single Machine
Summary: Rule-based graph cleaning on a single machine with GPU accel; MiniClean embeds ML predicates for discovery and correction. Memory-footprint reduction via bundling and compression; CPU-GPU-I/O pipeline with SIMD and parallelism to boost CPU-GPU synergy. (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; Shenzhen University; University of Edinburgh)
- 3. Shuhao Liu (Shenzhen University)
- 4. Kehan Pang (Beihang University)
- 5. Xiaoke Zhu (Beihang University)
- 6. Jiahui Jin (Southeast University)
BibTeX Citation
@inproceedings{bai_sigmod25,
title = {{Rule-Based Graph Cleaning with GPUs on a Single Machine}},
author = {Bai, Wenchao and Fan, Wenfei and Liu, Shuhao and Pang, Kehan and Zhu, Xiaoke and Jin, Jiahui},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3725303},
url = {https://dl.acm.org/doi/10.1145/3725303},
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 30 of 30 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,207 | GPU-based Graph Traversal on Compressed Graphs | 2019 | SIGMOD |
| 2 | 2,468 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD |
| 3 | 6,526 | CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression | 2023 | SIGMOD |
| 4 | 4,099 | Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining | 2011 | VLDB |
| 5 | 10,421 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 6 | 10,746 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |
| 7 | 10,882 | Efficient GPU-Accelerated Local Subgraph Counting | 2026 | VLDB |
| 8 | 9,806 | Making It Tractable to Catch Duplicates and Conflicts in Graphs | 2023 | SIGMOD |
| 9 | 7,521 | MiniGraph: Querying Big Graphs with a Single Machine | 2023 | VLDB |
| 10 | 11,156 | MiniClean: A Single-Machine System for Cleaning Big Graphs | 2025 | SIGMOD |