Deterministic K-set structure

Authors:
Sumit Ganguly;Anirban Majumder
Affiliations:
IIT Kanpur, India;IIT Kanpur, India
Venue:
Information Processing Letters
Year:
2008

Citing 15
Cited 0

The space complexity of approximating the frequency moments

Journal of Computer and System Sciences
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
An improved data stream summary: the count-min sketch and its applications

Journal of Algorithms
Data streams: algorithms and applications

Foundations and Trends® in Theoretical Computer Science
Explicit constructions for compressed sensing of sparse signals

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Generalized framework for selectors with applications in optimal group testing

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Combinatorial algorithms for compressed sensing

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Counting distinct items over update streams

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Almost optimal explicit selectors

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Set reconciliation with nearly optimal communication complexity

IEEE Transactions on Information Theory
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

IEEE Transactions on Information Theory
Compressed sensing

IEEE Transactions on Information Theory
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.89

Visualization

Abstract

A k-set structure is a sub-linear space data structure that supports multi-set insertion and deletion operations and returns the multi-set, provided the number of distinct items with non-zero frequency does not exceed k. This is a fundamental problem with applications in data streaming [S. Muthukrishnan, Data streams: Algorithms and applications, Foundations and Trends in Theoretical Computer Science 1 (2) (2005)], distributed systems [Y. Minsky, A. Trachtenberg, R. Zippel, Set Reconciliation with Nearly Optimal Communication Complexity, IEEE Trans. Inform. Theory 49 (9) (2003) 2213-2218; D. Starobinski, A. Trachtenberg, S. Agarwal, Efficient PDA synchronization, IEEE Trans. on Mob. Comp. 2 (1) (2003) 40-51], etc. In this paper, we present the design of a deterministic k-set structure.