Implementing Dynamic Authority Based Search Using Binrank Algorithm | Abstract

ISSN ONLINE(2320-9801) PRINT (2320-9798)

Research Article Open Access

Implementing Dynamic Authority Based Search Using Binrank Algorithm

Abstract

Various algorithms such as ObjectRank 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. It approximates ObjectRank result by materializing a relatively smaller subsets of data graphs, which are generated by partitioning all the terms in the corpus based on their co-occurrence. BinRank can achieve sub-second query execution time without affecting the quality of the search results.

Silica Kole, Ashish Kumar, Pranav Bhatia, and AnshulGoel

To read the full article Download Full Article | Visit Full Article