Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

SSDBM
2008
IEEE

favoriteEmaildiscussreport

95views Database» more SSDBM 2008»

Finding Frequent Items over General Update Streams

13 years 11 months ago

Finding Frequent Items over General Update Streams

Download www.cse.iitk.ac.in

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

Sumit Ganguly, Abhayendra N. Singh, Satyam Shankar

Real-time Traffic

Algorithms | Database | Frequent Items | SSDBM 2008 | Time-eﬃcient Algorithms |

claim paper

Related Content

» A simpler and more efficient deterministic scheme for finding frequent items over sliding ...

» Finding frequent items over sliding windows with constant update time

» Finding Recently Frequent Items in Distributed Data Streams

» CRprecis A Deterministic Summary Structure for Update Data Streams

» Mining frequent items in a stream using flexible windows

» Mining topk frequent items in a data stream with flexible sliding windows

» Finding recent frequent itemsets adaptively over online data streams

» Finding global icebergs over distributed data sets

» Maintaining frequent closed itemsets over a sliding window

Post Info
More Details (n/a)

Added	01 Jun 2010
Updated	01 Jun 2010
Type	Conference
Year	2008
Where	SSDBM
Authors	Sumit Ganguly, Abhayendra N. Singh, Satyam Shankar

Comments (0)