Improved Ranking Algorithm of Web Page (Based on Age of Page) For Web Search Engines

Search engines, which receive approximately a million requests per day, play a vital role in finding and filtering the vast amount of data available on the Web. On the basis of some algorithm, a search engine decides the rank of the page content and displays the pages in that order. In the terminology of graph representation of the World Wide Web (WWW), several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the WWW. If a node represents page and graph represents the linking among pages (WWW), then PageRank is the most popular ranking algorithm to rank the nodes of any directed graph. The PageRank algorithm has been intuitively justified to model a random surfer in which a user clicks on the links at random and the rank of a page signifies the probability of the user arriving at that page. This algorithm does not consider the time constraint (age of the specific page on the web). It is observed that a number of incoming links which point at a page (with same content) may increase with time because when different persons become aware of the importance of the web page with time, they provide a link to that specific page, thus the number of incoming links to that particular web page may increase with time. Therefore, time must be considered to decide the priority (rank) of the page. Hence time constraint is introduced in the existing algorithm to derive a new and effective algorithm