Bounded similarity querying for time-series data

Information and Computation

Volumn 194, Issue 2 SPEC. ISS., 2004, Pages 203-241

  Goldin, Dina Q ^a   Millstein, Todd D ^b   Kutlu, Ayferi ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b University of California   (United States)

Author keywords

Bounded similarity querying; Fingerprint; Normalization parameter; Scale; Shift; Similarity transformation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA REDUCTION; DATABASE SYSTEMS; MATHEMATICAL TRANSFORMATIONS; TIME SERIES ANALYSIS;

BOUNDED SIMILARITY QUERYING; FINGERPRINTS; NORMALIZATION PARAMETERS; SCALE; SHIFT; SIMILARITY TRANSFORMATION;

QUERY LANGUAGES;

EID: 6344261896     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.07.001     Document Type: Article

References (47)

1. R. Agrawal, K. Lin, H. Sawhney, K. Shim, Fast similarity search in the presence of noise, scaling, and translation in time-series databases, in: Proceedings of the 21st VLDB Conference, 1995, pp. 490-501.
2. R. Agrawal, C. Faloutsos, A. Swami, Efficient similarity search in sequence databases, FODO Conference, Evanston, Illinois, October 1993.
3. A. Aho, Algorithms for Finding Patterns in Strings, in: Van Leeuwen J. (Ed.), Handbook of TCS, vol. A, Elsevier, Amsterdam, 1990, Chap. 5.
4. N. Beckmann, H. P. Kriegel, R. Schneider, B. Seeger, The R*-Tree, an efficient and robust access method for points and rectangles, in: Proceedings of the ACM SIGMOD Conference on Management of Data, 1990, pp.322-331.
5. D. Berndt, J. Clifford, Using dynamic time warping to find patterns in time series, in: AAAI-94 Workshop on Knowledge Discovery in Databases, 1994, pp. 229-248.
6. K.S. Beyer, J. Goldstein, R. Ramakrishnan, U. Shaft, When is "nearest neighbor" meaningful? in: Proceedings of the 7th International Conference on Database Theory, 1999, pp. 217-235.
7. S. Babu, J. Widom, Continuous queries over data streams, SIGMOD Record, September 2001.
8. K. Chan, A.W. Fu, Efficient, time series matching by wavelets, in: Proceedings of the 15th IEEE International Conference on Data Engineering, Sydney, Australia, March 1999, pp. 126-133.
9. B. Chiu, E. Keogh, S. Lonardi, Probabilistic discovery of time series motifs, in: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 2003, pp. 493-498.
10. K. Chu, M. Wong, Fast time-series searching with scaling and shifting, in: in Proceedings of the 18th ACM Symposium on Principles of Database Systems, Philadelphia, PA, May 1999, pp 237-248.
11. R. Elmasri, S. Navathe, Fundamentals of Database Systems, Addison-Wesley, New York, 2000.
12. C. Faloutsos, Searching Multimedia Databases by Content, Kluwer Academic Publishers, Dordrecht, 1996.
13. C. Faloutsos, M. Ranganathan, Y. Manolopoulos, Fast subsequence matching in time-series databases, in: Proceedings of the ACM SIGMOD Conference on Management of Data, May 1994, pp. 419-429.
14. A. Guttmann, R-trees: a dynamic index structure for spatial searching, in: Proceedings of the ACM SIGMOD Conference on Management of Data, 1984, pp. 47-57.
15. V. Gaede, O. Gunther, Multidimensional access methods, ACM Comput. Surv. 30 (2) (1998).
16. D. Goldin, P. Kanellakis, On similarity queries for time-series data: constraint specification and implementation, in: Proceedings of CP'95, September 1995.
17. D. Goldin, Constraint query algebras, Computer Science Doctorate Thesis, Brown University, Jan. 1997.
18. X. Ge, P. Smyth, Deformable Markov model templates for time-series pattern matching, in: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, August 2000, pp 81-90.
19. H.V. Jagadish. A retrieval technique for similar shapes, in: Proceedings of the ACM SIGMOD Conference, May 1991, pp. 208-217.
20. H.V. Jagadish, A.O. Mendelzon, T. Milo, Similarity-based queries, in: Proceedings of the 14th ACM PODS, 1995.
21. T. Kahveci, A. Singh, Variable length queries for time series data, in: Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, 2001.
22. T. Kahveci, A. Singh, A. Gürel, Similarity searching for multi-attribute sequences, in: Proceedings of the 14th International Conference on Scientific and Statistical Database Management, 2002.
23. R.M. Karp, M.O. Rabin, Efficient randomized pattern-matching algorithms, IBM J. Res. Dev. 31 (2) (1987).
24. E. Keogh, Exact indexing of dynamic time warping, in: Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong, 2002, pp. 406-417.
25. E. Keogh. Efficiently finding arbitrarily scaled patterns in massive time series databases, in: Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, September 2003, pp. 253-265.
26. E. Keogh, K. Chakrabarti, S. Mehrotra, M. Pazzani, Locally adaptive dimensionality reduction for indexing large time series databases, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 2001.
27. E. Keogh, K. Chakrabarti, M. Pazzani, S. Mehrota, Dimensionality reduction for fast similarity search in large time series databases, J. Knowledge Inf. Syst. 3 (3) (2001).
28. E. Keogh, S. Kasetty, On the need for time series data mining benchmarks: a survey and empirical demonstration, in: Proceedings of 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002, pp. 102-111.
29. E. Keogh, M. Pazzani, A simple dimensionality reduction technique for fast similarity search in large time series databases, in: Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2000, pp. 122-133.
30. S. Kim, S. Park, W. Chu, An index-based approach for similarity search supporting time warping in large sequence databases, in: Proceedings of the 17th International Conference on Data Engineering, 2001, pp. 607-614.
31. F. Korn, H. Jagadish, C. Faloutsos, Efficiently supporting ad hoc queries in large datasets of time sequences, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Tucson, AZ, May 1997, pp. 289-300.
32. W. Mendenhall, R. Scheaffer, D. Wackerly, Mathematical Statistics with Applications, Duxbury Press, Boston, MA, 1986.
33. T.D. Millstein, Design and Implementation of Similarity Querying for Time-Series Databases, Undergraduate Honors Thesis, Computer Science Department, Brown University, May 1996.
34. Modenov, Pakhomenko, Geometric Transformations, Academic Press, New York, 1965.
35. A.V. Oppenheim, R.W. Schafer, Digital Signal Processing, Prentice Hall, New Jersey, 1975.
36. S. Park, D. Lee, W. Chu, Fast retrieval of similar subsequences in long sequence databases, in: 3rd IEEE Knowledge and Data Engineering Exchange Workshop, 1999.
37. S. Park, W. Chu, J. Yoon, C. Hsu, Efficient searches for similar subsequences of different lengths in sequence databases, in: Proceedings of the 16th IEEE International Conference on Data Engineering, 2000, pp. 23-32.
38. Chang-Shing Perng, Haixun Wang, Sylvia R. Zhang, D. Stott Parker, Landmarks: a new model for similarity-based pattern querying in time series databases, in: Proceedings of the 16th International Conference on Data Engineering (ICDE'2000), San Diego, USA, 2000.
39. D. Rafiei, On similarity-based queries for time series data, in: Proceedings of the 15th IEEE International Conference on Data Engineering, Sydney, Australia, March 1999.
40. D. Rafiei, A. Mendelzon, Similarity-based queries for time series data, in: Proceedings of the ACM SIGMOD Conference, Tucson, Arizona, May 1997.
41. H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading MA, 1990.
42. H. Shatkay, S. Zdonik, Approximate queries and representations for large data sequences, in: Proceedings of the 12th IEEE International Conference on Data Engineering, New Orleans, LA, pp. 536-545, February 1996.
43. P. Sheshadri, M. Livny, R. Ramakrishnan, Sequence query processing, Proc. ACM SIGMOD Conf. (1994) 430-441.
44. J. Ullman, Principles of Database Systems, Computer Science Press, Rockville MD, 1982.
45. M. Vlachos, G. Kollios, D. Gunopulos, Discovering similar multidimensional trajectories, in: Proceedings of the 18th International Conference on Data Engineering (ICDE'2002), San Jose, USA, 2002.
46. B.-K. Yi, C. Faloutsos. Fast time sequence indexing for arbitrary Lp Norms, in: Proceedings of the 26th International Conference on Very Large Databases, Cairo, Egypt, 2000.
47. B. Yi, H. Jagadish, C. Faloutsos, Efficient retrieval of similar time sequences under time warping, in: Proceedings of the 14th International Conference on Data Engineering, Orlando, FL, 1998, pp. 201-208.