Vivek Sarkar

Topkapi: Parallel and Fast Sketches for Finding Top-K Frequent Elements

Identifying the top-K frequent items is one of the most common and important operations in large data processing systems. As a result, several solutions have been proposed to solve this problem approximately. In this paper, we identify that in modern distributed settings with both multi-node as well…