摘要
图数据规模的日益增大带来图划分过程时间消耗急剧增加的问题,为了解决这一问题,流图划分算法被提出,但是仍然缺乏对有向图和无向图进行区别的划分算法。针对有向图的流式划分中存在的信息丢失问题,提出反向映射图这一概念,解决划分过程中的信息丢失问题,同时利用反向映射图进一步优化图划分的结果。
The increasing scale of graph data brings the sharp increase of time consumption in graph partition process．
In order to solve this problem，
proposes a streaming graph partitioning algorithm，but there is still a lack of partitioning algorithm distinguish directed graph and undirect—
ed graph．Aiming at the problem of information loss in the streaming partition of directed graph，puts forward the concept of reverse map—
ping to solve the problem of information loss in partition process，and the result of graph partition is further optimized by reverse mapping．
作者
李茜锦
LI Xi_jin(College of Computer Science，Sichuan University，Chengdu 610065)
关键词
图划分
流
Graph Partition；Streaming
