| Abstract: | It proposed a new method for dynamically determining the frequent items at any time in a relation which is undergoing deletion operations as well as inserts. Our methods maintain small space data structures that monitor the transactions on the relation, and, when required, quickly output all frequent items without rescanning the relation in the database. With user-specified probability, all frequent items are correctly reported. The methods rely on ideas from “group testing.” They are simple to implement, and have provable quality, space, and time guarantees. Previously known algorithms for this problem that make similar quality and performance guarantees cannot handle deletions, and those that handle deletions cannot make similar guarantees without rescanning the database. Our experiments with real and synthetic data show that our algorithms are accurate in dynamically tracking the frequent items independent of the rate of insertions and deletion.
|