DCF: An efficient data stream clustering framework for streaming applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4080 LNCS, Issue , 2006, Pages 114-122

  Cho, Kyungmin ^a   Jo, Sungjae ^a   Jang, Hyukjae ^a   Kim, Su Myeon ^a   Song, Junehwa ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Clustering; Data Archiving; Fast Insertion; OLAP; Query Performance; R tree

Indexed keywords

DATA ACQUISITION; DATA STORAGE EQUIPMENT; DATA TRANSFER; NONBIBLIOGRAPHIC RETRIEVAL SYSTEMS; QUERY LANGUAGES; TREES (MATHEMATICS);

DATA STREAM CLUSTERING FRAMEWORK (DCF); FAST INSERTION; OLAP; QUERY PERFORMANCE; R-TREE;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33749423364     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11827405_12     Document Type: Conference Paper

References (18)

1. Antonin Guttman, R-Trees: A Dynamic Index Structure for Spatial Searching, In Proceedings of ACM SIGMOD, pages 47-57, 1984
2. Ouri Wolfson, A. Prasad Sistla, Sam Chamberlain, and Yelena Yesha, Updating and Querying Databases that Track Mobile Units, Special issue on mobile data management and applications of distributed and parallel databases, Vol. 7, Issue 3, July, 1999, pp 257-387
3. Dongseop Kwon, Sangjun Lee, and Sukho Lee, Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree, Proceeding of the Third International Conference on Mobile Data Management, Singapore, January, 2002
4. th VLDB Conferences, Berlin, Germany, pages 608-619, 2003
5. Christos Faloutsos, M. Ranganathan, and Yannis Manolopoulos, Fast Subsequence Matching in Time-Series Databases, Proceeding of ACM SIGMOD Conference, Mineapolis, MN, 1994.
6. Ibrahim Kamel, and Christos Faloutsos, On Packing R-trees, Proceedings of the second international conference on Information and Knowledge Management, Washington D.C., US., pp 490-499, 1993
7. D. J. Dewitt, N. Kabra, J. Luo, J. M. Patel, and J.-B. Yu. Client-server Paradise, In Proceedings of the 20th International Conference on Very Large Data Base (VLDB '94), pages 558-569, Morgan Kaufmann, 1994
8. th International Symposium on Spatial Data Handling (SDH '96), pages 3B.31-3B.42, 1996
9. S. T. Leutenegger, M.A. Lopez, and J. Edgington. STR: A simple and efficient algorithm for R-tree packing. Proceedings of the Thirteenth International Conference on Data Engineering, pages 497-506, 1997
10. N. Roussopoulos and D. Leifker, Direct spatial search on pictorial databases using packed R-trees, In Proceedings ACM-SIGMOD International Conference on Management of Data, SIGMOD Record, Vol 14.4, pages 17-31
11. Li Chen, Rupesh Choubey, and Elke A. Rundensteiner, Bulk-insertions into R-trees using the samll-tree-large-tree approach. In Proceedings of the sixth ACM international symposium on Advances in geographic information systems, pages 161-162, 1998.
12. Taewon Lee, Bongki Moon, and Sukho Lee, Bulk Insertion for R-tree by Seeded Clustering, Proceeding of the DEXA 2003, pp. 129-138
13. L. Arge, K. H. Hinrichs, J. Vahrenhold, and J. S. Vitter, Efficient Bulk Operations on Dynamic R-trees. Algorithmica, 33 (1), pages 104-128, 2002
14. Yannis Theodoridis, and Mario A. Nascimento, Generating Spatiotemporal Datasets on the WWW, SIGMOD Record, Vol 29., No 3., pp 39-43, 2000
15. http://www.cs.ucr.edu/~marioh/spatialindex/index.html
16. Lukasz Golab, M. Tamer Ozsu, Data Stream Management Issues - A Survey, Technical Report CS 2003-08, University of Waterloo, April 2003
17. M. R. Anderberg, Probability and Mathematical Statistics, Academic Press, New York, San Francisco, London, 1973
18. M. Vazirgiannis, Y. Theodoridis, and T. Sellis, Spatio-temporal composition and indexing for large multimedia applications, Multimedia Systems, 6(4):284-298, 1998