Success Pattern Finding With Regards To Textual Content Exploration

K Anuradha, K N madhavi latha


Various algorithms such as Object Rank and PageRank, the latter created by Larry Page and used in Google Search Engine, were highly expensive as they required a PageRank style iterative computation over the full graph. BinRank, a hybrid algorithm proposed uses an index of pre computed results for some/or all keywords being used by the user Dynamic authority based online keyword search algorithms, such as Object rank and personalized page rank leverage semantic link in formation to provide high quality, high  recall search in databases and the web Conceptually, these  algorithms require a query time  page rank style iterative computation over the full graph. This computation is too  expensive for large graphs and not feasible at query time . Alternatively, building an index of pre computed results for some  or all keywords involves very expensive processing. We introduce  BinRank,a system that approximates ObjectRank results by utilizing a hybrid approach inspired by materialize d views in traditional query processing. The issue addressed in this paper is would like to provide an approach which intends to provide an approximation to BinRank by integrating it with Hubrank and parallelize i.e execute the activities simultaneously to reduce query execution time and also increase the relevance of the results. Bin Rank system which  approximates Object Rank results by utilizing a hybrid approach inspired by materialized views in traditional query  processing.


s.brin,,"the anatomy of a large-scale hypertextual web search engine",computer networks,vol.30, os.1-7, pp. 107-117, 1998.

t.h.haveliwala,"topic-sensitivepagerank,"’l world wide web conf.(www),2002.

g.jeh, j.widom,”scaling personalized web search ,”’l world wide web conf.(www),2003.

d.fogaras, b.racz,k.csalogany,and .sarlos,"towards scaling fully personalized pagerank: algorithms, lower bounds,and experiment", internet math.,vol.2,no.3,pp.333-358,2005.

k.avrachenkov,n.litvak,d.nemirovsky, 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.

a.balmin,v.hristidis, y.papakonstantinou,"objectrank:authority-based keyboard search in databases",’l conf.very large data bases (vldb),2004.

znie , y. zhang , j .r . wen , w. y. ma , " object - level ranking:bringing order to web objects",’l world wide web conf.(www),pp.567-574,2005.

s.chakrabarti,"dynamic personalized pagerank inentityrelations graphs",’l world wide web conf.(www),2007.

h.hwang,a.balmin,h.pirahesh, b.reinwald,”information discovery in loosely integrated data,”proc.acm sigmod, 2007.

v.hristidis,h.hwang, y.papakonstantinou,"authority-based keyword search in databases,”acm trans. database systems,vo l.33, no.1, pp. 1-40,2008.

m.r.garey, d.s. johnson,"a 71/60 theoremfor bin packing,"j.complexity,vol.1,pp.65-106, 1985.

. k.s.beyer,p.j.haas,b.reinwald,y.sismanis, r.gemulla,"on synopses for distinct-value estimation under multiset operations,"proc.acm sigmod, pp.199-210, 2007.

j.t.bradley, jager,w.j.knottenbelt, a.trifunovic, "hypergraph partitioning for faster parallel pagerank c

omputation , ” EPEW,pp. 155-171, 2005.

Full Text: PDF [FULL TEXT]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.|

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at