Theoretically-Efficient and Practical Parallel DBSCAN
Summary: Theoretically-efficient, practical parallel DBSCAN for Euclidean data with exact and approximate variants that match sequential work bounds and achieve polylogarithmic depth. Implementations and experiments on multi-core hardware show up to 33x speedups over the best sequential algorithms and clear gains over prior parallel methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yiqiu Wang
- 2. Yan Gu
- 3. Julian Shun
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,045 | DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows | 2022 | SIGMOD | 5.2360534e-05 |
| 6,882 | Theoretically and Practically Efficient Parallel Nucleus Decomposition | 2022 | VLDB | 4.8923998e-05 |
| 7,479 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD | 4.7135369e-05 |
| 9,861 | Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs | 2020 | VLDB | 4.2642656e-05 |
| 11,184 | Fast Density-Based Clustering: Geometric Approach | 2023 | SIGMOD | 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 3 of 3 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 |
| 2,669 | NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data | 2017 | VLDB | 8.3429208e-05 |
| 3,296 | RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning | 2018 | SIGMOD | 7.2553154e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,803 | Incremental Clustering for Mining in a Data Warehousing Environment | 1998 | VLDB | 0.00010481475 |
| 3,078 | Dynamic Density Based Clustering | 2017 | SIGMOD | 7.6041723e-05 |
| 2,669 | NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data | 2017 | VLDB | 8.3429208e-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 |
| 11,469 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD | 4.1905499e-05 |
| 3,296 | RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning | 2018 | SIGMOD | 7.2553154e-05 |
| 918 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD | 0.00015286593 |
| 7,479 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD | 4.7135369e-05 |
| 11,481 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD | 4.1905499e-05 |