A Binary Tree based Approach for Time Based Page Ranking in Search Engines
Keywords:
Abstract
Search engines rank web pages according to different conditions. Some of them use publication time, some use last time of update, some checks the currency of the content of the web page. In this paper, a new algorithm is proposed which will work on the time of the web page, temporal information of the content and forms a binary tree to rank among web pages.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2015-03-15
Issue
Section
License
Copyright (c) 2015 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.