The TS-tree: Efficient time series search and retrieval

Advances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2008, Pages 252-263

  Assent, Ira ^a   Krieger, Ralph ^a   Afschari, Farzad ^a   Seidl, Thomas ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL; INPUT OUTPUT PROGRAMS; QUERY PROCESSING; SENSOR DATA FUSION; TIME SERIES ANALYSIS;

INDEX DESCRIPTORS; INDEX STRUCTURE; TIME SERIES QUANTIZATION;

TREES (MATHEMATICS);

EID: 43349089096     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1353343.1353376     Document Type: Conference Paper

References (30)

1. R. Agrawal, C. Faloutsos, and A. N. Swami. Efficient Similarity Search In Sequence Databases. In Proc. FODO, pages 69-84, 1993.
2. R. Bayer and E. M. McCreight. Organization and maintenance of large ordered indexes. In ACM SIGFIDET Workshop, pages 107-141, 1970.
3. R. Bayer and E. M. McCreight. Organization and maintenance of large ordered indices. Acta Inform., 1:173-189, 1972.
4. R. Bayer and K. Unterauer. Prefix B-trees. ACM TODS, 2(1):11-26, 1977.
5. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In Proc. SIGMOD, pages 322-331, 1990.
6. S. Berchtold, C. Böhm, H.-P. Kriegel, J. Sander, and H. Jagadish. Independent quantization: An index compression technique for high-dimensional data spaces. In Proc. ICDE, pages 577-588, 2000.
7. S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-tree: An index structure for high-dimensional data. In Proc. VLDB, pages 28-39, 1996.
8. D. J. Berndt and J. Clifford. Using dynamic time warping to find patterns in time series. In AAAIKDD Workshop, pages 229-248, 1994.
9. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is nearest neighbors meaningful. In Proc. ICDT, pages 217-235, 1999.
10. C. Böhm, S. Berchtold, and D. A. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM CSUR, 33(3):322-373, 2001.
11. C. Chatfield. The Analysis of Time Series: an Introduction. Chapman and Hall, 1996.
12. S. Chien and N. Immorlica. Semantic similarity between search engine queries using temporal correlation. In Proc. WWW, pages 2-11, 2005.
13. C. Faloutsos. Searching Multimedia Databases by Content. Kluwer, 1996.
14. P. Ferragina and R. Grossi. The string b-tree: A new data structure for string search in external memory and its applications. J. ACM, 46(2):236-280, 1999.
15. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. SIGMOD, pages 47-57, 1984.
16. E. Keogh. Exact indexing of dynamic time warping. In Proc. VLDB, 2002.
17. E. Keogh. UCR time series archive, http://www.cs.ucr.edu/~eamonn/TSDMA/ datasets.html, 2006.
18. E. Keogh, K. Chakrabarti, M. Pazzani, and Mehrotra. Dimensionality reduction for fast similarity search in large time series databases. KAIS, pages 263-286, 2000.
19. Keogh, E., Kasetty, S. On the need for time series data mining benchmarks: A survey and empirical demonstration. In Proc. SIGKDD, pages 102-111, 2002.
20. J. Lin, E. Keogh, S. Lonardi, and B. Chiu. A symbolic representation of time series, with implications for streaming algorithms. In Proc. SIGMOD workshop DMKD, pages 2-11, 2003.
21. K.-I. Lin, H. V. Jagadish, and C. Faloutsos. The tv-tree: An index structure for high-dimensional data. VLDB Journal, 3(4):517-542, 1994.
22. B. Liu, R. Jones, and K. L. Klinkner. Measuring the meaning in time series clustering of text search queries. In Proc. CIKM, pages 836-837, 2006.
23. H. Sakoe and S. Chiba. A dynamic programming approach to continuous speech recognition. In Proc. ICA, pages 65 -68, 1971.
24. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The A-tree: An index structure for high-dimensional spaces using relative approximation. In Proc. VLDB, pages 516-526, 2000.
25. T. Seidl and H.-P. Kriegel. Optimal multi-step k-nearest neighbor search. In Proc. SIGMOD, pages 154-165, 1998.
26. D. Shasha and Y. Zhu. High performance discovery in time series. Springer, New York, 2004.
27. M. Vlachos, C. Meek, Z. Vagena, and D. Gunopulos. Identifying similarities, periodicities and bursts for online search queries. In Proc. SIGMOD, pages 131-142, 2004.
28. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. VLDB, pages 194-205, 1998.
29. B.-K. Yi and C. Faloutsos. Fast time sequence indexing for arbitrary Ip norms. In Proc. VLDB, pages 385-394, 2000.
30. Y. Zhu and D. Shasha. Warping indexes with envelope transforms for query by humming. In Proc. SIGMOD, pages 181-192, 2003.