战场环境中面向范围查询的分布式时空索引  

Distributed spatio-temporal indexing for range query in battlefield

作　　者：张翀[1] 肖卫东[1] 杨晓亮[1] 汤大权[1] 唐九阳[1] 

机构地区：[1]国防科技大学C4ISR技术国防科技重点实验室,长沙410073

出　　处：《计算机工程与应用》2011年第11期118-122,共5页Computer Engineering and Applications

基　　金：国家自然科学基金No.60172012~~

摘　　要：对战场中时空信息进行合理组织可以高效完成时空查询,从而快速支持军事决策和行动的顺利完成。针对战场环境中时空数据的分布独立性,各节点的自治性、动态性及协作性,提出了时空索引结构P2PSTI,该索引基于DHT技术组织节点的拓扑结构,采用Hilbert曲线将时空对象映射到1维空间,并利用该曲线的局部保持特性设计了高效的查询算法,大大降低了路由消息数量,提高了时空查询性能。实验结果表明,P2PSTI查询性能好,索引维护代价低。High efficiency in answering Spatio-Temporal（ST） query can be achieved if ST information is organized in battlefield reasonably,which will assist military decisions and operations fast and successfully.To the question of the distribution independency of ST data,this paper proposes a distributed ST indexing structure called P2PSTI,which indexes historical information constructs overlay topology using DHT,where ST objects are mapped into 1-dimension using Hilbert curve.Thus,localitypreserved characteristic of Hilbert curve is sufficiently utilized to devise a high efficient query algorithm,which greatly reduces routing messages so that query performance is enhanced.Experimental results reveal that P2PSTI outperforms other related algorithms in query,and exhibits a low index maintaining cost.

关 键 词：战场 对等计算 分布式 HILBERT曲线 时空索引 

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