Towards Identifying Frequent Items in Sliding Windows

@inproceedings{DeHaan2003TowardsIF,
  title={Towards Identifying Frequent Items in Sliding Windows},
  author={David DeHaan and Erik D. Demaine and Lukasz Golab and Alejandro L opez-Ortiz and J. Ian Munro},
  year={2003}
}
Queries that return a list of frequently occurring items are popular in the analysis of data streams such as real-time Internet traÆc logs. While several results exist for computing frequent item queries using limited memory in the in nite stream model, none have been extended to the limited-memory sliding window model, which considers only the last N items that have arrived at any given time and forbids the storage of the entire window in memory. We present several algorithms for identifying… CONTINUE READING