Subsequence matching under time warping in time-series databases: Observation, optimization, and performance results

This paper discusses effective processing of subsequence matching under time warping in time-series databases. Time warping ¡s a transformation that enables the finding of sequences with similar patterns even when they are of different lengths. Through a preliminary experiment, we first point out that the performance bottleneck of Naive-Scan, a basic method for processing of subsequence matching under time warping, occurs in the CPU processing step. Then, we propose a novel method that optimizes such CPU processing step of Naive-Scan. The proposed method maximizes the CPU performance by eliminating all the redundant calculations required in computing the time warping distance of the query sequence against data subsequences. We formally prove that the proposed method is not only an optimal one for processing Naive-Scan but also does not incur false dismissals. Also, we discuss how to apply the proposed method to the post-processing step of LB-Scan and ST-Filter, the two well-known methods that employ the filtering step. Then, we quantitatively verify the performance improvement effects obtained by the proposed method via extensive experiments. The results show that the performance of all the three previous methods improves by employing the proposed method. In particular, Naive-Scan, which has been known to show the worst performance, performs much better than LB-Scan as well as ST-Filter in all the cases by employing the proposed method for their CPU processing. This result is so interesting and valuable in that the performance inversion among Naive-Scan, LB-Scan, and ST-Filter has occurred by optimizing the CPU processing step, which is their common performance bottleneck.