Ranked subsequence matching in time-series databases

33rd International Conference on Very Large Data Bases, VLDB 2007 - Conference Proceedings

Volumn , Issue , 2007, Pages 423-434

  Han, Wook Shin ^a   Lee, Jinsoo ^a   Moon, Yang Sae ^b   Jiang, Haifeng ^c  

^a Kyungpook National University   (South Korea)

^b Kangwon National University   (South Korea)

^c GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER UTILIZATION; DATA SEQUENCES; MINIMUM DISTANCE; NOCV1; QUERY SEQUENCE; SEQUENCE MATCHING; SUBSEQUENCE MATCHING; SUBSEQUENCE MATCHING ALGORITHMS; TIME SERIES DATABASE;

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

References (31)

1. Agrawal, R., Faloutsos, C., and Swami, A., "Efficient Similarity Search in Sequence Databases," in FODO, 1993.
2. ∗-tree: An Efficient and Robust Access Method for Points and Rectangles," in SIGMOD, pp. 322-331, 1990.
3. Berchtold, S., Bohm, C., and Kriegel, H.-P., "The Pyramid-Technique: Towards Breaking the Curse of Dimensionality," in SIGMOD, pp. 142-153, 1998.
4. Berndt, D. and Clifford, J., "Finding Patterns in Time Series: a Dynamic Programming Approach," in Advances in Knowledge Discovery and Data Mining, pp. 229-248, AAAI/MIT, 1996.
5. Bartolini, I., Ciaccia, P., and Patella, M. "WARP: Accurate Retrieval of Shapes Using Phase of Fourier Descriptors and Time Warping Distance," IEEE PAMI, pp. 142-147, 2005.
6. Chan, K.-P. et al., "Haar Wavelets for Efficient Similarity Search of Time-Series: With and Without Time Warping," IEEE TKDE, pp. 686-705, 2003.
7. Faloutsos, C., Ranganathan, M., and Manolopoulos, Y., "Fast Subsequence Matching in Time-Series Databases," in SIGMOD, pp. 419-429, 1994.
8. Han, W., Lee, J., and Moon, Y., "Fundamental Techniques for Ranked Subseqeunce Matching," http://www.hummingbase.com/subseqrank.pdf, 2007.
9. Hjaltason, G. and Samet, H., "Ranking in Spatial Databases," in SSD, pp. 83-95, 1995.
10. Itakura, F., "Minimum Prediction Residual Principle Applied to Speech Recognition," IEEE Trans. on ASSP, vol. ASSP-23, No. 1, pp. 67-72, 1975.
11. Keogh, E. et al., "Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases," in SIGMOD, pp 151-162, 2001.
12. Keogh, E., "Exact indexing of dynamic time warping," in VLDB, pp 406-417, 2002.
13. Keogh, E. "A Decade of Progress in Indexing and Mining Large Time Series Databases," in VLDB, Tutorial, 2006.
14. Keogh, E., The UCR Time Series Data Mining Archive, http://www.cs.ucr.edu/~eamonn/TSDMA/index.html.
15. Kim, S.-W. et al., "An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Database" la ICDE, pp. 607-614, 2001.
16. Lim, S.-H. et al., "Using Multiple Indexes for Efficient Subsequence Matching in Time-Series Databases," in DASFAA, pp. 65-79, 2006.
17. Loh, W.-K. et al., "A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases," DMKD, Vol. 9, No. 1, pp. 5-28, July 2004.
18. Moon, Y.-S., Whang, K.-Y, and Loh, W.-K., "Duality-Based Subsequence Matching in Time-Series Databases," in ICDE, pp. 263-272, 2001.
19. Moon, Y.-S., Whang, K.-Y, and Han, W.-S., "General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows," in SIGMOD, pp. 382-393, 2002.
20. Rafiei, D. et al., "Querying Time Series Data Based on Similarity," IEEE TKDE, Vol. 12, No. 5, 2000.
21. Rabiner, L and Juang, B., Fundamentals of Speech Recognition, Englewood Cliffs, N. J., 1993.
22. Ramakrishnan, R. and Gehrke, J., Database Management Systems, McGraw-Hill, 2000.
23. Roussopoulos, N, Kelley, S., and Vincent, F, "Nearest Neighbor Queries," in SIGMOD, pp. 71-79, May. 1995.
24. Sakoe, H. and Chiba, S, "Dynamic Programming Algorithm Optimization for Spoken Word Recognition," IEEE Trans. on ASSP, vol. ASSP-26, No. 1, pp. 43-49, Feb. 1978.
25. Seidl, T. and Kriegel, H.-P, "Optimal Multi-Step k-Nearest Neighbor Search," in SIGMOD, pp. 154-165, June. 1998.
26. Sobell, M. O., Practical Guide to Linux Commands, Editors, and Shell Programming, Prentice Hall, 2005.
27. Weber, R. et al., "A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces," in VLDB, pp. 194-205, pp. 194-205, Aug. 1998.
28. Wong, T. and Wong, M, "Efficient Subsequence Matching for Sequences Databases under Time Warping," in IDEAS, pp. 139-138, 2003.
29. Yi, B.-K, Jagadish, H. V, and Faloutsos, C, "Efficient Retrieval of Similar Time Sequences Under Time Warping," in ICDE, pp. 201-208, 1998.
30. Yi, B.-K. and Faloutsos, C, "Fast Time Sequence Indexing for Arbitrary Lp Norms," in VLDB, pp. 385-394, 2000.
31. Zhu, Y and Shasha, D., "Warping Indexes with Envelope Transforms for Query by Humming," in SIGMOD, 2003.