Web Topology Search Based on Multithread Recursive Model
Web is growing and evolving at a rapid pace. It can be modeled as a directed graph in which a node represents a Web page and an edge represents a hyperlink relationship. There are serval search engines used for searching the internet information, on which is main based content and text information. Furthermore, some website topology using interesting association rules to measure the interestingness between two sets of web pages in the Website. In this paper, it describes our ongoing work on webdigger, a scalable web topology searcher to describe nodes relation between network nodes based on multithread recursive model, by which to analyse the nodes relation and improve topology find efficiency.Webdigger discover sites structure and map view by a recursive algorithm. Not only does it find out the web siteslink relatio, but also it analyses and processes the crosslink and loop-link. In our experiment, it gives web nodes relation that describes the self-linked, cross-linked and outer-linked in the large scale internet web environment.Experiment results show that average website ratio by others linked is 18.4％, self-linked is 47.4％, and 8.7％ hyperlink is miss-linked.
web topology recursive algorithm
ZHANG Mingwu YANG Bo ZHU Shenglin ZHANG Wenzheng
College of Informatics South China Agricultural University Guangzhou, Guangdong 510642, China National Laboratory for Modern Communications Chengdu, Sicuan 610041, China
国际会议
武汉
英文
784-787
2007-07-25（万方平台首次上网日期，不代表论文的发表时间）