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

Abstract:

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 somemoving objects. Based on the theory of moving objects＇ spatio-temporal continuity, we propose an improved method（TP NN Queries） that searches the TP PR-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.

Key words: （spatio-temporal database, NN;TPR-TREE, spatio-temporal continuity）