Deterministic k-set structure

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 [24], data reconciliation in distributed systems [22] and mobile computing [28], etc. In this paper, we study the problem of obtaining deterministic algorithms for the k-set problem.

• Type: Conference
• Year: 2006
• Where: PODS
• Authors: Sumit Ganguly, Anirban Majumder
• Keywords: Bounded-space Data Structure, Database, Fundamental Problem, PODS 2006, Stream Insertion