REVIEW OF REAL TIME EFFICIENT WEB PAGE SEARCHES BASED ON RANKING

S. HASEENA¹ , R. LATHA² , A.M. BARANI³

1. Department of Computer Science & Application, St.Peter’s Institute of Higher Education and Research, Chennai, India.
2. Department of Computer Science & Application, St.Peter’s Institute of Higher Education and Research, Chennai, India.
3. Department of Computer Science & Application, St.Peter’s Institute of Higher Education and Research, Chennai, India.

Section:Review Paper, Product Type: Isroset-Journal
Vol.6 , Issue.2 , pp.105-108, Apr-2018

CrossRef-DOI:   https://doi.org/10.26438/ijsrcse/v6i2.105108

Online published on Apr 30, 2018

Copyright © S. HASEENA, R. LATHA, A.M. BARANI . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

481 Views    269 Downloads    155 Downloads

Abstract :
Web surfer are explicitly intended for looking website pages, archives and pictures were created to encourage searching through a vast, amorphous blob of unstructured assets. They are built to take after a multi-organize process: creeping the vast reserve of pages and archives to glance through at once in the allegorical froth from their substance, ordering the froth/popular expressions in a kind of semi-organized frame (database or something), and finally, settling client sections/questions to return most precise or logical relevance to the outcomes and connections to those filtered records or pages from the stock.

Key-Words / Index Term :
look interface, crawler,indexer, and database

References :
Adriaanse L and Rensleigh C (2013). Web of Science, Scopus and Google Scholar. The Electronic Library, 31(6), 727-744.
[2] Aniko Hannak, Piotr Sapiezynski, Arash Molavi, Kakhki, Balachander Krishnamurthy, David Lazer, Alan Mislove and Christo Wilson (2013)”Measuring Personalization of Web Search (PDF)” Archived from the original (PDF) on April 25, 2013.
[3] Bornmann, L, Leydesdorff L and Mutz R (2013). The use of percentiles and percentile rank classes in the analysis of bibliometric data: Opportunities and limits. Journal of Informetrics, 7(1), 158-165.
[4] D. Coltuc and J.-M. Chassery, “Very fast watermarking by reversible contrast mapping,” IEEE Signal Process. Lett., vol. 14, no. 4, pp. 255–258, Apr. 2007. Christian Quast, Elmar, Pruesse Pelin, Yilmaz Jan, Gerken Timmy, Schweer Pablo, Yarza Jörg, Peplies Frank and Oliver Glöckner (2013) ” The SILVA ribosomal RNA gene database project: improved data processing and web-based tools” at Nucleic Acids Research, Volume 41, Issue D1, 1 January 2013, Pages D590–D596.
[5] Jayanthi.J and Dr.K.S.Jayakumar (2011) “An integrated Page Ranking Algorithm for Personalized Web Search”. In International Journal of Computer Applications (0975- 8887), Volume 12-No.11, January 2011.
[6] Manikandan, R and Dr. R.Latha (2017).“A literature survey of existing map matching algorithm for navigation technology,” International journal of Engineering Sciences & Research Technology”, 6(9), 326-331.Retrieved September 15, 2017.
[7] Mercy paul Selvan, A . Chandra Sekar and A. Priya Dharshini (2012) "Survey on Web page Ranking Algorithms"at International Journal of Computer Applications, Vol.41, No-19, ISSN 0975-8887.
[8] Northcott, D. and Linacre S (2010). Producing spaces for academic discourse:The impact of research assessment exercises and journal quality rankings. Australian Accounting Review, 20(1), 38- 54.
[9] Sergey Brin and Lawrence Page (2012) “The anatomy of large scale hypertexual search engine” at Computer Networks Elsevier, vol.56, issue-18, pp3825-3833.
[10] Mitsuo Yokokawa, Fumiyoshi Shoji, Atsuya Uno, Motoyoshi Kurokawa and Tadashi Watanabe (2011). The K computer: Japanese next-generation supercomputer development project. International Symposium on Low Power Electronics and Design (ISLPED). pp. 371–372. doi:10.1109/ISLPED.2011.5993668 (1–3 August 2011).