Analysis and Management to Hash-Based Graph and Rank

摘要

We study the problem of how to calculate the importance score for each node in a graph where data are denoted as hash codes. Previous work has shown how to acquire scores in a directed graph. However, never has a scheme analyzed and managed the graph whose nodes consist of hash codes. We extend the past methods and design the undirected hash-based graph and rank algorithm. In addition, we present addition and deletion strategies on our graph and rank. Firstly, we give a mathematical proof and ensure that our algorithm will converge for obtaining the ultimate scores. Secondly, we present our hash based rank algorithm. Moreover, the results of given examples illustrate the rationality of our proposed algorithm. Finally, we demonstrate how to manage our hash-based graph and rank so as to fast calculate new scores in the updated graph after adding and deleting nodes.