An Association-Oriented Partitioning Approach for Streaming Graph Query

Abstract EN

The volumes of real-world graphs like knowledge graph are increasing rapidly, which makes streaming graph processing a hot research area.

Processing graphs in streaming setting poses significant challenges from different perspectives, among which graph partitioning method plays a key role.

Regarding graph query, a well-designed partitioning method is essential for achieving better performance.

Existing offline graph partitioning methods often require full knowledge of the graph, which is not possible during streaming graph processing.

In order to handle this problem, we propose an association-oriented streaming graph partitioning method named Assc.

This approach first computes the rank values of vertices with a hybrid approximate PageRank algorithm.

After splitting these vertices with an adapted variant affinity propagation algorithm, the process order on vertices in the sliding window can be determined.

Finally, according to the level of these vertices and their association, the partition where the vertices should be distributed is decided.

We compare its performance with a set of streaming graph partition methods and METIS, a widely adopted offline approach.

The results show that our solution can partition graphs with hundreds of millions of vertices in streaming setting on a large collection of graph datasets and our approach outperforms other graph partitioning methods.