16th International Conference on Scientific and Statistical Database Management (SSDBM'04) Santorini Island, Greece June 21-June 23 ISBN: 0-7695-2146-0
In this paper, we present an algorithm for identifying frequently occurring items within a sliding window of the last N items seen over an infinite data stream, given the following constraints.
Citation:
Lukasz Golab, David DeHaan, Alejandro L?pez-Ortiz, Erik D. Demaine, "Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies," ssdbm, pp.425, 16th International Conference on Scientific and Statistical Database Management (SSDBM'04), 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||