摘要
在TPR-tree上增加一个基于内存的更新日志,实现一种支持频繁更新的移动对象索引ULTPR-tree,采用分组更新方法对移动对象记录进行批量删除,从而减少ULTPR-tree索引结构的删除维护代价。理论分析和实验结果表明,ULTPR-tree的动态更新性能优于TPR-tree和HTPR-tree。
This paper realizes a ULTPR-tree for moving objects with frequent updates, which is based on TPR-tree by adding a memory-based Update Log(UL). It uses grouping method to delete the records of moving objects in bulk, which decreases the cost of deletion maintenance of ULTPR-tree. Theoretical analysis and experimental results show that the update performance of ULTPR-tree outperforms TPR-tree and HTPR-tree.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第3期72-74,共3页
Computer Engineering
基金
国家火炬计划基金资助项目(2008GH540088)
关键词
移动对象
更新日志
索引机制
moving object
Update Log(UL)
index mechanism