一种高效的分布式序敏感轮廓查询处理算法  

Efficient algorithm for distributed rank-aware skyline query processing

作　　者：王刚[1] 邓波[1] 曾玮琳[1] 

机构地区：[1]中国人民解放军73141部队

出　　处：《计算机工程与应用》2008年第26期162-165,共4页Computer Engineering and Applications

摘　　要：提出了一种新颖的分布环境中的序敏感轮廓查询算法(即找出不被别的对象所"支配"的且聚集值较高的对象)。现有的算法在节点数m较大时会消耗大量的网络带宽。提出了一种新的分布式序敏感轮廓查询处理算法(Distributed Rank-aware Skylining,DRS)。DRS算法在任意数据集上只需要4次交互就能完成,并且通过剪除不必要的对象来减少通讯代价。通过模拟数据验证了DRS算法的效率。实验表明,当节点数m大于4时,DRS算法性能优于现有算法的性能。This paper presents a novel algorithm to answer skyline queries（e.g.＂find the objects which are not ＂dominated＂ by other objects＂ and having higher aggregation value） in distributed environments.Existing algorithms consume an excessive amount of bandwidth when the number of nodes,m,is high.A novel algorithm is proposed called Distributed Rank-aware Skylining（DRS）.DRS terminates in four round-trips regardless of data input,and reduces communication cost by pruning away ineligible objects.The effectiveness of DRS is verified empirically using synthetic data sets.The experiments results show that FDSL is superior to the existing alternatives in the terms of the network traffic when the number of nodes is greater than 4.

关 键 词：分布式序敏感轮廓 分布式 序敏感 轮廓查询 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]