A Kind of Compression Algorithm of Moving Object Network Based on the Graph Cube

Aimed at the amount of aggregation graphs of moving objects network produced by building graph cube, introducing the idea of compressing graph, putting forward the algorithm of compressing aggregation graph MC-compress method used to merge vertices and edges in the aggregation graph.Comparing the largest differences of weight of two edges when merging two vertexes in the aggregation graph, and to find the optimal merging pairs of vertices, finally, generating the super vertexes and super edges to construct compressed graph.The method speeds up the displaying after querying graph structure in graph cube and reducing the space used to store large amounts of aggression graph in the process of building graph cube.