Similarity search in time-series databases is an operation that finds such data sequences whose changing patterns are similar to that of a query sequence. Typically, it hires the multi-dimensional index for its efficient processing. In order to alleviate the dimensionality curse, a problem in high-dimensional cases, the previous methods for similarity search apply the Discrete Fourier Transform(DFT) to data sequences, and take only the first two or three DFT coefficients for selecting organizing attributes of the multi-dimensional index. Other than this ad-hoc approach, there have been no research efforts on devising a systematic guideline for choosing the best organizing attributes among all the DFT coefficients. This paper first points out the problems occurred in the previous methods, and proposes a novel solution to construct the optimal multi-dimensional index. The proposed method analyzes the characteristics of a target database, and then identifies the organizing attributes having the best discrimination power. Finally, it determines the optimal number of organizing attributes by using a cost model for similarity search. We show the effectiveness of the proposed method through a series of experiments.
|Title of host publication||18th International Conference on Computers and Their Applications 2003, CATA 2003|
|Editors||Narayan C. Debnath|
|Publisher||The International Society for Computers and Their Applications (ISCA)|
|Number of pages||4|
|Publication status||Published - 2003|
|Event||18th International Conference on Computers and Their Applications, CATA 2003 - Honolulu, United States|
Duration: 2003 Mar 26 → 2003 Mar 28
|Name||18th International Conference on Computers and Their Applications 2003, CATA 2003|
|Conference||18th International Conference on Computers and Their Applications, CATA 2003|
|Period||03/3/26 → 03/3/28|
Bibliographical noteFunding Information:
This research was partially supported by the 2002 Basic Research Program (Grant R05-2002-000-01085-0) of the KOSEF and the 2001 University Research Program of the MIC in Korea. Sang-Wook Kim would like to thank Jung-Hee Seo, Suk-Yeon Hwang, Grace(Joo-Young) Kim, and Joo-Sung Kim for their warm encouragement and support.
© 18th International Conference on Computers and Their Applications 2003, CATA 2003. All rights reserved.
All Science Journal Classification (ASJC) codes
- Computer Science(all)