期刊文献+

Chord网络中的Skyline计算

Skyline Computation on Chord Network
下载PDF
导出
摘要 针对Skyline计算中,需要处理的数据量大,处理时间较长的问题,引入P2P网络,将数据计算的压力分摊至各网络节点.预处理中,合理采用数据映射方式,增加同一节点数据间的决定能力,减少本地计算量.在全局Skyline计算时,通过网络点对点传输,将各节点需计算数据量减少至最小.实验结果和理论分析表明,新算法可将Chord网络中,本地节点需要计算的数据量减至10%左右,当数据量较大,数据各维度间没有相关性,且网络传输较为正常时,算法具有明显优势. For Skyline computation needs long time to deal with large amount of data,this paper use the P2P network, to allocate calcu- lation pressure to each node in the network. In the preprocessing, the proper data mapping method is adopted to increase the decision a- bility between data in the same node, and significantly reduce the amount of local computation. In the computation of global Skyline points,by peer-to-peer transmission in the network, new algorithm can minimize dataset of every node. Experimental results and theo- retical analysis shows,the new algorithm can down the amount of data in local node to 10%. When the dataset is very large,data's each dimension isn't relative with others', and net transmission is normal, the algorithm has obvious advantages.
出处 《小型微型计算机系统》 CSCD 北大核心 2017年第1期77-82,共6页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61073037)资助
关键词 SKYLINE计算 SKYLINE CHORD网络 网络节点 skyline computation key points of Skyline chord ring network network node
  • 相关文献

参考文献7

二级参考文献153

  • 1刘欣,余靖,刘国华.基于窗口查询的轮廓查询算法[J].燕山大学学报,2005,29(5):398-402. 被引量:9
  • 2周文莉,吴晓非.P2P技术综述[J].计算机工程与设计,2006,27(1):76-79. 被引量:111
  • 3刘亚杰,窦文华.一种P2P环境下的VoD流媒体服务体系[J].软件学报,2006,17(4):876-884. 被引量:29
  • 4常俊胜,王怀民,尹刚.DyTrust:一种P2P系统中基于时间帧的动态信任模型[J].计算机学报,2006,29(8):1301-1307. 被引量:101
  • 5邱彤庆,陈贵海.一种令P2P覆盖网络拓扑相关的通用方法[J].软件学报,2007,18(2):381-390. 被引量:41
  • 6MARUOKA M, NEMATI A G, BAROLLI V,et al. Making societies in peer-to-peer overlay networks [ C ]//Proc of International Conference on Complex, Intelligent and Software Intensive Systems. Washington DC :IEEE Computer Society, 2008:215-220.
  • 7LIU Yun-hao, LIU Xiao-mei, XIAO Li, et al. Location-aware topolgy matching in P2P systems[ J]. IEEE Trans on Parallel and Distributed Systems, 2005,16 ( 2 ) : 163-174.
  • 8WU Yi-chun,LIU Chuan-ming,WANG J H. Enhancing the performance of locating data in chord-based P2P systems [ C ]//Proc of the 14th IEEE International Conference on Parallel and Distributed Systems. 2008:841-846.
  • 9MAHAJAN R, CASTRO M, ROWSTRON A. Controlling the cost of reliability in peer-to-peer overlays[ C]//Proc of the 2nd International Workshop on Peer-to-Peer Systems. 2003:21-32.
  • 10JIANG Song, GUO Lei, ZHANG Xiao-dong,et al. LightFlood: minimizing redundant messages and maximizing the scope of peer-to-peer search[J]. IEEE Trans on Parallel and Distributed Systems, 2008,19(5) :601-614.

共引文献52

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部