Approximate frequency counts over data streams Export

@misc{citeulike:484596, abstract = {We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. Although the output is approximate, the error is guaranteed not to exceed a user-specified parameter. Our algorithms can easily be deployed for streams of singleton items like those found in IP network monitoring.}, author = {Manku, G. S. and Motwani, R.}, citeulike-article-id = {484596}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.2185}, keywords = {approximate, data-streams, lossy-counting, yrbcn}, posted-at = {2008-05-22 14:56:41}, priority = {2}, title = {Approximate frequency counts over data streams}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.2185}, year = {2002} }

TY - GEN ID - citeulike:484596 L3 - citeulike-article-id:484596 N2 - We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. Although the output is approximate, the error is guaranteed not to exceed a user-specified parameter. Our algorithms can easily be deployed for streams of singleton items like those found in IP network monitoring. TI - Approximate frequency counts over data streams KW - approximate KW - data-streams KW - lossy-counting KW - yrbcn AU - Manku, GS AU - Motwani, R PY - 2002/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.2185 ER -