关键词: 聚合最近邻查询, 优势组, 劣势点, 优先扩展

Abstract: Aggregate nearest neighbor query involves many query points, so it is more complicated than traditional nearest neighbor query, and the distribution characteristic of query set implies the region where its aggregate nearest neighbor exists. Taking full account of the distribution characteristic of query set, a method by utilizing distribution characteristic to direct the way of aggregate nearest neighbor searching was given. Based on the method, a new algorithm named AM was presented for aggregate nearest neighbor query. AM algorithm can dynamically capture and use the distribution characteristic of query set, which enables it to search data points in a right order, and avoid unnecessary searching to data points. The experimental results show the efficiency of the algorithm.

Key words: aggregate nearest neighbor query, superiority group, inferior point, extension with high priority