• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
高级检索

支持频繁更新的移动对象混合索引方法

廖 巍 熊 伟 景 宁 陈宏盛 钟志农

廖 巍 熊 伟 景 宁 陈宏盛 钟志农. 支持频繁更新的移动对象混合索引方法[J]. 计算机研究与发展, 2006, 43(5): 888-893.
引用本文: 廖 巍 熊 伟 景 宁 陈宏盛 钟志农. 支持频繁更新的移动对象混合索引方法[J]. 计算机研究与发展, 2006, 43(5): 888-893.
Liao Wei, Xiong Wei, Jing Ning, Chen Hongsheng, and Zhong Zhinong. Hybrid Indexing of Moving Objects with Frequent Updates[J]. Journal of Computer Research and Development, 2006, 43(5): 888-893.
Citation: Liao Wei, Xiong Wei, Jing Ning, Chen Hongsheng, and Zhong Zhinong. Hybrid Indexing of Moving Objects with Frequent Updates[J]. Journal of Computer Research and Development, 2006, 43(5): 888-893.

支持频繁更新的移动对象混合索引方法

Hybrid Indexing of Moving Objects with Frequent Updates

  • 摘要: TPR-tree是目前广泛使用的移动对象当前及未来位置索引技术,但是其频繁更新性能低下.通过在TPR-tree上增加一个指向索引树中间节点的直接访问表(direct-access table)内存结构和建于叶节点之上的Hash辅助索引结构,提出了一种支持频繁更新的移动对象混合索引HTPR-tree,并提出了基于HTPR-tree的扩展自底向上(EBUU)更新算法.性能分析和实验表明,采用EBUU算法的HTPR-tree动态更新性能大大高于TPR\+*-tree等索引,而查询性能仅仅稍逊.
    Abstract: TPR-tree is the most popular indexing method for the current and future position of moving objects,but its frequent updates performance is very low. HTPR-tree, which is based on TPR-tree, supplemented by a hash index on leaf nodes and a memory-based direct-access table pointing to internal nodes of TPR-tree is presented for moving objects with frequent updates. Also an extended bottom-up update algorithm is developed for HTPR-tree. Performance analysis and experimental results show that the HTPR-tree update performance outperforms any other indexing method including TPR\+*-tree at the cost of slight query performance degrade.
计量
  • 文章访问数:  704
  • HTML全文浏览量:  0
  • PDF下载量:  584
  • 被引次数: 0
出版历程
  • 发布日期:  2006-05-14

目录

    /

    返回文章
    返回