Finding Hierarchical Heavy Hitters in Data Streams
- 1 January 2003
- book chapter
- simple chapter
- Published by Elsevier BV
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A simple algorithm for finding frequent elements in streams and bagsACM Transactions on Database Systems, 2003
- Controlling high bandwidth aggregates in the networkACM SIGCOMM Computer Communication Review, 2002
- Selection and sorting with limited storageTheoretical Computer Science, 1980