摘要
为了更好地实现预测范围聚集查询,提出了aTPRA-tree。TPR-tree随着时间的推移,性能不断恶化。aTPRA-tree是基于TPR-tree,它考虑了移动对象的方向角度进行构造,减小了结点面积和结点重叠面积,并且在索引结点中增加了聚集信息。实验结果表明,在更新和预测范围聚集查询性能方面,aTPRA-tree性能优于TPR-tree。
In order to realize the predictive range aggregate queries better,this paper presents the aTPRA-tree.TPR-tree’s performance continues to deteriorate as the time goes.The aTPRA-tree,which is based on the TPR-tree and added with aggregate information in the index nodes,considers the angle of the velocity and reduces the area and overlap of the nodes.The experimental results show that aTPRA-tree’s update and query performance outperforms the TPR-tree.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第9期130-133,共4页
Computer Engineering and Applications
基金
浙江省自然科学基金(No.Y1080490)
宁波市自然科学基金(No.2010A610098)~~