Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2007.14-D.7.727

Efficient Similarity Search in Multi-attribute Time Series Databases  

Lee, Sang-Jun (숭실대학교 컴퓨터학부)
Abstract
Most of previous work on indexing and searching time series focused on the similarity matching and retrieval of one-attribute time series. However, multimedia databases such as music, video need to handle the similarity search in multi-attribute time series. The limitation of the current similarity models for multi-attribute sequences is that there is no consideration for attributes' sequences. The multi-attribute sequences are composed of several attributes' sequences. Since the users may want to find the similar patterns considering attributes's sequences, it is more appropriate to consider the similarity between two multi-attribute sequences in the viewpoint of attributes' sequences. In this paper, we propose the similarity search method based on attributes's sequences in multi-attribute time series databases. The proposed method can efficiently reduce the search space and guarantees no false dismissals. In addition, we give preliminary experimental results to show the effectiveness of the proposed method.
Keywords
Similarity Search; Time Series; Database;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Tamer Kahveci, Ambuj Singh and Aliekber Gurel, 'Similarity Searching for Multi-attribute Sequences,' Proceedings of International Conference on Scientific and Statistical Database Management, pp.175-184, 2002   DOI
2 Joseph M. Hellerstein, Elias Koutsoupias, and Christos H. Papadimitriou, 'On the Analysis of Indexing Schemes,' Proceedings of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp.249-256, 1997
3 Ada Wai-Chee Fu, Eamonn J. Keogh, Leo Yung Hang Lau, Chotirat (Ann) Ratanamahatana, 'Scaling and Time Warping in Time Series Querying,' Proceedings of International Conference on Very Large Data Bases, pp.649-660, 2005
4 Eamonn J. Keogh, Li Wei, Xiaopeng Xi, Sang-Hee Lee, Michail Vlachos, 'LB_Keogh Supports Exact Indexing of Shapes under Rotation Invariance with Arbitrary Representations and Distance Measures,' Proceedings of International Conference on Very Large Data Bases, pp.882-893, 2006
5 Eamonn J. Keogh, 'Exact Indexing of Dynamic Time Warping,' Proceedings of International Conference on Very Large Data Bases, pp.406-417, 2002
6 Sanghyun Park, Wesley W. Chu, Jeehee Yoon, Chihcheng Hsu, 'Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases,' Proceedings of International Conference on Data Engineering, pp.23-32, 2000
7 Seok-Lyong Lee, Seok-Ju Chun, Deok-Hwan Kim, Ju-Hong Lee and Chin-Wan Chung, 'Similarity Search for Multidimensional Data Sequences,' Proceedings of International Conference on Data Engineering, pp.599-608, 2000   DOI
8 Michail Vlachos, G.Kollios and Dimitrios Gunopulos, 'Discovering Similar Multidimensional Trajectories,' Proceedings of International Conference on Data Engineering, pp.673-684, 2002   DOI
9 Rakesh Agrawal, Christos Faloutsos and Arun N. Swami, 'Efficient Similarity Search in Sequence Databases,' Proceedings of the International Conference of Foundations of Data Organization and Algorithms, pp.69-84, 1993
10 Byoung-Kee Yi, Christos Faloutsos, 'Fast Time Sequence Indexing for Arbitrary Lp Norms,' Proceedings of International Conference on Very Large Data Bases, pp. 385-394, 2000
11 Byoung-Kee Yi, H. V. Jagadish, Christos Faloutsos, 'Efficient Retrieval of Similar Time Sequences Under Time Warping,' Proceedings of International Conference on Data Engineering, pp.201-208, 1998   DOI
12 Yang-Sae Moon and Jinho Kim, 'A Single Index Approach for Time-Series Subsequence Matching that Supports Moving Average Transform of Arbitrary Order,' Proceedings of Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp.739-749, 2006   DOI
13 Sang-Wook Kim, Dae-Hyun Park, Heon-Gil Lee, 'Efficient Processing of Subsequence Matching with the Euclidean Metric in Time-series Databases,' Information Process. Letters, Vol. 90(5), pp.253-260, 2004   DOI   ScienceOn
14 Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider and Bernhard Seeger, 'The R*-tree: An Efficient and Robust Access Method for Points and Rectangles,' Proceedings of ACM SIGMOD International Conference on Management of Data, pp.322-331, 1990   DOI
15 Flip Korn, H. V. Jagadish, Christos Faloutsos, 'Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences,' Proceedings of ACM SIGMOD International Conference on Management of Data, pp.289-300, 1997   DOI
16 Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehrotra, Michael J. Pazzani, 'Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases,' Proceedings of ACM SIGMOD International Conference on Management of Data, pp.151-162, 2001   DOI   ScienceOn
17 Sangwook Kim, Sanghyun Park and W. Chu, 'An Index-based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases,' Proceedings of International Conference on Data Engineering, pp.607-614, 2001   DOI
18 Davood Rafiei, Alberto O. Mendelzon, 'Similarity-Based Queries for Time Series Data,' Proceedings of ACM SIGMOD International Conference on Management of Datae, pp.13-25, 1997   DOI
19 Antonin Guttman, 'R-trees: A Dynamic Index Structure for Spatial Searching,' Proceedings of ACM SIGMOD International Conference on Management of Data, pp.47-57, 1984
20 Sangjun Lee, Bumsoo Kim, Sukho Lee, 'Efficient Range Search Method for Multi-dimensional Sequence Databases,' KISS Journal, Vol. 26(5), pp.613-620, 1999
21 Kin-pong Chan, Ada Wai-chee Fu, 'Efficient Time Series Matching by Wavelets,' Proceedings of International Conference on Data Engineering, pp.126-133, 1999   DOI