Skip to main content

Approximate Similarity Search over Multiple Stream Time Series

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4443))

Abstract

Similarity search over stream time series has a wide spectrum of applications. Most previous work in static time-series databases and stream time series aim at retrieving the exact answer to a similarity search. However, little work considers the approximate similarity search in stream time series. In this paper, we propose a weighted locality-sensitive hashing (WLSH) technique, which is adaptive to characteristics of stream data, to answer approximate similarity search over stream time series. Due to the unique requirement of stream processing, we present an efficient method to update hash functions adaptive to stream data and maintain hash files incrementally at a low cost. Extensive experiments demonstrate the effectiveness of WLSH, as well as the efficiency of approximate similarity search via hashing on stream time series.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chen, L., et al.: Robust and fast similarity search for moving object trajectories. In: SIGMOD (2005)

    Google Scholar 

  2. Cranor, C., et al.: Gigascope: a stream database for network applications. In: SIGMOD (2003)

    Google Scholar 

  3. Gionis, A., et al.: Similarity search in high dimensions via hashing. In: VLDB (1999)

    Google Scholar 

  4. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC (1998)

    Google Scholar 

  5. Liu, X., Ferhatosmanoglu, H.: Efficient kNN search on streaming data series. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J.F., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol. 2750, Springer, Heidelberg (2003)

    Google Scholar 

  6. Wu, H., et al.: Online event-driven subsequence matching over financial data streams. In: SIGMOD (2004)

    Google Scholar 

  7. Zhu, Y., Shasha, D.: Efficient elastic burst detection in data streams. In: SIGKDD (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ramamohanarao Kotagiri P. Radha Krishna Mukesh Mohania Ekawit Nantajeewarawat

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lian, X., Chen, L., Wang, B. (2007). Approximate Similarity Search over Multiple Stream Time Series. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_86

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71703-4_86

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71702-7

  • Online ISBN: 978-3-540-71703-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics