P2P Web搜索中一种有效的查询路由策略  

An Effective Query Routing Strategy over P2P Web Search

作　　者：王振华[1] 李妹芳[1] 申德荣[1] 于戈[1] 

机构地区：[1]东北大学信息科学与工程学院,沈阳110819

出　　处：《计算机与数字工程》2011年第10期13-15,179,共4页Computer & Digital Engineering

基　　金：国家自然科学基金(编号:60973021;61003060)资助

摘　　要：有效的多关键字查询路由是P2PWeb搜索中的一个关键问题。文章提出一种基于收益代价比的查询处理方法。该方法基于DHT的P2P覆盖网,挖掘关键字的关联性和节点间覆盖度和重叠度。利用最小独立置换进行重叠检测,因此避免了对相同记录的冗余路由。实验证明了该方法显著减少了查询时间,同时提高了查全率和查准率。Effective multi-keyword query routing is the key problem over P2P Web search.A novel query processing strategy based on benefit cost ratio was proposed.A P2P overlay based on DHT has been built,and take into account of the correlation of Key words as well as the coverage and overlap among peers.Min-wise independent permutation was applied for overlap detection,so the redundant routing to the same result is avoided.The experimental results show that the method improves the search performance greatly.

关 键 词：P2PWeb搜索 多关键字查询处理 最小独立置换 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]