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

• 영문명: Efficient Processing od Subsequence Searching in Sequence Databases
• 발행기관: 강원대학교 산업기술연구소
• 저자명: 박상현(Park Sang Hyun) 김상욱(Kim Sang Wook) 박정일(Park Jeong Il)
• 간행물 정보: 『산업기술연구』vol.21, 157~168쪽, 전체 12쪽
• 주제분류: 공학 > 공학일반
• 파일형태: PDF
• 발행일자: 2001.09.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.

목차

Abstract

1. 서론

2. 관련 연구

3. 세그먼트 기반 서브시퀀스 탐색 기법(SBASS)

4. 인덱스 생성

5. 질의 처리

6. 성능 평가

7. 결론

참고문헌

키워드

시퀀스 데이터베이스 서브시퀀스의 탐색 세그먼트 기반 접근 sequence database subsequence search segment-based approach