ISSN 1119-4618
 
2022, Vol: 22, Issue: 4
22/4Current Issue Online FirstArchiveAims and ScopeAbstracting & IndexingMost Accessed ArticlesMost Downloaded ArticlesMost Cited Articles

Original Research 
JPAS. 2022; 22(4): 510-514


Comparative Analysis of Depth first, Breath First with Modified Max Min Ant system crawler Algorithms

Fatima Umar Zambuk, Maryam Maishanu, Maryam Musa Abdullahi , Rabi Mustapha, Souley Boukari.

Abstract
The capability to quickly fetch a large number of Web pages into a local repository and to index them based on keywords is required in many applications. Large-scale programs that fetch tens of thousands of Web pages per second are called crawlers, spiders, Web robots, or bots. Crawling is usually performed to subsequently index the documents fetched, together, a crawler and an index form key component of a Web search engine. Crawling the web has been the best mechanism in retrieving information from the internet. Due to the share size and dynamism of the internet searching depend mostly on crawlers. Researchers have been working on new crawlers to resolve the problem of relevant web page retrieval, computation cost and efficiency. In this paper we compare Depth first and Breath first crawler with our proposed modified Maxmin ant system based on computation cost and reliability. We simulate the crawlers using Jgraph on different data set, and were able to show that our proposed MMM crawler has less computation cost as the data size increases.

Key words: : Breadth first crawler, Depth first Crawler, Modified Max min ant crawler, web crawler


 
ARTICLE TOOLS
Abstract
PDF Fulltext
How to cite this articleHow to cite this article
Citation Tools
Related Records
 Articles by Fatima Umar Zambuk
Articles by Maryam Maishanu
Articles by Maryam Musa Abdullahi
Articles by Rabi Mustapha
Articles by Souley Boukari
on Google
on Google Scholar

How to Cite this Article
Pubmed Style

FUZ, MM, MMA, Mustapha R, Boukari S, . Comparative Analysis of Depth first, Breath First with Modified Max Min Ant system crawler Algorithms. JPAS. 2022; 22(4): 510-514.

Web Style

FUZ, MM, MMA, Mustapha R, Boukari S, . Comparative Analysis of Depth first, Breath First with Modified Max Min Ant system crawler Algorithms. https://www.atbuscienceforum.com/?mno=112470 [Access: January 16, 2023].

AMA (American Medical Association) Style

FUZ, MM, MMA, Mustapha R, Boukari S, . Comparative Analysis of Depth first, Breath First with Modified Max Min Ant system crawler Algorithms. JPAS. 2022; 22(4): 510-514.


Vancouver/ICMJE Style

FUZ, MM, MMA, Mustapha R, Boukari S, . Comparative Analysis of Depth first, Breath First with Modified Max Min Ant system crawler Algorithms. JPAS. (2022), [cited January 16, 2023]; 22(4): 510-514.


Harvard Style

, F. U. Z., , M. M., , M. M. A., Mustapha, R., Boukari, S. & (2022) Comparative Analysis of Depth first, Breath First with Modified Max Min Ant system crawler Algorithms. JPAS, 22 (4), 510-514.


Turabian Style

, Fatima Umar Zambuk, Maryam Maishanu, Maryam Musa Abdullahi, Rabi Mustapha, Souley Boukari, and . 2022. Comparative Analysis of Depth first, Breath First with Modified Max Min Ant system crawler Algorithms. Science Forum (Journal of Pure and Applied Sciences), 22 (4), 510-514.


Chicago Style

, Fatima Umar Zambuk, Maryam Maishanu, Maryam Musa Abdullahi, Rabi Mustapha, Souley Boukari, and . "Comparative Analysis of Depth first, Breath First with Modified Max Min Ant system crawler Algorithms." Science Forum (Journal of Pure and Applied Sciences) 22 (2022), 510-514.


MLA (The Modern Language Association) Style

, Fatima Umar Zambuk, Maryam Maishanu, Maryam Musa Abdullahi, Rabi Mustapha, Souley Boukari, and . "Comparative Analysis of Depth first, Breath First with Modified Max Min Ant system crawler Algorithms." Science Forum (Journal of Pure and Applied Sciences) 22.4 (2022), 510-514. Print.


APA (American Psychological Association) Style

, F. U. Z., , M. M., , M. M. A., Mustapha, R., Boukari, S. & (2022) Comparative Analysis of Depth first, Breath First with Modified Max Min Ant system crawler Algorithms. Science Forum (Journal of Pure and Applied Sciences), 22 (4), 510-514.


Author LoginReviewer LoginLicense Information
This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles in this journal without asking prior permission from the publisher or the author. This is in accordance with the Budapest Open Access Initiative (BOAI) definition of open access.
The articles in Science Forum (Journal of Pure and Applied Sciences) are open access articles licensed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc-sa/3.0/) which permits unrestricted, non-commercial use, distribution and reproduction in any medium, provided the work is properly cited.
Copyright © 2023 Science Forum (Journal of Pure and Applied Sciences) All Rights Reserved. Subject to change without notice from or liability to Science Forum (Journal of Pure and Applied Sciences).
For best results, please use Internet Explorer or Google Chrome

Contact Information