Comparison of generalmatch and its dual approach in time-series subsequence matching

초록

Subsequence matching has been widely used for a variety of applications in time-series databases. FRM and DualMatch were proposed as prior efficient solutions for subsequence matching. As the generalized solution, GeneralMatch was also proposed, and DualGMatch was recently proposed as its dual approach. In this paper, we first review GeneralMatch and DualGMatch in the viewpoint of constructing windows. We then theoretically compare those solutions by analyzing the maximum window size and the number of points stored in the index. We also empirically compare GeneralMatch and DualGMatch for the number of page accesses on the real stock data. Based on the comparison, we conclude that GeneralMatch is much superior to DualGMatch © 2015, ISSN 1881-803X.

키워드