DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation

Summary: Revisits DBSCAN, debunking the KDD'96 O(n log n) claim; real worst-case is O(n^2), with a 2D fix yielding O(n log n) and a d≥3 Omega(n^(4/3)) lower bound. Proposes rho-approximate DBSCAN, achieving O(n) expected time in any dimension at bounded inaccuracy, suggesting it as the practical replacement for big data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: he866b913e3693e01
Venue: SIGMOD
Year: 2015
Pagerank: 0.00012668888
Overall Rank: 986 | 93.38%
DOI: 10.1145/2723372.2737792

Incoming Non-self Citations Over Time

Authors

1. Junhao Gan (Chinese University of Hong Kong)
2. Yufei Tao (Chinese University of Hong Kong)

BibTeX Citation

@inproceedings{gan_sigmod15,
        title = {{DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation}},
        author = {Gan, Junhao and Tao, Yufei},
        series = {{SIGMOD} '15},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2723372.2737792},
        url = {https://dl.acm.org/doi/10.1145/2723372.2737792},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 19 of 19 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,610	NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data	2017	VLDB	8.2276558e-05
3,057	Dynamic Density Based Clustering	2017	SIGMOD	7.6965352e-05
3,300	RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning	2018	SIGMOD	7.443826e-05
5,148	Unsupervised Contextual Anomaly Detection for Database Systems	2022	SIGMOD	6.255522e-05
5,440	Clustering Stream Data by Exploring the Evolution of Density Mountain	2018	VLDB	6.1276555e-05
5,612	DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows	2022	SIGMOD	6.0683695e-05
7,096	A New Sparse Data Clustering Method Based On Frequent Items	2023	SIGMOD	5.601767e-05
7,346	Spade: A Real-Time Fraud Detection Framework on Evolving Graphs	2023	VLDB	5.5461419e-05
7,642	Approximate DBSCAN under Differential Privacy	2025	SIGMOD	5.4772833e-05
7,997	ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms	2021	VLDB	5.4105956e-05
8,240	Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms	2024	SIGMOD	5.370583e-05
8,316	ThriftLLM: On Cost-Effective Selection of Large Language Models for Classification Queries	2025	VLDB	5.3561732e-05
10,411	Approximate DBSCAN via Density-Biased Sampling and Kernel Density Estimation	2026	SIGMOD	4.9793485e-05
10,749	FB*: A Compact Index for Efficient and Exact Density-based Clustering	2026	VLDB	4.9793485e-05
11,108	In-Database Time Series Clustering	2025	SIGMOD	4.9793485e-05
11,585	Ensemble Clustering based on Meta-Learning and Hyperparameter Optimization	2024	VLDB	4.9793485e-05
11,702	Fast Density-Based Clustering: Geometric Approach	2023	SIGMOD	4.9793485e-05
11,843	Faster and Better Solution to Embed Lp Metrics by Tree Metrics	2022	SIGMOD	4.9793485e-05
11,971	Fast Density-Peaks Clustering: Multicore-based Parallelization Approach	2021	SIGMOD	4.9793485e-05

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
300	OPTICS: Ordering Points To Identify the Clustering Structure	1999	SIGMOD	0.00021810545
1,305	STING: A Statistical Information Grid Approach to Spatial Data Mining	1997	VLDB	0.00011099619
1,783	Swarm: Mining Relaxed Temporal Moving Object Clusters	2010	VLDB	9.6511944e-05
4,972	Computing Clusters of Correlation Connected Objects	2004	SIGMOD	6.3318975e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	11,971	Fast Density-Peaks Clustering: Multicore-based Parallelization Approach	2021	SIGMOD
2	10,269	On Saving Outliers for Better Clustering over Noisy Data	2021	SIGMOD
3	1,945	Incremental Clustering for Mining in a Data Warehousing Environment	1998	VLDB
4	2,610	NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data	2017	VLDB
5	10,411	Approximate DBSCAN via Density-Biased Sampling and Kernel Density Estimation	2026	SIGMOD
6	11,702	Fast Density-Based Clustering: Geometric Approach	2023	SIGMOD
7	7,642	Approximate DBSCAN under Differential Privacy	2025	SIGMOD
8	3,057	Dynamic Density Based Clustering	2017	SIGMOD
9	5,417	Theoretically-Efficient and Practical Parallel DBSCAN	2020	SIGMOD
10	8,240	Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms	2024	SIGMOD