Sciweavers

CN
1998

Efficient Crawling Through URL Ordering

13 years 3 months ago
Efficient Crawling Through URL Ordering
In this paper we study in what order a crawler should visit the URLs it has seen, in order to obtain more "important" pages first. Obtaining important pages rapidly can be very useful when a crawler cannot visit the entire Web in a reasonable amount of time. We define several importance metrics, ordering schemes, and performance evaluation measures for this problem. We also experimentally evaluate the ordering schemes on the Stanford University Web. Our results show that a crawler with a good ordering scheme can obtain important pages significantly faster than one without.
Junghoo Cho, Hector Garcia-Molina, Lawrence Page
Added 21 Dec 2010
Updated 21 Dec 2010
Type Journal
Year 1998
Where CN
Authors Junghoo Cho, Hector Garcia-Molina, Lawrence Page
Comments (0)