A Novel Algorithm for Enhancing Search Engine Optimization
Ritu Sachdeva (Sharma)1, Sachin Gupta2
1Ritu Sachdeva (Sharma), Department of Computer Science, Modern Vidya Niketan University, Palwal (Haryana), India.
2Sachin Gupta, Department of Computer Science, Modern Vidya Niketan University, Palwal (Haryana), India.
Manuscript received on 22 March 2019 | Revised Manuscript received on 05 April 2019 | Manuscript Published on 11 April 2019 | PP: 47-53 | Volume-8 Issue-4C, April 2019 | Retrieval Number: D24200484C19/19©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: Google search engine uses Page Rank algorithm to rank websites in their search results. But, Page Rank calculates only the importance of each page rather than relevancy. Whenever a user triggers a query to be searched, searching algorithm finds pages associated with the query term i.e. on basis of relevancy. Then, Page Rank selects the most imperative result. Different Search Engine use different searching algorithm plays an indispensable role in searching relevant results. But efficiency of searching algorithm is calculated by drafting algorithms for specific categories of data like strings. In numerous key approaches, the trie is a recognized fast access method. The proposed algorithm is a search algorithm for path-compressed trie for keyword searching in a database through a search engine. Faster searching optimizes the search engine and speeds up the complete process of creating final results. Thus, greater SEO (search engine optimization), faster will be Page Rank Algorithm.
Keywords: Binary Trie, LC-Trie, Page Rank, PAT, PATRICIA, Search Engine Optimization, Trie.
Scope of the Article: Algorithm Engineering