Finding Frequent Items over General Update Streams

Abstract. We present novel space and time-efficient algorithms for finding frequent items over general update streams. Our algorithms are based on a novel adaptation of the popular dyadic intervals method for finding frequent items. The algorithms improve upon existing algorithms in both theory and practice.

• Type: Conference
• Year: 2008
• Where: SSDBM
• Authors: Sumit Ganguly, Abhayendra N. Singh, Satyam Shankar
• Keywords: Algorithms, Database, Frequent Items, SSDBM 2008, Time-efficient Algorithms