RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning
Summary: RP-DBSCAN uses pseudo random, cell-based partitioning to balance load in parallel DBSCAN on skewed data. Compact two-level cell dictionary enables local clustering with light cross-partition merge on Spark, yielding up to 180x speedup. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hwanjun Song
- 2. Jae-Gil Lee
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,417 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD | 5.5162242e-05 |
| 6,045 | DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows | 2022 | SIGMOD | 5.2360534e-05 |
| 7,479 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD | 4.7135369e-05 |
| 11,184 | Fast Density-Based Clustering: Geometric Approach | 2023 | SIGMOD | 4.1905499e-05 |
| 11,333 | The Gibbs–Rand Model | 2022 | PODS | 4.1905499e-05 |
| 11,469 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD | 4.1905499e-05 |
| 11,481 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD | 4.1905499e-05 |
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 |
|---|---|---|---|---|
| 263 | OPTICS: Ordering Points To Identify the Clustering Structure | 1999 | SIGMOD | 0.00029955858 |
| 918 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD | 0.00015286593 |
| 2,669 | NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data | 2017 | VLDB | 8.3429208e-05 |
| 3,078 | Dynamic Density Based Clustering | 2017 | SIGMOD | 7.6041723e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,001 | A Partitioning Framework for Aggressive Data Skipping | 2014 | VLDB | 4.1905499e-05 |
| 918 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD | 0.00015286593 |
| 3,078 | Dynamic Density Based Clustering | 2017 | SIGMOD | 7.6041723e-05 |
| 11,481 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD | 4.1905499e-05 |
| 2,669 | NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data | 2017 | VLDB | 8.3429208e-05 |
| 11,469 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD | 4.1905499e-05 |
| 7,479 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD | 4.7135369e-05 |
| 10,480 | Approximate DBSCAN under Differential Privacy | 2025 | SIGMOD | 4.1905499e-05 |
| 11,184 | Fast Density-Based Clustering: Geometric Approach | 2023 | SIGMOD | 4.1905499e-05 |
| 5,417 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD | 5.5162242e-05 |