摘要： 在时空数据库中，最近邻查询用于对某个查询对象，在被查询对象中找出离它最近的一个或多个对象。该文在TPR树这一时空索引的基础上，提出了一种高效的最近邻查询算法，能够支持移动对象的多个最近邻对象的查询，并在性能上也有所提高。
关键词:
时空数据库,
最近邻查询,
TPR树,
移动对象
Abstract: In spatio-temporal databases, nearest neighbor(NN) query is used to find out one or more queried objects that are nearest to query object. This paper introduces an effect query algorithm based on TPR tree, such algorithm can support kNN query for moving objects and has a better performance than known algorithms.
Key words:
Spatio-temporal databases,
Nearest neighbor query,
TPR tree,
Moving objects
中图分类号:
程 淼;胡 圣;袁正午;葛君伟;裴海英. 时空数据库中多个最近邻对象的查询算法[J]. 计算机工程, 2006, 32(19): 60-61,7.
CHENG Miao; HU Sheng; YUAN Zhengwu; GE Junwei; BAE Haeyoung. K-nearest Neighbor Query Algorithm in Spatio-temporal Databases[J]. Computer Engineering, 2006, 32(19): 60-61,7.