Abstract
To study the algorithms for discovering the frequent items of distributed data streams, a novel algorithm was applied to find the synopsis structures from leaf nodes to root node by Distributed Synopsis Algorithm (DSA), and minimize the communicated loads through the relevant diagrent under different conditions. The experiment verifies the efficiency of the algorithm and structure by real data sets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have