• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Approximate counts and quantiles over sliding windows (2004)

Cached

  • Download as a PDF

Download Links

  • [web.cacs.louisiana.edu]
  • [www.cacs.louisiana.edu]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [infolab.stanford.edu]
  • [magna.cs.ucla.edu]
  • [www-db.stanford.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Arvind Arasu
Venue:In PODS
Citations:97 - 1 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Arasu04approximatecounts,
    author = {Arvind Arasu},
    title = {Approximate counts and quantiles over sliding windows},
    booktitle = {In PODS},
    year = {2004},
    pages = {286--296}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We consider the problem of maintaining ɛ-approximate counts and quantiles over a stream sliding window using limited space. We consider two types of sliding windows depending on whether the number of elements N in the window is fixed (fixed-size sliding window) or variable (variable-size sliding window). In a fixed-size sliding window, both the ends of the window slide synchronously over the stream. In a variable-size sliding window, an adversary slides the window ends independently, and therefore has the ability to vary the number of elements N in the window. We present various deterministic and randomized algorithms for approximate counts and quantiles. All of our algorithms require O ( 1 1 polylog ( , N)) space. For quantiles, this space ɛ ɛ requirement is an improvement over the previous best bound of O ( 1 ɛ2 polylog ( 1, N)). We believe that no previous work ɛ on space-efficient approximate counts over sliding windows exists. 1.

Keyphrases

approximate count    sliding window    variable-size sliding window    fixed-size sliding window    window exists    randomized algorithm    limited space    window slide    previous work    adversary slide    space requirement    algorithm require    space-efficient approximate count   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University