Performance bottleneck in time-series subsequence matching

Authors:
Sang-Wook Kim;Byeong-Soo Jeong
Affiliations:
Hanyang University, Seongdong, Seoul, Korea;Kyung Hee University, Yongin, Kyungki, Korea
Venue:
Proceedings of the 2005 ACM symposium on Applied computing
Year:
2005

Citing 13
Cited 0

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Fast subsequence matching in time-series databases

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Fast time-series searching with scaling and shifting

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Index interpolation: an approach to subsequence matching supporting normalization transform in time-series databases

Proceedings of the ninth international conference on Information and knowledge management
Prefix-querying: an approach for effective subsequence matching under time warping in sequence databases

Proceedings of the tenth international conference on Information and knowledge management
Efficient Similarity Search In Sequence Databases

FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Duality-Based Subsequence Matching in Time-Series Databases

Proceedings of the 17th International Conference on Data Engineering
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Fast Time Sequence Indexing for Arbitrary Lp Norms

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases

Proceedings of the 17th International Conference on Data Engineering
On Similarity-Based Queries for Time Series Data

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Exact indexing of dynamic time warping

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses a performance bottleneck in time-series subsequence matching. First, we analyze the disk access and CPU processing times required during the index searching and post-processing steps of subsequence matching through preliminary experiments. Based on their results, we show that the post-processing step is a main performance bottleneck in subsequence matching. In order to resolve the performance bottleneck, we propose a simple yet quite effective method that processes the post-processing step. By rearranging the order of candidate subsequences to be compared with a query sequence, our method completely eliminates the redundancies of disk accesses and CPU processing occurring in the post-processing step. We show that our method is optimal and also does not incur any false dismissal. Also, we justify the effectiveness of our method by extensive experiments.