• MATTAPARTHI NAVYA SRIDEVI
• B.SURYANARAYANA MURTHY

A web Search is a program, which automatically traverses the web by downloading documents and following links from page to page. They are mainly used by web search engines to gather data for indexing. Other possible applications include page validation, structural analysis and visualization; update notification, mirroring and personal web assistants/agents etc. Web Search are also known as spiders, robots, worms etc. A Search resides on a single machine. The Search simply sends HTTP requests for documents to other machines on the Internet, just as a web browser does when the user clicks on links. All the Search really does is to automate the process of following links. Web Searching speed is governed not only by the speed of one’s own Internet connection, but also by the speed of the sites that are to be Searched. Especially if one is a Searching site from multiple servers, the total Searching time can be significantly reduced, if many downloads are done in parallel. This work implements the “Breadth First Searching” algorithm, a refined version of one of the first dynamic Web search algorithm.

Breadth First Search, Robots, Web agents, visualization, page validation

"Crawling HTTP-Web Site Traffic Using Individual Web Page Traffic", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.8, Issue 6, page no.g312-g316, June-2021, Available :http://www.jetir.org/papers/JETIR2106865.pdf

"Crawling HTTP-Web Site Traffic Using Individual Web Page Traffic", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.8, Issue 6, page no. ppg312-g316, June-2021, Available at : http://www.jetir.org/papers/JETIR2106865.pdf