Shu Yun Wang

Learn More
This paper introduces the algorithm FIS-EBF for estimating the frequent items in sliding windows over data streams. FIS-EBF is Based the data structure named EBF (extensible bloom filter). Experiments show that FIS-EBF can work with high precision and recall, it is also showed that FIS-EBF is very efficient in terms of processing time.
  • 1