2014•Unpublished venueRequires access

Comparitive analysis of various Ranking Algorithms for web Page Retrieval

Roopali Jindal, Ashok Kumar, Dheerendra Singh

Open publisher page 0 citations

Abstract

The World Wide Web consists of millions of interconnected web pages that provide information to the user present in any part of the world. The World Wide Web is expanding and growing in size and the complexity of the web pages. That is why it is necessary to retrieve the best or the web pages that are more relevant in terms of information for the query entered by the user in the search engine. To extract the relevant web pages, the search engine requires a ranking module that applies a ranking algorithm on the web to fetch the web pages in order of the importance of the information entered by the user in the query. The ranking algorithm is much efficient to rank the surface web, i.e. the web pages that can be indexed by the search engine, as well as the hidden web, i.e. the web pages that cannot be indexed by the search engine. This paper compares the ranking algorithms that are very efficient to find the future scope and the methodology to calculate the relevancy of the web page.

About this research paper

What this paper is about

The World Wide Web consists of millions of interconnected web pages that provide information to the user present in any part of the world. The World Wide Web is expanding and growing in size and the complexity of the web pages. That is why it is necessary to retrieve the best or the web pages that are more relevant in terms of information for the query entered by the user in the search engine. To extract the relevant web pages, the search engine requires a ranking module that applies a ranking algorithm on the web to fetch the web pages in order of the importance of the information entered by the user in the query. The ranking algorithm is much efficient to rank the surface web, i.e. the web pages that can be indexed by the search engine, as well as the hidden web, i.e. the web pages that cannot be indexed by the search engine. This paper compares the ranking algorithms that are very efficient to find the future scope and the methodology to calculate the relevancy of the web page.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The World Wide Web consists of millions of interconnected web pages that provide information to the user present in any part of the world. The World Wide Web is expanding and growing in size and the complexity of the web pages. That is why it is necessary to retrieve the best or the web pages that are more relevant in terms of information for the query entered by the user in the search engine. To extract the relevant web pages, the search engine requires a ranking module that applies a ranking algorithm on the web to fetch the web pages in order of the importance of the information entered by the user in the query. The ranking algorithm is much efficient to rank the surface web, i.e. the web pages that can be indexed by the search engine, as well as the hidden web, i.e. the web pages that cannot be indexed by the search engine. This paper compares the ranking algorithms that are very efficient to find the future scope and the methodology to calculate the relevancy of the web page.

Key concepts: Computer science, Web page, Static web page, Web search engine, Information retrieval, World Wide Web, Web search query, Web navigation

Related papers

Back to paper searchBrowse research topicsOriginal source
Comparitive analysis of various Ranking Algorithms for web Page Retrieval — Research Paper | ScholarLens