Sublinear Methods for Detecting Periodic Trends in Data Streams

  • Funda Ergun
  • S. Muthukrishnan
  • S. Cenk Sahinalp
Conference paper

DOI: 10.1007/978-3-540-24698-5_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2976)
Cite this paper as:
Ergun F., Muthukrishnan S., Sahinalp S.C. (2004) Sublinear Methods for Detecting Periodic Trends in Data Streams. In: Farach-Colton M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg

Abstract

We present sublinear algorithms — algorithms that use significantly less resources than needed to store or process the entire input stream – for discovering representative trends in data streams in the form of periodicities. Our algorithms involve sampling Õ\((\sqrt{n})\) positions. and thus they scan not the entire data stream but merely a sublinear sample thereof. Alternately, our algorithms may be thought of as working on streaming inputs where each data item is seen once, but we store only a sublinear – Õ\((\sqrt{n})\) – size sample from which we can identify periodicities. In this work we present a variety of definitions of periodicities of a given stream, present sublinear sampling algorithms for discovering them, and prove that the algorithms meet our specifications and guarantees. No previously known results can provide such guarantees for finding any such periodic trends. We also investigate the relationships between these different definitions of periodicity.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Funda Ergun
    • 1
  • S. Muthukrishnan
    • 2
  • S. Cenk Sahinalp
    • 1
  1. 1.Department of EECSCase Western Reserve University 
  2. 2.Department of Computer ScienceRutgers University 

Personalised recommendations