Database Paper Browser

Back to papers

DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows

Summary: DenForest enables fast incremental density-based clustering over sliding windows by representing clusters as spanning trees rather than graphs. It offers logarithmic-time split decisions on deletions and, empirically, outperforms prior incremental methods while matching DBSCAN's clustering quality. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6286
Venue
SIGMOD
Year
2022
Pagerank
5.1987868e-05
Overall Rank
6,125 | 57.40%
DOI
10.1145/3514221.3517833

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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