P2P网络中带阀值Top-k查询方法研究

Research on the Threshold Top-k Query Processing in unstructured P2P Network

由于P2P网络(peer-to-peer networks)具有高动态、分散的特点,洪泛式查询方法引起查询反馈信息的急剧增加.基于互联网搜索引擎广泛采用的Top-k查询算法,以查询树中祖先节点本地查询结果下界作为阈值,提出了用于非结构化P2P网络的带阈值Top-k查询算法.实验证明,在非结构化P2P系统中,带阈值Top-k方法能减少网络传输量.

Owning to the dynamic and decentralized characteristic of P2P networks, flooding query algorithm brings on sharp increasing of feedback information. Based on the widely used flooding Top-k query algorithm of internet,this paper presented an improved threshold Top-k query algorithm of unstructured P2P network by using low boundary of ancestor peers＇ local query results in query processing tree as a threshold. The result showed that the threshold Top-k query method reduced the network transmission load in unstructured P2P network.