DBScholar

Back to papers

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)

Paper ID
5488
Venue
SIGMOD
Year
2017
Pagerank
7.8445412e-05
Overall Rank
3,020 | 79.29%
DOI
10.1145/3035918.3064050

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gan_sigmod17,
        title = {{Dynamic Density Based Clustering}},
        author = {Gan, Junhao and Tao, Yufei},
        series = {{SIGMOD} '17},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3035918.3064050},
        url = {https://dl.acm.org/doi/10.1145/3035918.3064050},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers