Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-69497-7_15 | SSDBM |
Keywords | Field | DocType |
frequent item,time-efficient algorithm,general update stream,frequent items,popular dyadic intervals method,general update streams,present novel space,novel adaptation | Data mining,Data stream,Computer science,Hash function,STREAMS,Database,Hash table | Conference |
Volume | ISSN | Citations |
5069 | 0302-9743 | 5 |
PageRank | References | Authors |
0.56 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sumit Ganguly | 1 | 813 | 236.01 |
| Abhayendra N. Singh | 2 | 5 | 0.56 |
| Satyam Shankar | 3 | 5 | 0.56 |