Skip to Main Content
Search for any topic or a word using Web search engine depends on its ranking mechanism. Generally, search engine sorts through the millions of Web pages and then present the significant Web-pages that match search topic of the user. These matches will be further ranked, so that the most relevant ones come first. This paper proposes an alternate way to rank hyper-linked Web page through analysis of link structure. This link structure is stored in an efficient way to minimize the storage space using Galois Extension Field GF (2P).
Date of Conference: 23-24 Nov. 2007