Counting distinct items over update streams

Authors:
Sumit Ganguly
Affiliations:
Indian Institute of Technology, Kanpur
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 10
Cited 6

Probabilistic counting algorithms for data base applications

Journal of Computer and System Sciences
The space complexity of approximating the frequency moments

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Min-wise independent permutations (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The space complexity of approximating the frequency moments

Journal of Computer and System Sciences
Min-wise independent permutations

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Estimating simple functions on the union of data streams

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Distributed streams algorithms for sliding windows

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports

Proceedings of the 27th International Conference on Very Large Data Bases
Counting Distinct Elements in a Data Stream

RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Processing set expressions over continuous update streams

Proceedings of the 2003 ACM SIGMOD international conference on Management of data

Deterministic k-set structure

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A simple and efficient estimation method for stream expression cardinalities

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Estimating Hybrid Frequency Moments of Data Streams

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Finding Frequent Items in a Turnstile Data Stream

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Deterministic K-set structure

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two novel algorithms for tracking the number of distinct items over high speed data streams consisting of insertion and deletion operations that improves on the space and time complexity of existing algorithms.