移动对象数据库预测范围聚集查询技术研究  

A Novel Prediction Technique for Range Aggregation of Moving Objects

作　　者：吴秋云[1] 廖巍[1] 景宁[1] 李军[1] 

机构地区：[1]国防科技大学电子科学与工程学院,长沙410073

出　　处：《计算机科学》2007年第1期84-87,共4页Computer Science

基　　金：国家高技术研究发展计划863资助;项目编号:2003A5110

摘　　要：针对预测范围聚集查询处理技术,提出了一种面向移动对象的聚集TPR树索引。聚集TPR树索引在TPR树中间节点中加入移动对象聚集信息以减少预测范围聚集查询所需要的节点访问代价。并增加了一个建于移动对象标识上的哈希辅助索引结构以支持自底向上的删除搜索算法,具有很好的动态更新性能和并发性。提出了一种EPRA查询算法,采用更精确的剪枝搜索准则,大大减少了查询所需要访问的磁盘节点,具有良好的查询性能。To efficiently process predictive range aggregate （pRA）queries, this paper presents a novel aggregate TPR- tree （aTPR-tree）for range aggregation of moving objects, aTPR-tree is based on TPR-tree structure and added with aggregate information in intermediate nodes to reduce the disk accesses of PRA queries, aTPR-tree is supplemented by a hash. index on identifier of moving objects, and uses bottom-up delete algorithm, thus having a good update performance and concurrency. Also an Enhanced predictive range aggregate （EPRA）query algorithm which uses a more precise branch and bound searching strategy is developed, thus reducing the disk I/O greatly and having a good performance.

关 键 词：预测范围 聚集查询 TPR-树 aTPR-树 EPRA算法 

分 类 号：TP392[自动化与计算机技术—计算机应用技术]