一种高效的GNN查询算法的研究

Research on an Efficient Method for GNN Query Algorithm

给定集合P和Q,则GNN查询返回的是P中的对象p,p满足到Q中所有对象的距离的集合函数f最小。求GNN的方法有多种,文章提出了vp-GNN算法,其特点在于不采用任何索引的情况下,也能高效地对空间数据库中的数据进行裁剪,缩小查询区域、提高GNN的查询效率。

Given a collection of P and Q, then GNN is returned by the query object p in P, p meets to set function all objects in the Q fthe minimum distance. There are several methods for GNN. This paper raises the vp-GNN algorithm, which is characterized in that does not use any index case, also can effectively cut to spatial data in the database, reduce the search area and improve the efficiency of GNN query.