Integration of BinRank and HubRank by executing HubRank on MSGs of BinRank generates

  IJCOT-book-cover
 
International Journal of Computer Trends and Technology (IJCTT)          
 
© - Issue 2011 by IJCTT Journal
Volume-2 Issue-2                           
Year of Publication : 2011
Authors :Krishna Chaitanya.P, O.Srinivasa Rao, Dr MHM Krishna Prasad.

MLA

Krishna Chaitanya.P, O.Srinivasa Rao, Dr MHM Krishna Prasad."Integration of BinRank and HubRank by executing HubRank on MSGs of BinRank generates"International Journal of Computer Trends and Technology (IJCTT),V2(2):640-673 Issue 2011 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract: - This Integration of BinRank and HubRank by executing HubRank on MSGs of BinRank generates paper is used for high quality, high recall search in databases, and the Web using integration of BinRank and HubRank ,by executing HubRank on MSGs that BinRank generates for improving the performance .BinRank system that employs a hybrid approach where query time can be traded off for preprocessing time and storage. BinRank closely approximates ObjectRank scores by running the same ObjectRank algorithm on a small subgraph, instead of the full data graph. The subgraphs are precomputed offline. The precomputation can be parallelized with linear scalability. For approximating ObjectRank by using Materialized subgraphs (MSGs), which can be precomputed offline to support online querying for a specific query workload, or the entire dictionary. Use of ObjectRank itself to generate MSGs for “bins” of terms. So instead of using the ObjectRank, we use Hub rank algorithm to implement on MSGs. Then the performance of the system is greatly improved resulting the query time can be traded off for preprocessing time and storage. By increasing the relevance of keywords in a bin, we expect the quality of materialized subgraphs, thus the top-k quality and the query time can also be improved.

References-

[1] S. Brin and L. Page, “The Anatomy of a Large-Scale Hypertextual Web Search Engine,” Computer Networks, vol. 30, nos. 1-7, pp. 107- 117, 1998.
[2] T.H. Haveliwala, “Topic-Sensitive PageRank,” Proc. Int’l World Wide Web Conf. (WWW), 2002.
[3] G. Jeh and J. Widom, “Scaling Personalized Web Search,” Proc. Int’l World Wide Web Conf. (WWW), 2003.
[4] D. Fogaras, B. Ra´cz, K. Csaloga´ny, and T. Sarlo´ s, “Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments,” Internet Math., vol. 2, no. 3, pp. 333-358, 2005.
[5] K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova, “Monte Carlo Methods in PageRank Computation: When One Iteration Is Sufficient,” SIAM J. Numerical Analysis, vol. 45, no. 2, pp. 890-904, 2007.
[6] A. Balmin, V. Hristidis, and Y. Papakonstantinou, “ObjectRank: Authority-Based Keyword Search in Databases,” Proc. Int’l Conf. Very Large Data Bases (VLDB), 2004

Keywords— ObjectRank,binrank,bin construction,hubrank.