A Heuristic Algorithmic Approach to Estimate the off line Browsing Efficiency of a Crawler Based Web Archiving System
B.Vijaya Babu1, G.Deepthi2, Ch.Veena3
1Dr. B. Vijaya Babu, Ph.D, Professor, Department of CSE, KL University, Guntur (Andhra Pradesh), India.
2Mrs. G. Deepthi, Research Scholar, Department of CSE, KL University, Guntur (Andhra Pradesh), India.
3Mrs. Ch. Veena, Research Scholar, Department of CSE, KL University, Guntur (Andhra Pradesh), India.
Manuscript received on 10 September 2013 | Revised Manuscript received on 19 September 2013 | Manuscript Published on 30 September 2013 | PP: 11-15 | Volume-3 Issue-4, September 2013 | Retrieval Number: D1160093413/13©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper, the effect of heuristic graph search algorithms like best first and A* best first search on the offline browsing efficiency is studied. A web crawler based multithreaded web archiving system is designed using these heuristic graph search algorithms and the offline browsing efficiency of the web archiving system is estimated.
Keywords: offline Browsing Efficiency, Heuristic Graph Search Algorithms, Multithreaded, Web Archiving System.
Scope of the Article: Algorithmic Game Theory