Using multiple indexes for efficient subsequence matching in time-series databases
- Authors
- Lim, Seung Hwan; Park, Heejin; Kim, Sang Wook
- Issue Date
- Dec-2007
- Publisher
- ELSEVIER SCIENCE INC
- Keywords
- time-series databases; subsequence matching; index interpolation; physical database design
- Citation
- INFORMATION SCIENCES, v.177, no.24, pp.5691 - 5706
- Indexed
- SCIE
SCOPUS
- Journal Title
- INFORMATION SCIENCES
- Volume
- 177
- Number
- 24
- Start Page
- 5691
- End Page
- 5706
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/179305
- DOI
- 10.1016/j.ins.2007.07.004
- ISSN
- 0020-0255
- Abstract
- A time-series database is a set of data sequences, each of which is a list of changing values of an object in a given period of time. Subsequence matching is an operation that searches for such data subsequences whose changing patterns are similar to a query sequence in a time-series database. This paper addresses a performance issue of time-series subsequence matching. First, we quantitatively examine the performance degradation caused by the window size effect, and then show that the performance of subsequence matching with a single index is not satisfactory in real applications. We claim that index interpolation is a fairly effective tool to solve this problem. Index interpolation performs subsequence matching by selecting the most appropriate one from multiple indexes built on windows of their distinct sizes. For index interpolation, we need to decide the sizes of windows for multiple indexes to be built. In this paper, we solve the problem of selecting optimal window sizes from the perspective of physical database design. Given a set of pairs (length,ftequency) of query sequences to be performed in a target application and a set of window sizes for building multiple indexes, we devise a formula that estimates the overall cost of all the subsequence matchings performed in a target application. By using this formula, we propose an algorithm that determines the optimal window sizes for maximizing the performance of entire subsequence matchings. We formally prove the optimality as well as the effectiveness of the algorithm. Finally, we show the superiority of our approach by performing extensive experiments with a real-life stock data set and a large volume of synthetic data sets.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/179305)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.