Grid-based indexing for large time series databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2690, Issue , 2004, Pages 614-621

  An, Jiyuan ^a   Chen, Hanxiong ^a   Furuse, Kazutaka ^a   Ohbo, Nobuo ^a   Keogh, Eamonn ^b  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENGINEERING EDUCATION; TIME SERIES;

DIMENSIONALITY REDUCTION; EXPERIMENTAL COMPARISON; GRID-BASED INDEXING; HIGH-DIMENSIONAL; INDEX STRUCTURE; LARGE TIME SERIES DATABASE; MULTI-DIMENSIONAL INDEX STRUCTURES; SIMILARITY SEARCH;

DATA REDUCTION;

EID: 35048855086     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (12)

1. R. Agrawal, C. Faloutsos, and A. N. Swami. Efficient similarity search in sequence databases. In Proceedings of 4th conference on FODO, pages 69-84, 1993.
2. J. An, H. Chen, K. Furuse, M. Ishikawa, and N. Ohbo. The convex polyhedra technique: An index strucrture for high-dimensional space. In Proc. of the 13th Australasian Database Conference, pages 33-40, 2002.
3. J. An, H. Chen, K. Furuse, M. Ishikawa, and N. Ohbo. A vector-wise dimensionality reduction for indexing high dimensional data. In Proc. of Pan-Yellw-Sea International Workshop on Information Technologies for Network Era, pages 135-142, 2002.
4. N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger. The R*-tree:an efficient and robust access method for points and rectangles. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pages 322-331, 1990.
5. K. Chakrabarti and S. Mehrotra. Locally dimensionality reduction: A new approach to indexing high dimensional spaces. In Proceedings of 26th International Conference on Very Large Data Bases, pages 151-162, 2000.
6. II. Chen, J. An, K. Furuse, and N. Ohbo. C2VA:trim high dimensional indexes. In Proc. WAIM2002, pages 303-315, 2002.
7. A. Guttman. R-tree:a dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pages 47-57, 1984.
8. N. Katayama and S. Satoh. The sr-tree: An index structure for high-dimensional nearest neighbor queries. In Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, pages 369-380, 1997.
9. E. J. Keogh, K. Chakrabarti, S. Mehrotra, and M. J. Pazzani. Locally adaptive dimensionality reduction for indexing large time series databases. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, pages 151-162, 2001.
10. E. J. Keogh and M. J. Pazzahi. A simple dimensionality reduction technique for fast similarity search in large time series databases. In Proceedings of the Pacific-Asia Conference on Knowledage Discovery and Data Mining (PAKDD'00), pages 122-133, 2000.
11. G. Moody. Mit-bih database distribution [http://ecg.mit.edu/index.html]. In Cambridge, MA., 2000.
12. R. Weber, H. J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of 24th International Conference on Very Large Data Bases, pages 194-205, 1998.