An index-based time-series subsequence matching under time warping

초록

This paper addresses efficient processing of time-series subsequence matching under time warping. Time warping enables finding sequences with similar patterns even when they are of different lengths. The prefix-querying method is the first index-based approach that performs time-series subsequence matching under time warping without false dismissals. This method originally employs the L<inf>∞</inf> distance metric as a base distance function. This paper extends the prefix-querying method for absorbing L<inf>1</inf> instead of L <inf>∞</inf>. We formally prove that the extended prefix-querying method does not incur any false dismissals. The performance results reveal that our method achieves significant performance improvement over the previous methods up to 10.7 times.