Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2004.11D.5.1003

An Optimal Way to Index Searching of Duality-Based Time-Series Subsequence Matching  

Kim, Sang-Wook (한양대학교 정보통신학부)
Park, Dae-Hyun (강원대학교 컴퓨터정보통신공학부)
Lee, Heon-Gil (강원대학교 컴퓨터정보통신공학부)
Publication Information
The KIPS Transactions:PartD / v.11D, no.5, 2004 , pp. 1003-1010 More about this Journal
Abstract
In this paper, we address efficient processing of subsequence matching in time-series databases. We first point out the performance problems occurring in the index searching of a prior method for subsequence matching. Then, we propose a new method that resolves these problems. Our method starts with viewing the index searching of subsequence matching from a new angle, thereby regarding it as a kind of a spatial-join called a window-join. For speeding up the window-join, our method builds an R＊-tree in main memory for f query sequence at starting of sub-sequence matching. Our method also includes a novel algorithm for joining effectively one R＊-tree in disk, which is for data sequences, and another R＊-tree in main memory, which is for a query sequence. This algorithm accesses each R＊-tree page built on data sequences exactly cure without incurring any index-level false alarms. Therefore, in terms of the number of disk accesses, the proposed algorithm proves to be optimal. Also, performance evaluation through extensive experiments shows the superiority of our method quantitatively.
Keywords
Time-Series Databases; Subsequence Matching; Index Searching; Window-Join;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. K. Yi and C. Faloutsos, 'Fast Time Sequence Indexing for Arbitrary Lp Norms,' In Proc. Int'l. Conf. on Very Large Data Bases, VLDB, pp.385-394, 2000
2 D. Rafiei and A. Mendelzon, 'Similarity-Based Queries for Time-Series Data,' In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp.13-24, 1997   DOI
3 J. W. Song, K. Y. Whang, Y. K. Lee and S. W. Kim, 'Spatial Join Processing Using Corner Transformation,' IEEE Trans. on Knowledge and Data Engineering, Vol.11, No.4, pp.688-695, 1999   DOI   ScienceOn
4 W. K. Loh, S. W. Kim and K. Y. Whang, 'Index Interpolation : An Approach for Subsequence Matching Supporting Normalization Transform in Time-Series Databases,' In Proc. ACM Int'l. Conf. on Information and Knowledge Management, ACM CIKM, pp.480-487, 2000
5 Y. S. Moon, K. Y. Whang and W. K. Loh, 'Duality-Based Subsequence Matching in Time-Series Databases,' In Proc. IEEE Int'! Conf. on Data Engineering, IEEE ICDE, pp.263-272, 2001   DOI
6 E. J. Keogh et al., 'Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases,' In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp.419-429, May, 2001
7 P. P. Chan and A. W. C. Fu, 'Efficient Time-Series Matching By Wavelets,' In Proc. IEEE Int'l Conf. on Data Engineering, IEEE ICDE, pp.126-133, 1999   DOI
8 C. Faloutsos, M. Ranganathan and Y. Manolopoulos, 'Fast Subsequence Matching in Time-series Databases,' In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp.419-429, May, 1994   DOI   ScienceOn
9 Y.-W. Huang, N. Jing and E. A. Rundensteiner, 'Spatial Joins Using R-trees : Breadth-First Traversal with Global Optimizations,' In Proc. Int'l. Conf. on Very Large Data Bases, VLDB, pp.396-405, 1997
10 S. W. Kim, S. H. Park and W. W. Chu, 'An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases,' In Proc. IEEE Int'l. Conf. on Data Engineering, IEEE ICDE, pp.607-614, 2001   DOI
11 T. Brinkhoff, H.-P. Kriegel and B. Seeger, 'Efficient Processing of Spatial Joins Using R-Trees,' In Proc. ACM Int'l. Conf. on Management of Data, ACM SIGMOD, pp.237-246, 1993   DOI   ScienceOn
12 R. Agrawal, C. Faloutsos and A. Swami, 'Efficient Similarity Search in Sequence Databases,' In Proc. Int'l. Conf. on Foundations of Data Organization and Algorithms, FODO, pp.69-84, Oct., 1993
13 N. Beckmann et al., 'The $R^{\ast}$-tree: An Efficient and Robust Access Method for Points and Rectangles,' In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp.322-331, May, 1990