DeepAI AI Chat
Log In Sign Up

Distributed Triangle Counting in the Graphulo Matrix Math Library

by   Dylan Hutchison, et al.

Triangle counting is a key algorithm for large graph analysis. The Graphulo library provides a framework for implementing graph algorithms on the Apache Accumulo distributed database. In this work we adapt two algorithms for counting triangles, one that uses the adjacency matrix and another that also uses the incidence matrix, to the Graphulo library for server-side processing inside Accumulo. Cloud-based experiments show a similar performance profile for these different approaches on the family of power law Graph500 graphs, for which data skew increasingly bottlenecks. These results motivate the design of skew-aware hybrid algorithms that we propose for future work.


page 1

page 2

page 3

page 4


Towards an Objective Metric for the Performance of Exact Triangle Count

The performance of graph algorithms is often measured in terms of the nu...
03/18/2020 Triangle Counting Performance

The rise of graph analytic systems has created a need for new ways to me...

From NoSQL Accumulo to NewSQL Graphulo: Design and Utility of Graph Algorithms inside a BigTable Database

Google BigTable's scale-out design for distributed key-value storage ins...

Breaking the hegemony of the triangle method in clique detection

We consider the fundamental problem of detecting/counting copies of a fi...

A Comparative Study on Exact Triangle Counting Algorithms on the GPU

We implement exact triangle counting in graphs on the GPU using three di...

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. I...

RedisGraph GraphBLAS Enabled Graph Database

RedisGraph is a Redis module developed by Redis Labs to add graph databa...