基于P2P的空间查询路由算法综述  

A Survey of P2P-Based Spatial Query Routing Algorithms

作　　者：赵晓晖[1] 方裕[1] 陈斌[1] 

机构地区：[1]北京大学遥感与地理信息系统研究所,北京100871

出　　处：《地理与地理信息科学》2009年第2期1-4,9,共5页Geography and Geo-Information Science

基　　金：国家自然科学基金项目(40501052);中国高技术研究与发展计划(2006AA12Z201)

摘　　要：介绍对等网络的历史与典型模式,给出路由的基础概念。列举基于P2P的查询路由经典算法(Chord、CAN、Pastry等)和相关改进算法(Kademlia、Emergint、SmartBoa等)。结合空间数据的特点,综述基于P2P的空间查询路由算法,如共享兴趣点算法、基于Chord构造内容访问、超级对象、位置复制和几何距离模式的算法,以及空间划分格网、依维度优先级的查询算法和服务封装算法。良好的空间路由算法能够提高网络的性能和执行效率,推动空间信息领域的发展。With the wide use of spatial data,the routing problems play an important role in spatial P2P information field.The history and representative patterns of Peer-to-Peer networks was introduced in this paper.The basic concepts of routing were given.Some P2P-based query routing classical algorithms（Chord,CAN,Pastry,etc.） and the relative improved algorithms（Kademlia,Emergint,SmartBoa,etc.） were enumerated.Considering the characteristics of spatial data,the P2P-based spatial query routing algorithms were summarized such as the interests-sharing algorithm,and the Chord-based algorithms that have four typical patterns： content-accessing,super objects,location replication and geometrical distance,and dimension priority algorithm in the spatial grids,and service encapsulation algorithm.Through these spatial routing methods,the nicer spatial routing methods can improve the performance of system and efficiency,and also can speed up the development of spatial information field.

关 键 词：空间查询路由 对等网络 地理信息系统 

分 类 号：P208[天文地球—地图制图学与地理信息工程]