摘要
针对空间数据访问的局部性和位置相关性,在Chord协议的基础上进行扩展,提出了一种基于P2P的分布式空间数据存储方法。该方法对存储节点进行分组,并可根据节点的负载状态对分组进行动态调整,以保持系统的负载均衡。理论分析及仿真实验都显示该方法在执行空间范围查询操作时较Chord协议具有更高的效率。
Concerning the locality characteristic and positional correlation of spatial data accessing, a peer-to-peer (P2P) -based method for distributed spatial data storage was proposed, which extended Chord. The concept of grouping nodes was introduced. The size of group could be adjusted according to the load of nodes by exploiting it, so the load balancing properties of the system were retained. Both the theoretic analysis and the simulation experiments show that it has higher eflqciency in spatial range query than Chord.
出处
《计算机应用》
CSCD
北大核心
2007年第3期528-530,共3页
journal of Computer Applications
基金
武汉大学优秀博士学位论文培育基金
关键词
P2P
节点分组
负载均衡
分布式空间数据存储
peer-to-peer (P2P)
node group
load balance
distributed spatial data storage