摘要
为提高Web信息搜索速度,本文采用网站集中减少网站数量的思想,根据网站集中性质,提出了基于贪心算法的网站集中求解方法,该方法在保证检索的网页数量相同前提下,所需搜索的网站数量有一定程度减少,Web搜索时间也相应得到提高。
In order to accelerate Web searching speed, a method to reduce the number of Web sites by using Hub sites is employed. According to the properties of Hub sites, a greedy-based algorithm to obtainthe Hub sites is put forward, which can reduce the number of Web sites to search relatively under the same premise of the number of pages to retrieval. As a result, higher the Web searching speeds.
出处
《情报科学》
CSSCI
北大核心
2012年第5期717-719,共3页
Information Science