摘要
当前对移动对象位置预测查询的研究中,索引结构是查询性能优良的关键。针对现有方法中存在的缺陷,本文提出R-tree索引方法。R树算法能有效的索引移动对象的现在与预测的将来位置。R树算法考虑移动对象的速度与方向来预测移动对象在不久将来的大致位置。实验结果表明,采用R-tree索引结构具有最优的查询和更新性能。
In the research of the prediction location query of the moving objects, the design of index structure is the key to performance. According to defects of the existing index methods, R-tree index method is proposed in this paper. R-tree algorithm can effectively index space moving object and predict the future positions. R-tree algorithm predicts the moving objects location through the speed and direction of object mobile bound. The experimental results show that R-tree index structure have a optimal search and performance.
出处
《科技视界》
2012年第14期19-22,共4页
Science & Technology Vision
基金
浙江省自然科学基金Y12F020080
浙江省重大科技专项2011C11046
关键词
R树
移动对象
位置预测
R-tree
Move objects
Location prediction