Abstract: As the next generation of storage model of giant data, NoSQL database plays an important role both in the fields of scientific computing and commercial computing, and has gained wide attention in academia and business community. We presented a new parallel method based on HBase to gain the shortest path tree. Firstly, Watts-strogatz mode was used to complete the mathematical modeling of giant network, therefore the network would have some cluster effects. Secondly,we made a simplification and improvement to the parallel breath-first search method,in order to improve its calculation efficiency. In addition, we designed and implemented a large number of experiments. According to the experiment results,we obtained the giant network shortest path trec,and verified the correctness and validity of the algorithm. Meanwhile,Contrast to the other path algorithm,we verified the efficiency of the algorithm.

Key words: HBase, Ccoprocessor, Parallel BFS, Mapreduce, NoSQL database