%0 Journal Article
%T Spatial data service scheduling algorithm of P2P networks based on balance interest tree<br>基于平衡兴趣树的P2P空间数据服务调度
%A HOU Zhe-wei
%A WANG Qing-shan
%A DING Lin
%A REN Liu-cheng
%A <br>侯哲威
%A 王青山
%A 丁琳
%A 任留成
%J 计算机应用研究
%D 2009
%I 
%X The transport problem of vast spatial data through Internet must be solved in establishing spatial information grid (SIG). Designed the multilevel grid index of spatial data and a network model of spatial data service based on balance interest tree by analyzing the basic character of spatial data service and using P2P technology. According to the interesting region of peers, effectively organized the peers requested spatial data service by the algorithm, and transformed the routing relationship of peers to a new topology structure: dynamic balance interest tree. This algorithm can maintain the degree of heat of data grid in the heat table, and can find the location of data grid in the P2P network quickly by the heat table and download, so the pressure of spatial data service and improves the efficiency of service.
%K P2P(peer-to-peer)
%K distributed
%K balance interest tree
%K spatial data service
%K spatial information grid<br>对等网
%K 分布式
%K 平衡兴趣树
%K 空间数据服务
%K 空间信息网格
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=6F297A0FD5810B7B2046E9013DE207D6&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=9CF7A0430CBB2DFD&sid=6956BCE8D1DE819F&eid=E936E096A4AAE12A&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=13