作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (11): 76-78,8. doi: 10.3969/j.issn.1000-3428.2007.11.028

• 软件技术与数据库 • 上一篇    下一篇

TPR+-tree:一种面向预言查询的有效时空索引

张 驭,岳丽华,金培权   

  1. (中国科学技术大学计算机科学技术系,合肥 230026)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-06-05 发布日期:2007-06-05

TPR+-tree: An Efficient Spatial-temporal Index for Predictive Window Query

ZHANG Yu, YUE Lihua, JIN Peiquan   

  1. (Department of Computer Science & Technology, University of Science &Technology of China, Hefei 230026)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-05 Published:2007-06-05

摘要: 提出了一种面向预言查询的时空索引技术:TPR+-tree,给出了TPR+-tree的数据结构和关键算法,并引入了双极值子结点的概念,通过对双极值子结点进行检测和排除,减小了结点面积,改善了结点间的重叠。试验结果表明,TPR+-tree具有更高的查询性能,是一种有效的面向预言查询的时空索引。

关键词: 时空索引, 预言窗口查询, 双极值子结点

Abstract: This paper proposes a spatial-temporal indexing technique named TPR+-tree that supports the predictive window query, presents the data structure and the key algorithms and introduces the concept of double-extremum childnode. TPR+-tree reduces the area and overlap of nodes by checking and eliminating the double-extremum childnodes. The experimental results indicate that TPR+-tree promotes the query performance. It is an efficient spatial-temporal index for predictive window query.

Key words: Spatial-temporal index, Predictive window query, Double-extremum childnode

中图分类号: