支持固定网络中频繁更新的移动对象混合索引模型  

Hybrid Indexing of Moving Objects with Frequent Updates on Fixed Networks

作　　者：方颖[1] 曹加恒[1] 黄敏[1] 曾承[2] 

机构地区：[1]武汉大学计算机学院,湖北武汉430072 [2]武汉大学软件工程国家重点实验室,湖北武汉430072

出　　处：《小型微型计算机系统》2009年第1期50-53,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60573095)资助

摘　　要：IMOFN是一种支持固定网络中频繁更新的移动对象混合索引模型,它由一棵描述固定道路网络的2D R*-Tree、一组对时间进行索引的1D R*-Tree和一个存储移动对象实时数据的Hash数组组成.IMOFN既管理了移动对象实时位置,支持位置的频繁更新;又保存了历史轨迹,提供了范围查询、拓扑查询以及轨迹查询等多种有效的实时和历史查询功能.通过实验与FNR-Tree和MON-Tree进行性能比较,证实了IMOFN模型高效的查询能力.In this paper, a novel indexing model named Indexing Moving Objects on Fixed Network （IMOFN） is proposed. IMOFN is a hybrid indexing structure which consists of a 2D R ^＊ -tree built on road sectors for managing the fixed networks, a forest of 1D R^＊ -tree indexing the time interval for the past position of moving object, and a hash structure describing the current state of moving objects. IMOFN not only provides a fast real-time update mechanism, but also supports range query, topological query and trajectory query related to the past and current positions of moving objects. The performance study, comparing this access method with FNR-Tree and MON-Tree under various queries, shows that IMOFN outperforms them in most eases.

关 键 词：移动对象 固定网络 索引模型 IMOFN 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]