基于时空连续性的运动对象最近邻居查询  

Moving Objects’ NN Queries Based on Spatio-Temporal Continuity

作　　者：潘鹏[1] 卢炎生[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《计算机工程与科学》2006年第10期74-77,共4页Computer Engineering & Science

基　　金：湖北省自然科学基金资助项目(ABA048)

摘　　要：时空数据库中的运动对象最近邻居查询是NNQueries中的新问题,基于TPR-TREE索引结构的TPNNQueries算法能较好地处理对象的时态特性,但会多次查询同一对象。本文利用运动对象的时空连续性对TPNNQueries算法进行改进,通过一次查询TPR-TREE索引获取所有候选NN对象与查询对象的距离变化曲线,进而得到NN对象集,减少了查询及时空运算的次数。本文最后给出了实验分析。In spatio-temporal databases, the moving objects＂ nearest neighbor query is a new problem ot nearest neighbor queries（NN Queries）. The current Tp NN Queries method which is based on the index structure of TPR-TREE can deal with moving objects, but it has the shortcomings of repeatedly querying some moving objects. Based on the theory of moving objects＇ spatio-temporal continuity, we propose an improved method（TP NN Queries） that searches the TPR-TREE once to get the curve of distance changes between the query object and the candidate nearest neighbor set, and then we get the NN set. Our method cuts down the query and calculation times. Experimental results show that our method makes a practical improvement.

关 键 词：时空数据库 最近邻居 TPR-TREE 时空连续性 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]