Adaptive similarity search in streaming time series with sliding windows

Data and Knowledge Engineering

Volumn 63, Issue 2, 2007, Pages 478-502

  Kontaki, Maria ^a   Papadopoulos, Apostolos N ^a   Manolopoulos, Yannis ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

Performance evaluation; Similarity search; Sliding window; Streaming time series

Indexed keywords

PERFORMANCE EVALUATION; SIMILARITY SEARCH; SLIDING WINDOW; STREAMING TIME SERIES;

ADAPTIVE SYSTEMS; DATABASE SYSTEMS; DENSITY FUNCTIONAL THEORY; DISCRETE FOURIER TRANSFORMS; LEARNING ALGORITHMS; TIME SERIES ANALYSIS;

DATA MINING;

EID: 34447291107     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2007.03.002     Document Type: Article

References (23)

1. R. Agrawal, C. Faloutsos, A. Swami, Efficient similarity search in sequence databases, in: Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms (FODO 1993), Evanston, IL, USA, 1993, pp. 69-84.
2. B. Babcock, S. Babu, M. Datar, R. Motwani, J. Widom, Models and issues in data stream systems, in: Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART on Symposium Principles of Database Systems (PODS 2002), Madison, WI, 2002, pp. 1-16.
3. D. Berndt, J. Clifford, Using dynamic time warping to find patterns in time series, in: Proceedings of the Workshop on Knowledge Discovery in Databases, 1994, pp. 359-370.
4. B. Babcock, M. Datar, R. Motwani, L. O'Callaghan, Maintaining variance and k-medians over data stream windows, in: Proceedings of the Symposium on Principles of Database Systems (PODS'03), 2003, pp. 234-243.
5. *-tree: an efficient and robust access method for points and rectangles, in: Proceedings of the ACM SIGMOD, Atlantic City, NJ, 1990, pp. 322-331.
6. Babu S., and Widom J. Continuous queries over data streams. ACM SIGMOD Record 30 3 (2001) 109-120
7. S. Chandrasekaran, M.J. Franklin, Streaming queries over streaming data, in: Proceedings of the 28th International Conference on Very Large Databases (VLDB 2002), Hong Kong, China, 2002.
8. Cormode G., Datar M., Indyk P., and Muthukrishnan S. Comparing data streams using hamming norms (how to zero in). IEEE Transactions on Knowledge and Data Engineering 15 3 (2003) 529-540
9. C. Faloutsos, M. Ranganathan, Y. Manolopoulos, Fast subsequence matching in time-series databases, in: Proceedings of the ACM SIGMOD Conference, Minneapolis, MN, USA, 1994, pp. 419-429.
10. Guha S., Meyerson A., Mishra N., Motwani R., and OCallaghan L. Clustering data streams: theory and practice. IEEE Transactions on Knowledge and Data Engineering 15 3 (2003) 515-528
11. L. Gao, X.S, Wang, Continually evaluating similarity-based pattern queries on a streaming time series, in: Proceedings of the, Madison, WI, 2002.
12. L. Gao, Z. Yao, X.S. Wang, Evaluating continuous nearest neighbor queries for streaming time series via pre-fetching, in: Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002), Hong Kong, China, 2002.
13. L. Gao, X.S. Wang, Improving the performance of continuous queries on fast data streams: time series case, in: Proceedings of the ACM SIGMOD DMKD Workshop, Madison, WI, 2002.
14. KLL02 D. Kwon, S. Lee, S. Lee, Indexing the current positions of moving objects using the lazy update R-tree, in: Proceedings of the Third International Conference on Mobile Data Management, Washington, DC, USA, 2002, pp.113-120.
15. M. Kontaki, A.N. Papadopoulos, Efficient similarity search in streaming time sequences, in: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), Santorini, Greece, 2004.
16. M. Lee, W. Hsu, C.S. Jensen, B. Cui, K.L. Teo, Supporting frequent updates in R-trees: a bottom-up approach, in: Proceedings of the 29th International Conference on Very Large Data Bases (VLDB 2003), Berlin, Germany, 2003, pp. 608-619.
17. X. Liu, H. Ferhatosmanoglu, Efficient k-NN search on streaming data series, in: Proceedings of the 8th International Symposium on Spatial and Temporal Databases (SSTD 2003), Santorini, Greece, 2003.
18. Oppenheim A.V., and Schafer R.W. Digital Signal Processing (1975), Prentice-Hall, Englewood Cliffs, NJ
19. Sidney Burrus C., Gopinath R.A., and Guo H. Introduction to Wavelets and Wavelet Transforms (1997), Prentice-Hall
20. T. Seidl, H.-P. Kriegel, Optimal multi-step k-nearest neighbor search, in: Proceedings of the ACM SIGMOD Conference, Seatle, WA, USA, 1998, pp.154-165.
21. T. Sellis, N. Roussopoulos, C. Faloutsos, The R+ tree: a dynamic index for multidimensional objects, In: Proceedings of the 13th International Conference on VLDB (VLDB 1987), England, 1987, pp. 507-518.
22. R. Weber, H.-J. Schek, S. Blott, A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces, in: Proceedings of the 24th International Conference on Very Large Databases (VLDB 1998), New York City, NY, 1998, pp.194-205.
23. H. Wu, B. Salzberg, D. Zhang, Online event-driven subsequence matching over financial data streams, in: Proceedings of the ACM SIGMOD Conference, Paris, France, 2004.