The TS-tree: efficient time series search and retrieval
暂无分享,去创建一个
Ira Assent | Ralph Krieger | Thomas Seidl | Farzad Afschari | T. Seidl | I. Assent | R. Krieger | Farzad Afschari
[1] Hans-Peter Kriegel,et al. The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.
[2] Rudolf Bayer,et al. Organization and maintenance of large ordered indexes , 1972, Acta Informatica.
[3] Eamonn J. Keogh,et al. A symbolic representation of time series, with implications for streaming algorithms , 2003, DMKD '03.
[4] P. A. Blight. The Analysis of Time Series: An Introduction , 1991 .
[5] Donald J. Berndt,et al. Using Dynamic Time Warping to Find Patterns in Time Series , 1994, KDD Workshop.
[6] Hans-Jörg Schek,et al. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.
[7] Roberto Grossi,et al. The string B-tree: a new data structure for string search in external memory and its applications , 1999, JACM.
[8] Christos Faloutsos,et al. Efficient Similarity Search In Sequence Databases , 1993, FODO.
[9] Dennis Shasha,et al. Warping indexes with envelope transforms for query by humming , 2003, SIGMOD '03.
[10] Steve Chien,et al. Semantic similarity between search engine queries using temporal correlation , 2005, WWW '05.
[11] Eamonn J. Keogh,et al. Exact indexing of dynamic time warping , 2002, Knowledge and Information Systems.
[12] Hiroaki Sakoe,et al. A Dynamic Programming Approach to Continuous Speech Recognition , 1971 .
[13] Christian Böhm,et al. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases , 2001, CSUR.
[14] Christian Böhm,et al. Independent quantization: an index compression technique for high-dimensional data spaces , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[15] Christos Faloutsos,et al. Searching Multimedia Databases by Content , 1996, Advances in Database Systems.
[16] Marios Hadjieleftheriou,et al. R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.
[17] Masatoshi Yoshikawa,et al. The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation , 2000, VLDB.
[18] Eamonn J. Keogh,et al. Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases , 2001, Knowledge and Information Systems.
[19] Eamonn J. Keogh,et al. On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration , 2002, Data Mining and Knowledge Discovery.
[20] Hans-Peter Kriegel,et al. Optimal multi-step k-nearest neighbor search , 1998, SIGMOD '98.
[21] Dimitrios Gunopulos,et al. Identifying similarities, periodicities and bursts for online search queries , 2004, SIGMOD '04.
[22] Dennis Shasha,et al. High Performance Discovery In Time Series: Techniques And Case Studies (Monographs in Computer Science) , 2004 .
[23] Rudolf Bayer,et al. Prefix B-trees , 1977, TODS.
[24] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[25] Christos Faloutsos,et al. Fast Time Sequence Indexing for Arbitrary Lp Norms , 2000, VLDB.
[26] R. Bayer,et al. Organization and maintenance of large ordered indices , 1970, SIGFIDET '70.
[27] Jonathan Goldstein,et al. When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.
[28] Bing Liu,et al. Measuring the meaning in time series clustering of text search queries , 2006, CIKM '06.
[29] Christos Faloutsos,et al. The TV-tree: An index structure for high-dimensional data , 1994, The VLDB Journal.
[30] Dennis Shasha,et al. High Performance Discovery in Time Series , 2004, Monographs in Computer Science.