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

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

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

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.