DBScholar

Back to papers

BIRCH: An Efficient Data Clustering Method for Very Large Databases

Summary: BIRCH offers incremental, memory-efficient clustering for very large databases; first DB clustering method to effectively handle noise. Shows strong time/space efficiency and single-scan quality; outperforms CLARANS on large datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hbe1b2fa07b9c5f55
Venue
SIGMOD
Year
1996
Pagerank
0.00049559562
Overall Rank
32 | 99.79%
DOI
10.1145/233269.233324

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zhang_sigmod96,
        title = {{BIRCH: An Efficient Data Clustering Method for Very Large Databases}},
        author = {Zhang, Tian and Ramakrishnan, Raghu and Livny, Miron},
        series = {{SIGMOD} '96},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/233269.233324},
        url = {https://dl.acm.org/doi/10.1145/233269.233324},
        year = {1996}
}

Incoming Citations (Sorted by Pagerank)

Showing 50 of 85 citing papers.

Rank Citing Paper Year Venue Pagerank
143 LOF: Identifying Density-Based Local Outliers 2000 SIGMOD 0.00029095978
300 OPTICS: Ordering Points To Identify the Clustering Structure 1999 SIGMOD 0.00021743411
310 Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications 1998 SIGMOD 0.00021410542
329 Storing Semistructured Data with STORED 1999 SIGMOD 0.00020888032
364 CURE: An Efficient Clustering Algorithm for Large Databases 1998 SIGMOD 0.00019916561
587 Efficient Algorithms for Mining Outliers from Large Data Sets 2000 SIGMOD 0.00015900873
625 Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences 1997 SIGMOD 0.00015436082
698 Algorithms for Mining Distance-Based Outliers in Large Datasets 1998 VLDB 0.0001465073
920 Trajectory Clustering: A Partition-and-Group Framework 2007 SIGMOD 0.00013041987
933 A Framework for Clustering Evolving Data Streams 2003 VLDB 0.00012976795
1,039 Fine-grained Partitioning for Aggressive Data Skipping 2014 SIGMOD 0.00012349128
1,080 Multi-dimensional Selectivity Estimation Using Compressed Histogram Information 1999 SIGMOD 0.00012114187
1,285 Streaming Pattern Discovery in Multiple Time-Series 2005 VLDB 0.00011189681
1,313 STING: A Statistical Information Grid Approach to Spatial Data Mining 1997 VLDB 0.00011058121
1,642 Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces 2000 VLDB 9.9812004e-05
1,685 Fast Algorithms for Projected Clustering 1999 SIGMOD 9.8713731e-05
1,759 Clustering Categorical Data: An Approach Based on Dynamical Systems 1998 VLDB 9.6978328e-05
1,768 Semantic Compression and Pattern Extraction with Fascicles 1999 VLDB 9.6803078e-05
1,799 Plan Selection based on Query Clustering 2002 VLDB 9.6001575e-05
1,896 CS2: A New Database Synopsis for Query Estimation 2013 SIGMOD 9.4010932e-05
1,948 Incremental Clustering for Mining in a Data Warehousing Environment 1998 VLDB 9.30382e-05
1,979 Information-Theoretic Tools for Mining Database Structure from Large Data Sets 2004 SIGMOD 9.2615384e-05
1,996 WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases 1998 VLDB 9.2175908e-05
2,006 SQLEM: Fast Clustering in SQL using the EM Algorithm 2000 SIGMOD 9.1840961e-05
2,138 Scalable K-Means++ 2012 VLDB 8.9755133e-05
2,260 Automatic Categorization of Query Results 2004 SIGMOD 8.7355244e-05
2,274 Maintaining Variance and k–Medians over Data Stream Windows 2003 PODS 8.7041791e-05
2,319 Approximation Algorithms for Clustering Uncertain Data 2008 PODS 8.6376033e-05
2,657 DEVise: Integrated Querying and Visual Exploration of Large Datasets 1997 SIGMOD 8.1460696e-05
2,757 Approximate XML Joins 2002 SIGMOD 8.0313227e-05
3,025 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.7214661e-05
3,263 Approximate XML Query Answers 2004 SIGMOD 7.4679565e-05
3,341 WALRUS: A Similarity Retrieval Algorithm for Image Databases 1999 SIGMOD 7.3884891e-05
3,627 A Monte Carlo Algorithm for Fast Projective Clustering 2002 SIGMOD 7.1290231e-05
3,750 Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering 1999 VLDB 7.0336098e-05
3,759 VSS: A Storage System for Video Analytics 2021 SIGMOD 7.0248373e-05
3,858 Graph-Based Synopses for Relational Selectivity Estimation 2006 SIGMOD 6.9543709e-05
3,983 Using Trees to Depict a Forest 2009 VLDB 6.8662651e-05
4,003 Compressing Large Boolean Matrices Using Reordering Techniques 2004 VLDB 6.8465541e-05
4,317 Outlier Detection for High Dimensional Data 2001 SIGMOD 6.6538797e-05
4,331 Density Biased Sampling: An Improved Method for Data Mining and Clustering 2000 SIGMOD 6.644974e-05
4,496 AutoPlait: Automatic Mining of Co-evolving Time Sequences 2014 SIGMOD 6.5592659e-05
4,657 Association Rules over Interval Data 1997 SIGMOD 6.4688277e-05
4,739 Density-based Place Clustering in Geo-Social Networks 2014 SIGMOD 6.4295168e-05
4,811 LinkClus: Efficient Clustering via Heterogeneous Semantic Links 2006 VLDB 6.3908502e-05
4,947 Clustering by Pattern Similarity in Large Data Sets 2002 SIGMOD 6.3284351e-05
5,461 Clustering Stream Data by Exploring the Evolution of Density Mountain 2018 VLDB 6.1045744e-05
6,034 The 3W Model and Algebra for Unified Data Mining 2000 VLDB 5.8906344e-05
6,347 Outlier-robust Clustering using Independent Components 2008 SIGMOD 5.7893117e-05
6,970 Supporting Ranking and Clustering as Generalized Order-By and Group-By 2007 SIGMOD 5.6152718e-05
Previous Page 1 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
94 Efficient and Effective Clustering Methods for Spatial Data Mining 1994 VLDB 0.00034470298
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 310 Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications 1998 SIGMOD
2 11,939 ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain 2022 VLDB
3 3,540 Scalable Discovery of Best Clusters on Large Graphs 2010 VLDB
4 94 Efficient and Effective Clustering Methods for Spatial Data Mining 1994 VLDB
5 7,457 Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering 2004 SIGMOD
6 6,589 Efficient Implementation of Large-Scale Multi-Structural Databases 2005 VLDB
7 7,381 Efficient Search in Very Large Databases 1988 VLDB
8 3,750 Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering 1999 VLDB
9 9,211 Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering 2001 SIGMOD
10 14,483 Clustering Methods for Large Databases: From the Past to the Future 1999 SIGMOD