【摘要】 数据集中有关数据点的强邻近对查询问题在空间数据库和多媒体数据库等领域具有着重要的意义。针对数据规模和数据点分布较为相似的两个数据集设计了双Voronoi图法处理无障碍物环境下的强邻近对查询问题。进而,在有障碍物环境下,根据数据点对被阻断的特点,提出了过滤区域的概念,分情况对数据点对进行处理,缩小了判定范围,减小了大量的冗余计算。理论分析和实验表明该方法具有更广的适用范围,显著提高了强邻近对的查询效率。更多还原

【Abstract】 The strong neighborhood pair query has important significance in spatial database and multimedia database etc.The double Voronoi diagrams method that deal with the strong neighborhood pair query in the datasets without barriers is presented. Furthermore,according to the features of the blocking about the data points pairs with barriers,the filtration regions are proposed and the data points pairs are handled.Thus,the decision range and the redundant computation are decreased.Theoretical analysis and the experiment show that the method has a wide applicability and significantly increases the query efficiency of the strong neighborhood pair.更多还原