Similarity-Based Queries for Time Series Data

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 26, Issue 2, 1997, Pages 13-23

  Rafiei, Davood ^a   Mendelzon, Alberto ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL TRANSFORMATIONS; TIME SERIES ANALYSIS; TREES (MATHEMATICS);

TIME SERIES DATA; TIME WARPING;

QUERY LANGUAGES;

EID: 0031170074     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/253262.253264     Document Type: Article

References (16)

1. Rakesh Agrawal, Christos Faloutsos, and Arun Swami. Efficient similarity search in sequence databases. In Foundations Of Data Organizations and algorithms (FODO) conference, October 1993.
2. Rakesh Agrawal, King-Ip Lin, Harpreet S. Sawhney, and Kyuseok Shim. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In Proceedings of the 21st VLDB Conference, pages 490-501, Zurich, Switzerland, 1995.
3. R. Agrawal, G. Psaila, E. L. Wimmers, and M. Zait. Querying shapes of histories. In Proceedings of the 21st VLDB Conference, pages 502-514, Zurich, Switzerland, 1995.
4. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R* tree: an efficient and robust index method for points and rectangles. In ACM SIGMOD Conf. on the Management Of Data, pages 322-331. ACM, 1990.
5. R. D. Edwards and J. Magee. Technical analysis of stock trends. John Magee, Springfield, Massachsetts, 1969.
6. C. Faloutsos, H. V. Jagadish, A. O. Mendelzon, and T. Milo. A signature technique for similarity-based queries. technical report 112530-951110-16TM, AT&T, Murray Hill, NJ, November 1995.
7. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Intl. Conf. on Management of Data - SIGMOD 94, pages 419-429, Minneapolis, May 1994.
8. D. Q. Goldin and P. C. Kanellakis. On similarity queries for time-series data: constraint specification and implementation. In 1st Intl. Conf. on the Principles and Practice of Constraint Programming, pages 137-153. LNCS 976, Sept. 1995.
9. Antonin Guttman. R-trees: a dynamic index structure for spatial searching. In ACM SIGMOD Conf. on the Management Of Data, pages 47-57. ACM, 1984.
10. H. V. Jagadish. A retrieval technique for similar shapes. In ACM SIGMOD Symp. on the Management Of Data, pages 208-217, 1991.
11. H. V. Jagadish, A. O. Mendelzon, and T. Milo. Similarity-based queries. PODS, 1995.
12. A. V. Oppenheim and R. W. Schafer. Digital Signal Processing. Prentice-Hall, Englewood Cliffs, N.J., 1975.
13. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proceedings of the ACM SIGMOD Annual Conference, San Jose, CA, 1995.
14. William G. Roth. MIMSY: A system for analyzing time series data in the stock market domain. University of Wisconsin, Madison, 1993. Master Thesis.
15. Raghu Ramakrishnan and Divesh Srivastava. CORAL: Control, relations and logic. In Proceedings of the Int. Conf. on VLDB, 1992.
16. David Sankoff and Joseph B. Kruskal. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley Publishing Company, 1983.