期刊文献+

TPR^*树索引构建及其动态维护方法 被引量:1

Method for Index-building and Dynamic Maintenance of TPR*-tree
下载PDF
导出
摘要 提出一种新的TPR*树索引构建方法,在根节点层利用速度矢量对移动对象集进行划分,根据速度矢量的大小将移动对象聚集到不同子节点中,并逐层构建TPR*树。在根节点层用溢出桶存储插入的移动对象记录,同时对TPR*树索引进行批量插入更新,以减少其插入更新维护的代价。实验结果表明,该方法是可行的。 A novel method for index-building of TPR^*-tree is proposed, which splits the moving object set at root node level by using velocity vector. According to the value of velocity vector, the moving objects are clustered into different sub-nodes, which then constructs the TPR^*-tree. The records of moving objects are stored by using overflow bucket at root node level, and the index of TPR^*-tree is inserted and updated with a batch, which decreases the cost of insertion maintenance. Experimental results show this method is feasible.
出处 《计算机工程》 CAS CSCD 北大核心 2009年第4期23-24,27,共3页 Computer Engineering
基金 国家“863”计划基金资助项目(2007AA12Z208)
关键词 TPR*树 构建算法 溢出桶 插入延迟更新 TPR^*-tree construction algorithm overflow bucket insertion delay update
  • 相关文献

参考文献6

  • 1Mohamed F, Mokbel T M. Spatio-temporal Access Methods[J].IEEE Data Engineering Bulletin, 2003, 26(2): 40-49.
  • 2Simonas S, Christian S. Indexing the Positions of Continuously Moving Objects[C]//Proe. of the SIGMOD. Dallas, Texas, USA: [s. n.], 2000.
  • 3Papadias D. The TPR*-tree: An Optimized Spatio-temporal Access Method for Predictive Queries[C]//Proc. of the VLDB. Berlin, Germany: [s. n.], 2003.
  • 4Mohamed F. LUGrid: Update-tolerant Grid-based Indexing for Moving Objects[C]//Proc. of the MDM. Nara, Japan: [s. n.], 2006.
  • 5Lin Bin, Su Jianwen. On Bulk Loading TPR-tree[C]//Proc. of the MDM. Berkeley, California, USA: [s. n.], 2004.
  • 6Brinkhoff T. A Framework for Generating Network-based Moving Objects [J]. Geolnformatica, 2002, 6(2): 153-180.

同被引文献6

  • 1廖巍,熊伟,景宁,陈宏盛,钟志农.支持频繁更新的移动对象混合索引方法[J].计算机研究与发展,2006,43(5):888-893. 被引量:10
  • 2Saltenis S.Jensen C S,Leutenegger S L,et al.Indexing the Positions of Continuously Moving Objects[C]//Proc.of the 2000 ACM SIGMOD International Conferenc-on Management of Data.Dallas,USA:ACM Press,2000.
  • 3Lee Mong-Li,Hsu、W,Jensen C S,et al.Supporting Frequent Updates in R-trees:A Bottom-up Approach[C]//Proc.of the 29th VLDB Conference.Berlin,Germany:[s.n.],2003:608-619.
  • 4Xiong Xiaopeng,Aref W G R-trees with Update Memos[C]//Proc.of the 22nd International Conference on Data Engineering.Atlanta,Georgia,USA:[s.n.],2006.
  • 5Biveinis L,Saltenis S.Towards Efficient Main-memory Use for Optimum Tree Index Update[C]//Proc.of PVLDB'08.Auckland,New Zealand:[s.n.],2008.
  • 6杨旭,余建桥,任廷艳.改进的移动对象索引机制[J].计算机工程,2010,36(4):50-52. 被引量:1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部