Dynamic Density Based Clustering
Summary: Dynamic clustering for density-based DBSCAN under insertions/deletions; rho-approximate DBSCAN shares the same fully dynamic hardness. A small relaxation (the sandwich guarantee) yields near-constant updates and two orders of magnitude speedups over prior approaches. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Junhao Gan
- 2. Yufei Tao
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,296 | RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning | 2018 | SIGMOD | 7.2553154e-05 |
| 3,472 | Real-Time Distance-Based Outlier Detection in Data Streams | 2021 | VLDB | 7.062401e-05 |
| 4,654 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD | 6.0129362e-05 |
| 5,315 | Clustering Stream Data by Exploring the Evolution of Density Mountain | 2018 | VLDB | 5.5702177e-05 |
| 5,827 | Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space | 2018 | SIGMOD | 5.3111132e-05 |
| 6,045 | DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows | 2022 | SIGMOD | 5.2360534e-05 |
| 10,280 | FB*: A Compact Index for Efficient and Exact Density-based Clustering | 2026 | VLDB | 4.1905499e-05 |
| 10,886 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB | 4.1905499e-05 |
| 11,469 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0032118946 |
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016113151 |
| 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 |
| 1,803 | Incremental Clustering for Mining in a Data Warehousing Environment | 1998 | VLDB | 0.00010481475 |
| 6,710 | Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering | 2004 | SIGMOD | 4.9485574e-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 |
| 6,987 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB | 4.8669464e-05 |
| 11,469 | Fast Density-Peaks Clustering: Multicore-based Parallelization Approach | 2021 | SIGMOD | 4.1905499e-05 |
| 2,669 | NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data | 2017 | VLDB | 8.3429208e-05 |
| 5,417 | Theoretically-Efficient and Practical Parallel DBSCAN | 2020 | SIGMOD | 5.5162242e-05 |
| 4,654 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD | 6.0129362e-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 |
| 918 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD | 0.00015286593 |