Approximate counting: a detailed analysis
BIT - Ellis Horwood series in artificial intelligence
Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Counting large numbers of events in small registers
Communications of the ACM
Counting Distinct Elements in a Data Stream
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Frequency Estimation of Internet Packet Streams with Limited Space
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A simple algorithm for finding frequent elements in streams and bags
ACM Transactions on Database Systems (TODS)
External memory data structures
Handbook of massive data sets
Sketch-based change detection: methods, evaluation, and applications
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
MapReduce: simplified data processing on large clusters
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Distinct-value synopses for multiset operations
Communications of the ACM - A View of Parallel Computing
ACM Transactions on Algorithms (TALG)
SIAM Journal on Computing
Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
Foundations and Trends in Databases
Pseudorandomness
Hi-index | 0.00 |
The rate at which electronic information is generated in the world is exploding. In this article we explore techniques known as sketching and streaming for processing massive data both quickly and memory-efficiently.