Journal on Communications ›› 2018, Vol. 39 ›› Issue (6): 109-115.doi: 10.11959/j.issn.1000-436x.2018104

• Papers • Previous Articles     Next Articles

Graph compression algorithm based on a two-level index structure

Gaochao LI1,2,Ben LI3,Yuhai LU4,5,Mengya LIU6,Yanbing LIU4,5   

  1. 1 School of Cyber Security,University of Chinese Academy of Sciences,Beijing 100049,China
    2 Management Center of National Computer Network and Information Security,Beijing 100029,China
    3 Chaoyang Branch of Beijing Public Security Bureau,Beijing 100029,China
    4 Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China
    5 National Engineering Laboratory for Information Security Technologies,Beijing 100093,China
    6 University of Southampton,Southampton SO171BJ,United Kingdom
  • Revised:2018-03-30 Online:2018-06-01 Published:2018-07-09
  • Supported by:
    The National Key R&D Program of China(2016YFB0800300);The Fundamental Theory and Cutting Edge Technology Research Program of Institute of Information Engineering,CAS(Y7Z0351101)

Abstract:

The demand for the analysis and application of graph data in various fields is increasing day by day.The management of large-scale graph data with complicated structure and high degree of coupling faces two challenges:one is querying speed too slow,the other is space consumption too large.Facing the problems of long query time and large space occupation in graph data management,a two-level index compression algorithm named GComIdx for graph data was proposed.GComIdx algorithm used the ordered Key-Value structure to store the associated nodes and edges as closely as possible,and constructed two-level index and hash node index for efficient attribute query and neighbor query.Furthermore,GComIdx algorithm used a graph data compressed technology to compress the graph data before it directly stored in hard disk,which could effectively reduce the storing space consumption.The experimental results show that GComIdx algorithm can effectively reduce the initialization time of the graph data calculation and the disk space occupancy of the graph data storing,meanwhile,the query time is less than common graph databases and other Key-Value storage solutions.

Key words: two-level index, graph compress, Key-Value structure, attribute query, neighbors query

CLC Number: 

No Suggested Reading articles found!