摘要
针对FNR+-Tree模型2D R-Tree叶子节点项过多、存在大量插入操作等缺点,提出改进模型FNR*-Tree。根据移动对象的多少将区域划分为城市和郊区,在此基础上分别给出索引城市和郊区中移动对象过去、现在和未来位置的模型。分析结果表明,该模型具有较高的查询效率和查询精度。
Aiming at many disadvantages of the FNR＋-Tree model including excessive leaf node entries and a large number of insert operations, this paper proposes an improved model named FNR＋-Tree. According to the number of moving objects, the district can be divided into urban and suburban areas, and on this basis, this paper proposes a method separately, which can index the object moving in urban and suburban areas and a new approach in. Analysis results show that the model has good query efficiency and query accuracy.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第3期67-69,共3页
Computer Engineering
关键词
移动对象
索引方法
交通网络
moving objects
index approach
fixed network
