Incremental Clustering for Mining in a Data Warehousing Environment

Summary: Proposes IncrementalDBSCAN to maintain DBSCAN clusters under daily warehouse updates. Updates affect only local neighborhoods, yielding identical results to DBSCAN and substantial speedups on spatial and WWW-log databases. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 8499
Venue: VLDB
Year: 1998
Pagerank: 0.0001045313
Overall Rank: 1,816 | 87.37%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
270	OPTICS: Ordering Points To Identify the Clustering Structure	1999	SIGMOD	0.00029505642
716	Query-based Workload Forecasting for Self-Driving Database Management Systems	2018	SIGMOD	0.00017723171
1,029	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.00014582849
1,241	Multi-dimensional Selectivity Estimation Using Compressed Histogram Information	1999	SIGMOD	0.00013097578
3,264	Dynamic Density Based Clustering	2017	SIGMOD	7.3094408e-05
3,817	A Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks	2009	VLDB	6.730222e-05
6,125	DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows	2022	SIGMOD	5.1987868e-05
6,799	Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering	2004	SIGMOD	4.9232394e-05
7,419	A Shared Execution Strategy for Multiple Pattern Mining Requests over Streaming Data	2009	VLDB	4.7348504e-05
8,779	Summarization and Matching of Density-Based Clusters in Streaming Environments	2012	VLDB	4.4539178e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
6	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0016162015
27	Efficient and Effective Clustering Methods for Spatial Data Mining	1994	VLDB	0.00080736878
33	BIRCH: An Efficient Data Clustering Method for Very Large Databases	1996	SIGMOD	0.00077324389
36	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00076161096
91	M-tree: An Efficient Access Method for Similarity Search in Metric Spaces	1997	VLDB	0.0005181666
962	Maintenance of Data Cubes and Summary Tables in a Warehouse	1997	SIGMOD	0.00014986226
5,480	Multiple-View Self-Maintenance in Data Warehousing Environments	1997	VLDB	5.484741e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
2,635	NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data	2017	VLDB	8.4045788e-05
27	Efficient and Effective Clustering Methods for Spatial Data Mining	1994	VLDB	0.00080736878
11,181	Fast Density-Based Clustering: Geometric Approach	2023	SIGMOD	4.1945683e-05
1,595	Fast Algorithms for Projected Clustering	1999	SIGMOD	0.00011222442
5,324	Clustering Stream Data by Exploring the Evolution of Density Mountain	2018	VLDB	5.5691645e-05
961	DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation	2015	SIGMOD	0.00015001792
3,264	Dynamic Density Based Clustering	2017	SIGMOD	7.3094408e-05
5,417	Theoretically-Efficient and Practical Parallel DBSCAN	2020	SIGMOD	5.5194222e-05
6,799	Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering	2004	SIGMOD	4.9232394e-05
7,480	Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms	2024	SIGMOD	4.7180617e-05