시퀀스 데이터베이스를 위한 타임 워핑 기반 유사 검색

A Method for Time Warping Based Similarity Search in Sequence Databases

In this paper, we propose a new novel method for similarity search that supports time warping. Our primary goal is to innovate on search performance in large databases without false dismissal. To attain this goal. we devise a new distance function Dtw-lb that consistently underestimates the time warping distance and also satisfies the triangular inequality. Dtw-lb uses a 4-tuple feature vector extracted from each sequence and is invariant to time warping. For efficient processing, we employ a multidimensional index that uses the 4-tuple feature vector as indexing attributes and Dtw-lb as a distance function. We prove that our method does not incur false dismissal. To verify the superiority of our method, we perform extensive experiments. The results reveal that our method achieves significant speedup up to 43 times with real-world S&P 500 stock data.