Finding hierarchical heavy hitters in streaming data

doi:10.1145/1324172.1324174

Finding hierarchical heavy hitters in streaming data

Full Text:

PDF

Buy this Article

Authors:	Graham Cormode	AT&T Labs--Research, Florham Park, NJ
	Flip Korn	AT&T Labs--Research, Florham Park, NJ
	S. Muthukrishnan	Rutgers University, Piscataway, NJ
	Divesh Srivastava	AT&T Labs--Research, Florham Park, NJ

	2008 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 12 · Downloads (12 Months): 74 · Downloads (cumulative): 899 · Citation Count: 8

Published in:

	· Journal
	ACM Transactions on Knowledge Discovery from Data (TKDD) TKDD Homepage archive
	Volume 1 Issue 4, January 2008 Article No. 2 ACM New York, NY, USA table of contents doi>10.1145/1324172.1324174

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms approximation algorithms data mining data mining experimentation network data analysis performance theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder