摘要
以提高移动对象数据库中交通道路上的移动对象位置查询效率为目标,通过借鉴FNR-tree的思想并加以改进和综合运用hash表、动态数组、B树、单循环链表,设计了一种新的基于交通路网的移动对象索引结构(Dynamic and Efficient Index,DEI),并给出了操作算法。DEI索引结构由道路hash部分、时间信息结构和移动对象hash结构3部分组成。DEI支持对移动对象的过去、现在和将来位置的有效查询,可实现移动对象的快速定位。仿真实验结果验证了DEI的性能优势。
In order to improve the efficiency of querying the object location on traffic road,referencing the idea of FNR-tree and improving it,this paper designs a new index structure DEI（Dynamic and Efficient Index） for moving objects on road network,which uses the technologies such as hash tables,dynamic arrays,B-tree,the single round-robin list.The manipulation algorithms of it are also designed.DEI has three partitions：hash partition of roads,structure of tine information and the hash structure of moving object.DEI supports the queries like searching for the history,present and future location of moving objects.It can quickly find the Location of moving object.The performance of the DEI has been proved by the experimental results.
出处
《南京邮电大学学报（自然科学版）》
2010年第6期89-95,共7页
Journal of Nanjing University of Posts and Telecommunications：Natural Science Edition
基金
国家重点基础研究发展计划(973计划)项目(2011CB302903)
国家自然科学基金(60863001)
南京邮电大学引进人才科研启动基金(NY207136)资助项目
