Atlanta, GA, USA
April 3, 2006 to April 7, 2006
Guifang Duan , Ritsumeikan University, Japan
Yu Suzuki , Ritsumeikan University, Japan
Kyoji Kawagoe , Ritsumeikan University, Japan
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDEW.2006.63
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a multidimensional structure. In this paper, we introduce a new technique, which we called grid representation, based on a grid approximation of the data. We propose a lower bounding distance measure that enables a bitmap approach for fast computation and searching. We also show how grid representation can be indexed with a multidimensional index structure, and demonstrate its superiority.
Guifang Duan, Yu Suzuki, Kyoji Kawagoe, "Grid Representation for Efficient Similarity Search in Time Series Databases", ICDEW, 2006, 2006 22nd International Conference on Data Engineering Workshops, 2006 22nd International Conference on Data Engineering Workshops 2006, pp. x123, doi:10.1109/ICDEW.2006.63