A distributed top-k query algorithm integrated k-Cone structure for DHT overlay networks

The top-k query algorithm is a useful tool to lookup the best k results from candidate dataset for inquiring action. However, majority top-k query algorithms are applied to client/server networks rather than distributed networks specifically DHT overlay networks. This paper thinks about this problem to design a distributed top-k query algorithm for DHT overlay networks. It first constructs a unique k-Cone structure. And then designs a distributed top-k query algorithm for DHT overlay networks. Finally, an effective offset degree method is also applied to a collection of simulating experiments for verifying efficient as well as reliable of designed algorithm in different network scales. Luckily, a series of experiments give a fact that this distributed top-k query algorithm is a kind of efficient and reliable query algorithm in DHT overlay networks.