Top-K Query for Aggregate Value in Structured Networks
Top-k query processing has received more and more attention,but existing top-k algorithms can be only applied in the centralized network.This paper presents a new algorithm to answer top-k query,called Histogram-Container(HC for short),which can achieve major performance gains in terms of query response time and network bandwidth,and furthermore,it can resolve queries in any kind of structured overlay networks.We will show how to use local histogram and bloomfilter in a tree structure for optimizing the query and how to process intermediate results in inner peers.Our experimental results show that HC can achieve major performance gains in terms of network bandwidth,query response time.