Jump to content

Lossy Count Algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Sumitcs300 (talk | contribs) at 16:44, 27 March 2014 (←Created page with '<!--- Don't mess with this line! --->{{Unreviewed}} <!--- Replace Subject of my article with the subject, and the ... after is with whatever your subject is. ---...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Template:Unreviewed Lossy Count Algorithm is an algorithm to identify elements in a data stream whose frequency count exceed a user-given threshold. The frequency computed by this algorithm is not always accurate, but has an error threshold that can be specified by the user. The amount of space required by the algorithm is inversely proportional to the space requirement of the algorithm, hence larger the error, the smaller the footprint. It was created by eminent computer scientists Rajeev Motwani and Gurmeet Singh Manku. This algorithm finds huge application in computations where data takes the form of a continuous data stream instead of a finite data set, for e.g. network traffic measurements, web server logs, click streams.



References


  • Motwani, R; Manku, G.S (2002). "Approximate frequency counts over data streams". VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases: 346–357. {{cite journal}}: Invalid |ref=harv (help)


Retrieved from "https://en.wikipedia.org/w/index.php?title=Lossy_Count_Algorithm&oldid=601526903"