Answering Constrained k-NN Queries in Unstructured P2P Systems 摘要粗译

Abstract. The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructured P2P system is not well studied despite of their popularity. Communication-efficient processing of k-NN queries in such an environment is a unique challenge due to the distribution, dynamics and large scale of the system. In this paper, we investigate the problem of efficiently computing k-NN queries over unstructured P2P systems. We first propose a location-based domination model to determine a search space. We then present two types of probing strategies, radius-convergence and radius-expanding. A comprehensive performance study demonstrates that our techniques are efficient and scalable.

摘要。K-NN查询处理已经在集成计算环境和结构化P2P网络中结被广泛研究，非常很流行但在非结构化的P2P系统中还没有进行很好的研究。在这样环境下的K-NN查询的沟通效率处理是一个独有的挑战，因为其分布性，动态性和系统的大尺度化。本文中，我们研究了在非结构化的P2P系统中有效的计算K-NN查询。我们首先定义了一个本地的支配模式来检测查询空间。然后提出了两类探针策略，半径收敛与半径扩展。一个综合的性能研究表明我们的技术是有效并且可扩展的。