Using multiple indexes for efficient subsequence matching in time-series databases
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lim, Seung-Hwan | - |
dc.contributor.author | Park, Hee-Jin | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.date.accessioned | 2022-12-21T11:44:12Z | - |
dc.date.available | 2022-12-21T11:44:12Z | - |
dc.date.created | 2022-08-26 | - |
dc.date.issued | 2006-04 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/181612 | - |
dc.description.abstract | Time-series subsequence matching is an operation that searches for such data subsequences whose changing patterns are similar to a query sequence from 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 resolve 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 in the perspective of physical database design. For this, given a set of pairs (length, frequency) 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. 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 perform a series of experiments with a real-life stock data set and a large volume of a synthetic data set to show the superiority of our approach. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.title | Using multiple indexes for efficient subsequence matching in time-series databases | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Park, Hee-Jin | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.doi | 10.1007/11733836_7 | - |
dc.identifier.scopusid | 2-s2.0-33745515351 | - |
dc.identifier.wosid | 000238093200007 | - |
dc.identifier.bibliographicCitation | DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS, v.3882, pp.65 - 79 | - |
dc.relation.isPartOf | DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS | - |
dc.citation.title | DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS | - |
dc.citation.volume | 3882 | - |
dc.citation.startPage | 65 | - |
dc.citation.endPage | 79 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | QUERIES | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/11733836_7 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.