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
- EP ID EP125676
- DOI -
- Views 113
- Downloads 0
Fuzzy Optimal Solution to Fuzzy Transportation Problem: A New Approach
In this paper we propose a new algorithm for the initial fuzzy feasible solution to a fully fuzzy transportation problem. Then by using fuzzy version of modified distribution method, we obtain the fuzzy optimal solution...
A GA Approach to Static Task Scheduling in Grid based Systems
Static task scheduling in computational grids is very important because of the optimal usage of computing time for scheduling algorithms. Given a set of resources, a static scheduler computes the execution schedule befor...
Ant Colony Optimization approach for Solving FPGA routing with minimum Channel Width
In this paper ANT colony optimization algorithm has been proposed to solve FPGA routing in FPGA design architecture with minimum umbers of tracks per channel. In our method geometric FPGA routing task is transformed into...
AI based Digital Companding Scheme for OFDM system using custom constellation Mapping and selection
Data rate is important in telecommunication because it is irectly proportional to the cost of transmitting the signal. Saving bits is the same as saving money . In this paper we propose new digital companding scheme for...
Medical Image Matching and Retrieval using Discrete Sine Transform
Visual information has been extensively used in the areas of multimedia, medical imaging and other numerous applications. Management of these visual information is challenging as the quantity of data available is very hu...