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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Faloutsos, C., Swami, A.: Efficient Similarity Search in Sequence DataBases. In: Proc. Int’l Conf. on Foundations of Data Organization and Algorithms (FODO), Chicago, Illinois, October 1993, pp. 69–84 (1993)
Agrawal, R., et al.: Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Database. In: Proc. Int’l Conf. on Very Large Data Bases (VLDB), Zurich, Switzerland, September 1995, pp. 490–501 (1995)
Beckmann, N., et al.: The R*-tree: An efficient and Robust Access Method for Points and Rectangles. In: Proc. Int’l Conf. on Management of Data, ACM SIGMOD, Atlantic City, New Jersey, pp. 322–331 (May 1990)
Chan, K.P., Fu, A.W.C.: Efficient Time Series Matching by Wavelets. In: Proc. Int’l Conf. on Data Engineering (ICDE), Sydney, Australia, pp. 126–133. IEEE, Los Alamitos (1999)
Chu, K.K.W., Wong, M.H.: Fast Time-Series Searching with Scaling and Shifting. In: Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Philadelphia, Pennsylvania, pp. 237–248. ACM, New York (1999)
Argyros, T., Ermopoulos, C.: Efficient Subsequence Matching in Time Series Databases Under Time and Amplitude Transformations. In: ICDM (2003)
Faloutsos, C., et al.: Fast Subsequence Matching in Time-Series Databases. In: Proc. Int’l Conf. on Management of Data, ACM SIGMOD, Minneapolis, Minnesota, pp. 419–429 (May 1994)
Goldin, D.Q., Kanellakis, P.C.: On Similarity Queries for Time-Series Data: Constraint Specification and Implementation. In: Proc. Int’l Conf. on Principles and Practice of Constraint Programming, Cassis, France, September 1995, pp. 137–153 (1995)
Kahveci, T., Ambuj, K.S.: Variable Length Queries for Time Series Data. In: Proc. Int’l Conf. on Data Engineering (2001)
Kahveci, T., Ambuj, K.S.: Optimizing Similarity Search for Arbitrary Length Time Series Queries. IEEE Trans. Knowl. Data Eng. 16(4), 418–433 (2004)
Loh, W.K., Kim, S.W., Whang, K.Y.: A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases. Data Mining and Knowledge Discovery Journal 9(1), 5–28 (2004)
Moon, Y.S., et al.: Duality-Based Subsequence Matching in Time-Series Databases. In: Proc. Int’l Conf. on Data Engineering (ICDE), pp. 263–272. Heidelberg, Germany, Los Alamitos (2001)
Rafiei, D., Mendelzon, A.: Similarity-based Queries for Time-Series Data. In: Proc. Int’l Conf. on Management of Data, ACM SIGMOD, Tucson, Arizona, pp. 13–24 (June 1997)
Rafiei, D.: On Similarity-Based Queries for Time Series Data. In: Proc. Int’l Conf. on Data Engineering (ICDE), Sydney, Australia, pp. 410–417. IEEE, Los Alamitos (1999)
Weber, R., et al.: A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In: Proc. Int’l Conf. on Very Large Data Bases (VLDB), pp. 194–205. New York (August 1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lim, SH., Park, HJ., Kim, SW. (2006). Using Multiple Indexes for Efficient Subsequence Matching in Time-Series Databases. In: Li Lee, M., Tan, KL., Wuwongse, V. (eds) Database Systems for Advanced Applications. DASFAA 2006. Lecture Notes in Computer Science, vol 3882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11733836_7
Download citation
DOI: https://doi.org/10.1007/11733836_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33337-1
Online ISBN: 978-3-540-33338-8
eBook Packages: Computer ScienceComputer Science (R0)