ATPR-Tree:带有属性维的时空索引  

ATPR-Tree: Spatio-temporal index withattributedimension

作　　者：王永会[1] 张恩瑞[1] WANG Yonghui;ZHANG Enrui(School of Information and Control Engineering, Shenyang Jianzhu University, Shenyang 110168, China)

机构地区：[1]沈阳建筑大学信息与控制工程学院,沈阳110168

出　　处：《计算机工程与应用》2017年第7期79-87,共9页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61070024)

摘　　要：城市计算领域里所处理的移动对象往往带有除时间、空间信息外更多的信息,而目前的移动对象索引大多只有时间、空间这两个维度,不能有效地对附带更多信息的移动对象进行管理。基于这一问题,提出了一种带有属性维度的时空索引ATPR-tree,这种索引由TPR-tree改进而来。在TPR-tree节点CBR的基础之上新加入了属性值区间(RI)的概念;根据加入的RI属性维改变了TPR-tree的节点结构和代价目标函数;根据新的代价目标函数对插入、删除以及查询算法做出相应的改变。实验中所处理的移动对象是使用GSTD随机生成的,实验把附加属性作为索引一个维度的ATPR-tree和不作为索引的一个维度的TPR-tree进行比较。实验结果表明,对于带有属性值条件的查询,把属性值作为一个维度的ATPR-tree索引可以有效地减少节点访问次数,提高查询的效率。The moving objects in the field of urban computing tend to have more information except spatial and temporalinformation.And the current spatio-temporal index mostly only has the spatial and temporal dimension,and thetwo dimensions cannot manage the moving objects with more information effectively.Based on this problem,this paperproposes the ATPR-tree,a spatio-temporal index with attribute value,the index is transformed from the TPR-tree.In thefirst part,based on the CBR in the node of TPR-tree,it introduces the concept of Rating Interval(RI).Then on the basis ofRI,it changes the TPR-tree node structure and cost function.Finally,the insertion and deletion algorithms make changescorrespondingly.In the experiments,the moving objects are randomly generated by GSTD,and it compares the ATPR-treewhich takes attribute as one dimension of the index with another TPR-tree which not do so.The experimental results showthat,for the queries with attribute value,the ATPR-tree which takes attribute as one dimension of the index can effectivelyreduce the number of node access and improve the efficiency of query.

关 键 词：时空索引 城市计算 属性值 移动对象 

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