TQuEST: Threshold Query Execution for Large Sets of Time Series

  • Johannes Aßfalg
  • Hans-Peter Kriegel
  • Peer Kröger
  • Peter Kunath
  • Alexey Pryakhin
  • Matthias Renz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3896)

Abstract

Effective and efficient data mining in time series databases is essential in many application domains as for instance in financial analysis, medicine, meteorology, and environmental observation. In particular, temporal dependencies between time series are of capital importance for these applications. In this paper, we present TQuEST, a powerful query processor for time series databases. TQuEST supports a novel but very useful class of queries which we call threshold queries. Threshold queries enable searches for time series whose values are above a user defined threshold at certain time intervals. Example queries are ”report all ozone curves which are above their daily mean value at the same time as a given temperature curve exceeds 28°C” or ”report all blood value curves from patients whose values exceed a certain threshold one hour after the new medication was taken”. TQuEST is based on a novel representation of time series which allows the query processor to access only the relevant parts of the time series. This enables an efficient execution of threshold queries. In particular, queries can be readjusted with interactive response times.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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, Santa Barbara, CA (2001)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Chan, K., Fu, W.: Efficient Time Series Matching by Wavelets. In: Proc. 15th Int. Conf. on Data Engineering (ICDE 1999), Sydney, Australia (1999)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Cai, Y., Ng, R.: Index Spatio-Temporal Trajectories with Chebyshev Polynomials. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Paris, France (2004)Google Scholar
  6. 6.
    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, Atlantic City, NJ (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Johannes Aßfalg
    • 1
  • Hans-Peter Kriegel
    • 1
  • Peer Kröger
    • 1
  • Peter Kunath
    • 1
  • Alexey Pryakhin
    • 1
  • Matthias Renz
    • 1
  1. 1.Institute for Computer ScienceUniversity of Munich 

Personalised recommendations