WebParF:A Web Partitioning Framework for Parallel Crawler

Journal Title: International Journal on Computer Science and Engineering - Year 2013, Vol 5, Issue 8

Abstract

With the ever proliferating size and scale of the WWW [1], efficient ways of exploring content are of increasing importance. How can we efficiently retrieve information from it through crawling? And in this “era of tera” and multi-core processors, we ought to think of multi-threaded processes as a serving solution. So, even better how can we improve the crawling performance by using parallel crawlers that work independently? The paper devotes to the fundamental development in the field of parallel crawlers [4], highlighting the advantages and challenges arising from its design. The paper also focuses on the aspect of URL distribution among the various parallel crawling processes or threads and ordering the URLs within each distributed set of URLs. How to distribute URLs from the URL frontier to the various concurrently executing crawling process threads is an orthogonal problem. The paper provides a solution to the problem by designing a framework WebParF that partitions the URL frontier into a several URL queues while considering the various design issues.

Authors and Affiliations

Sonali Gupta , Komal Bhatia , Pikakshi Manchanda

Keywords

Related Articles

FACE RECOGNITION FROM LOWER JAW OR MANDIBLE OF A HUMAN

Identify a human by his face is a very easy job for a human but it is most difficult job for a machine. These papers presenting some approaches for recognize a human face from skull. Then a totally new conception is intr...

Question Categorization Using SVM Based on Different Term Weighting Methods

This paper deals with the performance of Question Categorization based on four different term weighting methods. Term weighting methods such as tf*idf, qf*icf, iqf*qf*icf and vrf together with SVM classifier were used fo...

Workload-aware VM Scheduling on Multicore Systems

In virtualized environments, performance interference between virtual machines (VMs) is a key challenge. In order to mitigate resource contention, an efficient VM scheduling is positively necessary. In this paper, we pro...

A New Method for Finding an Optimal Solution for Transportation Problems

In this paper a new method named ASM-Method is proposed for finding an optimal solution for a wide range of transportation problems, directly. A numerical illustration is established and the optimality of the result yiel...

Demographic Data Assessment using Novel 3DCCOM Spatial Hierarchical Clustering: A Case Study of Sonipat Block, Haryana

Cluster detection is a tool employed by GIS scientists who specialize in the field of spatial analysis. This study employed a combination of GIS, RS and a novel 3DCCOM spatial data clustering algorithm to assess the rura...

Download PDF file
  • EP ID EP125676
  • DOI -
  • Views 81
  • Downloads 0

How To Cite

Sonali Gupta, Komal Bhatia, Pikakshi Manchanda (2013). WebParF:A Web Partitioning Framework for Parallel Crawler. International Journal on Computer Science and Engineering, 5(8), 718-725. https://europub.co.uk/articles/-A-125676