시퀀스 데이터베이스를 위한 서브시퀀스 탐색의 효율적인 처리

Efficient Processing of Subsequence Searching in Sequence Databases

  • 박상현 (IBM T.J. 왓슨 연구소) ;
  • 김상욱 (강원대학교 컴퓨터정보통신공학부) ;
  • 박정일 (강원대학교 정보통신공학과 대학원)
  • 발행 : 2001.06.30

초록

This paper deals with the subsequence searching problem under time-warping. Our work is motivated by the observation that subsequence searches slow down quadratically as the average length of data sequences increases. To resolve this problem, the Segment-Based Approach for Subsequence Searches (SBASS) is proposed. The SBASS divides data and query sequences into a series of segments, and retrieves all data subsequences. Our segmentation scheme allows segments to have different lengths; thus we employ the time warping distance as a similarity measure for each segment pair. For efficient retrieval of similar subsequences, we extract feature vectors from all data segments exploiting their monotonically changing properties, and build a spatial index using feature vectors. The effectiveness of our approach is verified through extensive experiments.

키워드

과제정보

연구 과제 주관 기관 : 강원대학교