With the emerging of applications such as Social Network Services and biological information network analysis and the rapid development of computer technology

the scale of graph increases quickly and updates frequently

so the demand to deal with large scale dynamic graph becomes more pressing.The existing research works focusing on large scale dynamic graph are rare

which have shortcomings such as difficult index compression and needing optimizing graph structure.Therefore

in this paper

we present a reachability query processing method of dynamic large scale graph based on improved Huffman Coding

named Huffman-based Label Reachability

HuffLR.Firstly

the structure of pre-processing graph is compressed twice in order to gain the double compression graph.Secondly

the prefix-label index is constructed based on the double compression graph

which can express the reachability relations between nodes effectively.Lastly

we present the evolution of the double compression graph and reachability query processing and optimized algorithms

including insertion and deletion of edge

insertion and deletion of node.Experimental results demonstrate that the reachability query processing algorithm of dynamic large scale graph based on improved Huffman Coding has good feasibility and effectiveness.