关键词: 组反k近邻查询, R树索引, 空间数据库, 数据查询

Abstract:

When a query point had multiple objects, the traditional query methods queried every points, resulting in a very long running time. We considered multiple query points as a whole and proposed the group reverse k nearest neighbor (GRkNN) method with the pruningverification phases. The experiments show that the method can update database more efficiently, and shorten the running time.

Key words: group RkNN query, Rtree indexes, spatial database, data query