基于二级索引结构的图压缩算法

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 construct-ed 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

More information

Identifiers

Catalogue record

Export record

ASCII CitationAtomBibTeXData Cite XMLDublin CoreDublin CoreEP3 XMLEndNoteHTML CitationHTML CitationHTML ListJSONMETSMODSMPEG-21 DIDLOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLRIOXX2 XMLReferReference ManagerSimple Metadata

Altmetrics