Abstract
Similarity search in time series data is required in many application fields. The most prominent work has focused on similarity search considering either complete time series or similarity according to subsequences of time series. For many domains like financial analysis, medicine, environmental meteorology, or environmental observation, the detection of temporal dependencies between different time series is very important. In contrast to traditional approaches which consider the course of the time series for the purpose of matching, coarse trend information about the time series could be sufficient to solve the above mentioned problem. In particular, temporal dependencies in time series can be detected by determining the points of time at which the time series exceeds a specific threshold. In this paper, we introduce the novel concept of threshold queries in time series databases which report those time series exceeding a user-defined query threshold at similar time frames compared to the query time series. We present a new efficient access method which uses the fact that only partial information of the time series is required at query time. The performance of our solution is demonstrated by an extensive experimental evaluation on real world and artificial time series data.
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
Keogh, E., Chakrabati, K., Mehrotra, S., Pazzani, M.: Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases. In: Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 2001), Santa Barbara, CA (2001)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, SIGMOD 1984 (1984)
Agrawal, R., Faloutsos, C., Swami, A.: Efficient Similarity Search in Sequence Databases. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol. 730, Springer, Heidelberg (1993)
Chan, K., Fu, W.: Efficient Time Series Matching by Wavelets. In: Proc. 15th Int. Conf. on Data Engineering (ICDE 1999), Sydney, Australia (1999)
Yi, B.K., Faloutsos, C.: Fast Time Sequence Indexing for Arbitrary Lp Norms. In: Proc. 26th Int. Conf. on Very Large Databases (VLDB 2000), Cairo, Egypt (2000)
Korn, F., Jagadish, H., Faloutsos, C.: Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences. In: Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 1997), Tucson, AZ (1997)
Cai, Y., Ng, R.: Index Spatio-Temporal Trajectories with Chebyshev Polynomials. In: Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 2004), Paris, France (2004)
Faloutsos, C., Ranganathan, M., Maolopoulos, Y.: Fast Subsequence Matching in Time-series Databases. In: Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 1994), Minneapolis, MN (1994)
Ratanamahatana, C.A., Keogh, E.J., Bagnall, A.J., Lonardi, S.: A novel bit level time series representation with implication of similarity search and clustering. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 771–777. Springer, Heidelberg (2005)
Eiter, T., Mannila, H.: Distance Measure for Point Sets and Their Computation. Acta Informatica 34, 103–133 (1997)
Kriegel, H.-P., Pötke, M., Seidl, T.: Object-relational indexing for general interval relationships. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, p. 522. Springer, Heidelberg (2001)
Gaede, V., Günther, O.: Multidimensional Access Methods. Computing Surveys 30 (1984)
Beckmann, N., Kriegel, H.P., Seeger, B., Schneider, R.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 1990), Atlantic City, NJ (1990)
Fournier, A., Moniwno, D.Y.: Triangulating simple polygons and equivalent problems. ACM Trans. Graph. 3,2, 153–174 (1984)
Hjaltason, G., Samet, H.: Ranking in Spatial Databases. In: Proc. Int. Symp. on Large Spatial Databases (SSD 1995), Portland, OR (1995)
Spellman, P., Sherlock, G., Zhang, M., Iyer, V., Anders, K., Eisen, M., Brown, P., Botstein, D., Futcher, B.: Comprehensive Identification of Cell Cycle-Regulated Genes of the Yeast Saccharomyces Cerevisiae byMicroarray Hybridization. Molecular Biolology of the Cell 9, 3273–3297 (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
Aßfalg, J., Kriegel, HP., Kröger, P., Kunath, P., Pryakhin, A., Renz, M. (2006). Similarity Search on Time Series Based on Threshold Queries. In: Ioannidis, Y., et al. Advances in Database Technology - EDBT 2006. EDBT 2006. Lecture Notes in Computer Science, vol 3896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11687238_19
Download citation
DOI: https://doi.org/10.1007/11687238_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32960-2
Online ISBN: 978-3-540-32961-9
eBook Packages: Computer ScienceComputer Science (R0)