首页 | 官方网站   微博 | 高级检索  
     

移动对象数据库预测范围聚集查询技术研究
引用本文:吴秋云,廖巍,景宁,李军.移动对象数据库预测范围聚集查询技术研究[J].计算机科学,2007,34(1):84-87.
作者姓名:吴秋云  廖巍  景宁  李军
作者单位:国防科技大学电子科学与工程学院,长沙,410073
基金项目:国家重点基础研究发展计划(973计划)
摘    要:针对预测范围聚集查询处理技术,提出了一种面向移动对象的聚集TPR树索引。聚集TPR树索引在TPR树中间节点中加入移动对象聚集信息以减少预测范围聚集查询所需要的节点访问代价。并增加了一个建于移动对象标识上的哈希辅助索引结构以支持自底向上的删除搜索算法,具有很好的动态更新性能和并发性。提出了一种EPRA查询算法,采用更精确的剪枝搜索准则,大大减少了查询所需要访问的磁盘节点,具有良好的查询性能。

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

A Novel Prediction Technique for Range Aggregation of Moving Objects
WU Qiu-Yun,LIAO Wei,JING Ning,LI Jun.A Novel Prediction Technique for Range Aggregation of Moving Objects[J].Computer Science,2007,34(1):84-87.
Authors:WU Qiu-Yun  LIAO Wei  JING Ning  LI Jun
Affiliation:College of Electronic Science and Engineering , National University of Defense Technology, Changsha 410073
Abstract: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.
Keywords:Predictive range  Aggregate queries  TPR-tree  aTPR-tree  EPRA algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号