Crossref DOIMemberCiteFactoropen accessissn
SJIF Impact Factor 8.659 | ISSN: 2582-3930
IJSREM Logo

International Journal of Scientific Research in Engineering and Management

(Gateway to Global Scholars - An International, Scholarly, Multi-Disciplinary, Open Access Journal)

Peer-Reviewed Journal Designed to Meet UGC's Quality Parameters

HomeCurrent IssuePast IssuesPay OnlineConferencesEditorial BoardAbout UsContact Us
IJSREM

Loading article...

Follow Us

  • Google Scholar
  • ResearchGate
  • Academia.edu
  • Mendeley
  • LinkedIn
  • Facebook
  • Instagram

Journal Policies

  • Peer Review Policy
  • Publication Ethics
  • Copyright Infringement
  • Refund & Cancellation Policy
  • Terms and Conditions
  • Privacy Policy

Journal Identifiers & Licenses

  • ISSN Verified: 2582-3930ISSN Verified: 2582-3930
  • Crossref DOI: 10.55041Crossref DOI: 10.55041
  • SJIF Ranking: 08.659SJIF Ranking: 08.659
  • Licensed under CC BY 4.0Licensed under CC BY 4.0
  • ISO Certification: 9001:2015ISO Certification: 9001:2015
  • Indexed & Cited In: Google ScholarIndexed & Cited In: Google Scholar

Contact Us

International Journal of Scientific Research in Engineering and Management (IJSREM)

#62/1, New No 7, 1st Cross, 2nd Main, Ganganagar, R T Nagar, Bangalore North, Bangalore, Karnataka, India – 560032
[email protected]+91 93911 67991
logos
logos
Working Hours

Mon – Sat: 9:00 AM – 6:00 PM

Sunday: 10:00 AM – 4:00 PM

+91 93911 67991

© 2026 IJSREM – International Journal of Scientific Research in Engineering and Management. This is an open-access journal. Articles are published under the Creative Commons Attribution (CC BY 4.0) License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

DisclaimerPrivacy PolicyTerms and Conditions
ArticlePeer ReviewedOpen AccessPlagiarism Passed
Paper ID:IJSREM35604

RESEARCH ON WEB CRAWLER’S AND ITS PERFORMANCE VIA EXAMINATION OF SINGLE AND MULTI-THREADING BY USING ALGORITHMS

Stream/Area:

-

Subject:

-

Paper ID:

IJSREM35604

Volume:

8 |

6 |

Jun 2024

Pages:

Publication Frequency:

Monthly (12 issues per year)

DOI
Digital Object Identifier
Not assigned

License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.

Share this article:

Authors

CM

CHIRITHOTI MANEESHA

GVG

G VENU GOPAL

Author Services & Downloads

Full Articles

Abstract

These days, while thinking about how to build the World Wide Web, web crawling is a crucial idea. Developing a reliable crawler system that returns relevant and efficient search results for common queries is an ongoing need. On a daily basis, individuals encounter the issue of search results that include unsuitable or inaccurate responses. Therefore, it is crucial to find better ways to provide users accurate search results in a reasonable amount of time. Web users and analyzers may get less useful and perhaps irrelevant findings since not all sites can be visited in less time. One kind of robot that can access hyperlinks and explore online pages is called a web crawler, often called a spider. The documents that are traversed from a web page are gathered in a web pot. The process begins with the seed URL, which is where the user gets the web content. If there are any new links in the downloaded documents, it will delete them. The crawler verifies whether the user has already downloaded the file when the URL is deleted. A web crawler follows the links on a website to read the documents contained within. Developing a reliable crawler system that returns relevant and efficient search results for common queries is an ongoing need. On a daily basis, individuals encounter the issue of search results that include unsuitable or inaccurate responses. Therefore, it is crucial to find better ways to provide users accurate search results in a reasonable amount of time. We demonstrate an efficient method for developing a crawler that takes aspects into account in this project. Moreover, there are a lot of crawlers that visit the seed URL, read the pages, and then download them to add to search engine indexes. An issue arises when the crawler continues to access out-of-date websites or pages, even if they were downloaded on their prior visit. A lot of time, space, bandwidth, and network resources are wasted because of this. It is possible to retrieve pages using a variety of algorithms. This study proposes a new method for web crawlers that use clustering techniques: single and multithreaded web crawling and indexing algorithm. Therefore, you should try to make a good system with a revised policy for web crawlers in order to reduce the occurrence of these issues. After sorting websites into “frequently,” “frequently,” and “static” in the first scan, the crawler determines when it needs to crawl that same page again. Results from experiments demonstrate that, compared to current approaches, the suggested algorithm achieves optimum execution time. Building an intelligent crawler that can learn to improve the effective ranking of URLs using a focused crawler is the main focus of this project. Initially, links are crawled from specific Uniform Resource Locators (URLs) using a crawling algorithm. This allows users to perform hierarchical scanning for their respective web links.

KEYWORDS

Web crawler URL’s Multi Threaded Crawling Web Crawling Tree Algorithms.

Cite This Article

CHIRITHOTI MANEESHA, G VENU GOPAL, "RESEARCH ON WEB CRAWLER’S AND ITS PERFORMANCE VIA EXAMINATION OF SINGLE AND MULTI-THREADING BY USING ALGORITHMS," International Journal of Scientific Research in Engineering and Management, vol. 8, no. 6, Jun 2024.

Full Article/Conclusion

References

Editorial & Review Transparency

Publication Date

6/5/2024

Peer Review Type

Double-Blind Peer Review

Review Rounds: 2

Documents

Review Report (Confidential)
Copyright Form (Office)

Article Metrics & Impact

Article Views

0

Total views since publication

PDF Downloads

0

Total downloads since publication

Geographic Reach

5

Indexing, Archiving & Preservation

Google Scholar
Academia
ResearchGate
Crossref
SSRN
Semantic Scholar
Thomson Reuters
WorldCat
Mendeley
OpenAlex
EBSCO
Zenodo

Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.

Ethics, Compliance & Transparency

Plagiarism Screening

This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.

Conflict of Interest

The authors declare no conflict of interest related to this research work.

Funding Information

No funding information available for this research.

Similar & Recommended Articles

Similar Articles by Topic

Related research in the same subject area

Loading similar articles...