Efficient processing of similarity search under time warping in sequence databases: An index-based approach

Information Systems

Volumn 29, Issue 5, 2004, Pages 405-420

  Kim, Sang Wook ^a   Park, Sanghyun ^b   Chu, Wesley W ^c  

^a Hanyang University   (South Korea)

^b Pohang University of Science and Technology (POSTECH)   (South Korea)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Indexing; Sequence database; Similarity search; Time warping distance

Indexed keywords

FUNCTIONS; INDEXING (OF INFORMATION); TREES (MATHEMATICS); VECTORS;

SEQUENCE DATABASE; SIMILARITY SEARCH; TIME WARPING DISTANCE;

DATABASE SYSTEMS;

EID: 1342264178     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0306-4379(03)00037-1     Document Type: Article

References (27)

1. R. Agrawal, C. Faloutsos, A. Swami, Efficient similarity search in sequence databases, in: Proceedings of the International Conference on Foundations of Data Organization and Algorithms (FODO), Chicago, IL, USA, 1993, pp. 69-84.
2. R. Agrawal, K. Lin, H.S. Sawhney, K. Shim, Fast similarity search in the presence of noise, scaling, and translation in time-series databases, in: Proceedings of the International Conference on Very Large Data Bases (VLDB), Zurich, Switzerland, 1995, pp. 490-501.
3. C. Faloutsos, M. Ranganathan, Y. Manolopoulos, Fast subsequence matching in time-series databases, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Minneapolis, MN, USA, 1994, pp. 419-429.
4. Chen M.S., Han J., Yu P.S. Data mining. an overview from database perspective IEEE Trans. Knowledge Data Eng. (TKDE). 8(6):1996;866-883.
5. D. Rafiei, A. Mendelzon, Similarity-based queries for time series data, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Tucson, AZ, USA, 1997, pp. 13-24.
6. K.W. Chu, M.H. Wong, Fast time-series searching with scaling and shifting, in: Proceedings of the ACM Symposium on Principles of Database Systems (PODS), Philadelphia, PA, USA, 1999, pp. 237-248.
7. D.Q. Goldin, P.C. Kanellakis, On similarity queries for time-series data: constraint specification and implementation, in: Proceedings of the Constraint Programming, Cassis, France, 1995, pp. 137-153.
8. G. Das, D. Gunopulos, H. Mannila, Finding similar time series, in: Proceedings of the Principles and Practice of Knowledge Discovery in Databases (PKDD), Trondheim, Norway, 1997, pp. 88-100.
9. W.K. Loh, S.W. Kim, K.Y. Whang, Index interpolation: an approach for subsequence matching supporting normalization transform in time-series databases, in: Proceedings of the ACM Conference on Information and Knowledge Management (CIKM), McLean, VA, USA, 2000, pp. 480-487.
10. D.J. Berndt, J. Clifford, Finding patterns in time series: a dynamic programming approach, in: Advances in Knowledge Discovery and Data Mining, AAAI/MIT, 1996, pp. 229-248.
11. S. Park, W.W. Chu, J. Yoon, C. Hsu, Efficient searches for similar subsequences of different lengths in sequence databases, in: Proceedings of the IEEE International Conference on Data Engineering (ICDE), San Diego, CA, USA, 2000, pp. 23-32.
12. B.-K. Yi, H.V. Jagadish, C. Faloutsos, Efficient retrieval of similar time sequences under time warping, in: Proceedings of the IEEE International Conference on Data Engineering (ICDE), Orlando, FL, USA, 1998, pp. 201-208.
13. Rabinar L., Juang B.-H. Fundamentals of Speech Recognition. 1993;Prentice-Hall, Englewood Cliffs, NJ.
14. * -tree: an efficient and robust access method for points and rectangles, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Atlantic City, NJ, USA, 1990, pp. 322-331.
15. S. Berchtold, D.A. Keim, H. Kriegel, The X -tree: an index structure for high-dimensional data, in: Proceedings of the International Conference on Very Large Data Bases (VLDB), Bombay, India, 1996, pp. 28-39.
16. + -tree: a dynamic index for multi-dimensional objects, in: International Conference on Very Large Data Bases (VLDB), Birghton, England, 1987, pp. 507-518.
17. Preparata F.P., Shamos M. Computational Geometry: An Introduction. 1985;Springer, Berlin.
18. C. Faloutsos, K. Lin, Fastmap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD), San Jose, CA, USA, 1995, pp. 163-174.
19. Stephen G.A. String Searching Algorithms. 1994;World Scientific, Singapore.
20. K. Shim, R. Srikant, R. Agrawal, High-dimensional similarity joins, in: Proceedings of the IEEE International Conference on Data Engineering (ICDE), Birmingham, England, 1997, pp. 301-311.
21. Deller J.R., Proakis J.G., Hansen J.H.L. Discrete-Time Processing of Speech Signals. 1993;Macmillan, New York.
22. S. Park, J.S. Cho, K.H. Hyun, Indexing technique for similarity matching in large video databases, in: Proceedings of the SPIE Conference on Storage and Retrieval for Media Databases, San Jose, CA, USA, 2002, pp. 214-222.
23. R. Tusch, H. Kosch, L. Boszormeny, VIDEX: an integrated generic video indexing approach, in: Proceedings of the ACM Multimedia, Los Angeles, CA, USA, 2000, pp. 448-451.
24. A. Guttman, R -trees: a dynamic index structure for spatial searching, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Boston, MA, USA, 1984, pp. 47-57.
25. J. Bercken, B. Seeger, P. Widmayer, A general approach to bulk loading multidimensional index structures, in: Proceedings of the International Conference on Very Large Data Bases (VLDB), Athens, Greece, 1997, pp. 406-415.
26. I. Kamel, C. Faloutsos, On packing R -trees, in: Proceedings of the ACM Conference on Information and Knowledge Management (CIKM), Washington, DC, USA, 1993, pp. 490-499.
27. S.T. Leutenegger, J.M. Edgington, M.A. Lopez, STR: a simple and efficient algorithm for R -tree packing, in: Proceedings of the IEEE International Conference on Data Engineering (ICDE), Birmingham, USA, 1997, pp. 497-506.