E3D R-Tree：一种处理移动对象数据库历史查询的索引结构

历史查询是移动对象数据库管理的一个重要方面.为提高历史查询效率,在3D R-Tree基础上实现了优化的索引结构E3D R-Tree.在E3D R-Tree中,结合移动对象数据特征引入空白区域作为新的插入代价参数,同时,在插入算法中利用最小代价优先搜索算法确定全局最优插入路径,并给出算法正确性证明.实验结果表明,E3D R-Tree查询效率高于3D R-Tree.

E3D R-Tree: An Index Structure for Indexing the Histories in Moving Object Database

Efficient index of the histories is an important aspect in moving object database management. This paper im- plements an optimizing index structure called E3D R-Tree based on 3D R-Tree. E3D R-Tree takes into account the fea- tures of moving object data and took advantage of new cost parameters. In particular, least-cost-first search algorithm is used in the insertion algorithm to find the overall best way to insert a new record in E3D R-Tree. The proof of the vi- dility of the algorithm is given. The result of experiments illustrates that E3D R-Tree outperforms 3D R-Tree in query processes.