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 (Massachusetts Institute of Technology)
- 2. Yan Gu (University of California Riverside)
- 3. Julian Shun (Massachusetts Institute of Technology)
BibTeX Citation
@inproceedings{wang_sigmod20,
title = {{Theoretically-Efficient and Practical Parallel DBSCAN}},
author = {Wang, Yiqiu and Gu, Yan and Shun, Julian},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3380582},
url = {https://dl.acm.org/doi/10.1145/3318464.3380582},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,483 | DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows | 2022 | SIGMOD | 6.2019677e-05 |
| 6,368 | Theoretically and Practically Efficient Parallel Nucleus Decomposition | 2022 | VLDB | 5.8975125e-05 |
| 8,070 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD | 5.4938502e-05 |
| 10,011 | Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs | 2020 | VLDB | 5.1772034e-05 |
| 11,387 | Fast Density-Based Clustering: Geometric Approach | 2023 | SIGMOD | 5.093636e-05 |
| 11,664 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD | 5.093636e-05 |
| 11,675 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD | 5.093636e-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 |
|---|---|---|---|---|
| 291 | OPTICS: Ordering Points To Identify the Clustering Structure | 1999 | SIGMOD | 0.00022264197 |
| 2,556 | NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data | 2017 | VLDB | 8.4162172e-05 |
| 3,234 | RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning | 2018 | SIGMOD | 7.6144184e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,195 | Approximate DBSCAN via Density-Biased Sampling and Kernel Density Estimation | 2026 | SIGMOD |
| 2 | 3,020 | Dynamic Density Based Clustering | 2017 | SIGMOD |
| 3 | 2,556 | NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data | 2017 | VLDB |
| 4 | 7,500 | Approximate DBSCAN under Differential Privacy | 2025 | SIGMOD |
| 5 | 11,387 | Fast Density-Based Clustering: Geometric Approach | 2023 | SIGMOD |
| 6 | 11,664 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD |
| 7 | 3,234 | RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning | 2018 | SIGMOD |
| 8 | 962 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD |
| 9 | 8,070 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD |
| 10 | 11,675 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD |