This paper proposes a novel breadth-first search algorithm and deals with the problem of duplicate web pages removing and page ranking by the principle of Small World phenomena. The features of algorithm in this paper are as follows: 1) it proposes the Unit Tree-based Breadth-First Search Algorithm and performs a qualitative analysis and simulated calculation of the performance, with the results demonstrating that the algorithm in this paper reduces the number of neighboring nodes to which messages shall be forwarded and redundant messages as compared with traditional Breath-First Search algorithm and Random Breath-First Search algorithm;;2) it proposes a solution to the problem of duplicate web pages removing and page ranking by Small World phenomena, with the results demonstrating that the method in this paper can effectively bring processing workload, waiting time and the pointless network bandwidth consumption of source node searching into balance.
展开▼
