Searching and Enumerating Web Circuits Efficiently for the Crawlers in terms of Web Graph

초록

The rapid growth of the Web poses the information searching efficiency challenges for the hyperlink structure. Web is the huge source of highly densely connected hypertext links which can be described by the directed graphs where a web page is as a vertex and the corresponding hyperlinks between each webpage as an edge, that is widely accepted as the basic approach to analyze the Web structure. This derived graph has the inherent structural characteristics such as overly expanded, overlapped or circuit paths, which could be serious problems for structured searching. The web graph with complex structures such as various web cycles can prevent the web crawlers from searching, indexing, and structuring web information difficult. In this approach, an efficient searching algorithm is suggested to overcome the circuit path problem embedded in the Web. Experimental results indicate that the proposed algorithm outperformed the traditional circuit searching algorithms in terms of the time complexity.