Deterministic k-set structure

Authors:
Sumit Ganguly;Anirban Majumder
Affiliations:
IIT Kanpur, India;IIT Kanpur, India
Venue:
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2006

Citing 9
Cited 5

Epidemic algorithms for replicated database maintenance

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Scalable, Secure, and Highly Available Distributed File Access

Computer
Randomized algorithms

Randomized algorithms
Finding Frequent Items in Data Streams

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Efficient PDA Synchronization

IEEE Transactions on Mobile Computing
What's hot and what's not: tracking most frequent items dynamically

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data streams: algorithms and applications

Foundations and Trends® in Theoretical Computer Science
Counting distinct items over update streams

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Set reconciliation with nearly optimal communication complexity

IEEE Transactions on Information Theory

Finding Frequent Items in a Turnstile Data Stream

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Lower bounds on frequency estimation of data streams

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Sketching in Adversarial Environments

SIAM Journal on Computing
Space-efficient straggler identification in round-trip data streams via newton's identities and invertible bloom filters

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
CR-PRECIS: a deterministic summary structure for update data streams

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the stream, provided, the number of distinct items in the stream does not exceed k; and returns nil otherwise. This is a fundamental problem with applications in data streaming [14], data reconciliation in distributed systems [12] and mobile computing [16], etc. In this paper, we present a deterministic algorithm for the k-set problem that matches the space lower bound to within a logarithmic factor.