移动Spider的非递归爬行方法设计

Design of Method for Non-Recursive-Climb of Mobile Spider

目前的移动网络蜘蛛往往采用递归爬行的方法,该方法会造成系统资源开销大、爬行速度慢,而且可能会因为被搜索Web页面本身结构的原因造成死循环。本文指出了该方法的不合理性,设计了一种非递归爬行方法,有效地避免了死循环,与递归爬行方法相比,系统资源开销更小、爬行速度更快。

Mobile Spider always uses the Recursive-Climb method,which expends more system resource and climbs slowly and may cause endless loop due to the reason of web page itself.This article presents a method for Non-Recursive-Climb,which will never cause endless loop,expend less resource and climb faster compared with Reursive-Climb.