%0 Journal Article
%T Study on discovering frequent items algorithm for distributed data stream<br>分布式流数据频繁项发现算法的研究
%A YANG Ying
%A YANG Lei
%A <br>杨颖
%A 杨磊
%J 计算机应用
%D 2008
%I 
%X 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.
%K 流数据
%K 频繁项
%K 概要结构
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=9D24CC078EE65475AC59B080A6EBAC4F&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=CA4FD0336C81A37A&sid=58F693790F887B3B&eid=12DC19455C3A2FA8&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=6