CDS-Tree: An effective index for clustering arbitrary shapes in data streams

Proceedings of the IEEE International Workshop on Research Issues in Data Engineering

Volumn , Issue , 2005, Pages 81-88

  Sun, Huanliang ^a,b   Yu, Ge ^a   Bao, Yubin ^a   Zhao, Faxin ^a   Wang, Daling ^a  

^a NORTHEASTERN UNIVERSITY   (China)

^b SHENYANG JIANZHU UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES;

CDS-TREE; CLUSTERING ALGORITHMS; DATA SKEWS; DATA STREAMS; SPACE PARTITION;

DATA PROCESSING;

EID: 27144549848     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and Issues in Data Stream Systems. Proc. of 21st ACM Symposium on Principles of Database Systems (PODS 2002), Madison, Wisconsin, 2002, pp. 30-45.
2. M. Garofalakis, J. Gehrke, and R. Rastogi. Querying and mining data streams: You only get one look. Proc of 2002 ACM SIGMOD International Conference on Management of Data. Madison, Wisconsin, 2002, pp. 635-645.
3. R. T. Ng and J. Han. Efficient and Effective Clustering Methods for Spatial Data Mining. In Proceedings of the 20th VLDB Conference, 1994, pp. 144-155.
4. G. Karypis, E.-H. Han, and V. Kumar. CHAMELEON: A hierarchical clustering algorithm using dynamic modeling. COMPUTER, 32:68-75,1999.
5. S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large databases. In Proc. SIGMOD, Seattle, WA, 1998, pp. 73-84.
6. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An efficient data clustering method for very large databases. In proc. 1996 ACM SIGMOD, Montreal, Canada, June 1996, pp. 103-114.
7. M. Ester, H. P. Kriegel, J. Sander, X. Xu,. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases. Proc. of KDD Conf., Portland OR, USA, 1996, pp. 226-231.
8. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. Proc. of ACM SIGMOD Conf. Seattle, WA, 1998, pp. 94-105.
9. S. Guha, N. Mishra, R. Motwani, L. O'Callaghan. Clustering Data Streams. In Proc. IEEE FOCS Conference, 2000, pp. 359-366.
10. S. Guha, A. Meyerson, N. Mishra, R. Motwani. Clustering Data Streams: Theory and Practice. TKDE special issue on clustering, vol. 15, 2003, pp. 515-528.
11. B. Babcock, M. Datar, R. Motwani, L. O'Callaghan. Maintaining Variance and k-Medians over Data Stream Windows. Proc. of PODS 2003, San Diego, California, 2003, pp. 234-243.
12. C. C. Aggarwal, J. Han, J. Wang, P. S. Yu. A Framework for Clustering Evolving Data Streams. Proc. of VLDB 2003, Berlin, Germany, 2003, pp. 81-92.
13. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. Proc. of ACM SIGMOD 1990 Conf., Atlantic City, NJ, 1990, pp. 322-331.
14. S. Berchtold, D. A. Keim and H. Kriegel. The X-tree: An Index Structure for High-Dimensional Data. Proc. of the 22nd VLDB Conf. Bombay, India, 1996, pp. 28-39.