Enhanced Ranking and Storage of Search Results using Markov Chain
Swati Jain1, Ankit Dubey2, Mukesh Rawat3
1Swati Jain, Department of Computer Science and Engineering, Meerut Institute of Engineering and Technology, Meerut (Uttar Pradesh), India.
2Ankit Dubey, M.Tech Scholar, Department of Computer Science and Engineering, Meerut Institute of Engineering and Technology, Meerut (Uttar Pradesh), India.
3Mukesh Rawat, Professor, Department of Computer Science and Engineering, Meerut Institute of Engineering and Technology, Meerut (Uttar Pradesh), India.
Manuscript received on 27 March 2019 | Revised Manuscript received on 04 April 2019 | Manuscript Published on 12 April 2019 | PP: 129-134 | Volume-7 Issue-6C April 2019 | Retrieval Number: F90430476C19/2019©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Much of the time, we need to retrieve the most excellent response to the data available on various links of archives when given a search query. A practical application of Information Retrieval techniques is a Search Engine which helps in finding the relevant content for the input query. In this paper, we propose an ideal technique for analysis of the hyperlinks by taking the Web as a graph structure and we center around the utilization of hyperlinks for ranking web indexed lists and also provide a technique for storage of search results. This paper also includes various Page Ranking algorithms along with their drawbacks.
Keywords: Link Analysis, Markov Chain, Page Ranking, Search Engine, Webgraph.
Scope of the Article: Storage-Area Networks