Finding Frequent Items in Data Streams Using ESBF
- 26 November 2007
- book chapter
- Published by Springer Nature
- p. 244-255
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Dynamic count filtersACM SIGMOD Record, 2006
- Dynamically maintaining frequent items over a data stream2003
- New directions in traffic measurement and accountingACM Transactions on Computer Systems, 2003
- Spectral bloom filters2003
- A simple algorithm for finding frequent elements in streams and bagsACM Transactions on Database Systems, 2003
- Frequency Estimation of Internet Packet Streams with Limited Space2002
- Finding Frequent Items in Data Streams2002
- Querying and mining data streams2002
- Approximate Frequency Counts over Data Streams2002
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970