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: h8046eeb790410234
Venue: VLDB
Year: 1998
Pagerank: 9.3257256e-05
Overall Rank: 1,945 | 86.93%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Martin Ester (University of Munich)
2. Hans-Peter Kriegel (University of Munich)
3. Jörg Sander (University of Munich)
4. Michael Wimmer (University of Munich)
5. Xiaowei Xu (University of Munich)

BibTeX Citation

@article{ester_vldb98,
        title = {{Incremental Clustering for Mining in a Data Warehousing Environment}},
        author = {Ester, Martin and Kriegel, Hans-Peter and Sander, Jörg and Wimmer, Michael and Xu, Xiaowei},
        journal = {PVLDB},
        series = {{VLDB} '98},
        pages = {323--333},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
300	OPTICS: Ordering Points To Identify the Clustering Structure	1999	SIGMOD	0.00021810545
460	Query-based Workload Forecasting for Self-Driving Database Management Systems	2018	SIGMOD	0.00017842695
988	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.00012660447
1,077	Multi-dimensional Selectivity Estimation Using Compressed Histogram Information	1999	SIGMOD	0.00012154948
3,057	Dynamic Density Based Clustering	2017	SIGMOD	7.6965352e-05
5,329	A Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks	2009	VLDB	6.1775042e-05
5,612	DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows	2022	SIGMOD	6.0683695e-05
7,433	Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering	2004	SIGMOD	5.529101e-05
7,847	A Shared Execution Strategy for Multiple Pattern Mining Requests over Streaming Data	2009	VLDB	5.4413352e-05
9,041	Summarization and Matching of Density-Based Clusters in Streaming Environments	2012	VLDB	5.2321972e-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
4	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0011405675
29	Fast Algorithms for Mining Association Rules	1994	VLDB	0.0005121339
32	BIRCH: An Efficient Data Clustering Method for Very Large Databases	1996	SIGMOD	0.00049737458
56	M-tree: An Efficient Access Method for Similarity Search in Metric Spaces	1997	VLDB	0.00040370171
94	Efficient and Effective Clustering Methods for Spatial Data Mining	1994	VLDB	0.00034579889
901	Maintenance of Data Cubes and Summary Tables in a Warehouse	1997	SIGMOD	0.00013185553
5,888	Multiple-View Self-Maintenance in Data Warehousing Environments	1997	VLDB	5.9576002e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,610	NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data	2017	VLDB
2	94	Efficient and Effective Clustering Methods for Spatial Data Mining	1994	VLDB
3	11,702	Fast Density-Based Clustering: Geometric Approach	2023	SIGMOD
4	5,440	Clustering Stream Data by Exploring the Evolution of Density Mountain	2018	VLDB
5	1,679	Fast Algorithms for Projected Clustering	1999	SIGMOD
6	986	DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation	2015	SIGMOD
7	3,057	Dynamic Density Based Clustering	2017	SIGMOD
8	5,417	Theoretically-Efficient and Practical Parallel DBSCAN	2020	SIGMOD
9	7,433	Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering	2004	SIGMOD
10	8,240	Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms	2024	SIGMOD