wheatman / dhb

Dynamic Hashed Blocks (DHB) data structure for dynamic graphs

DHB

This is the repository of the Dynamic Hashed Blocks (DHB) format.

Authors

Name	E-Mail	Affiliation
Alexander van der Grinten	[email protected]	HU Berlin
Maria Predari	[email protected]	HU Berlin
Florian Willich	[email protected]	HU Berlin

Publications

For a detailed discussion of DHB and a comparison with other graph data structures please read the paper A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks (2022) available on the Dagstuhl Research Online Publication Server (DROPS).

Build Library

Build the library using CMake (e.g., with the generator Ninja).

mkdir build
cd build
cmake -GNinja -DCMAKE_BUILD_TYPE=Release ..
ninja

Build Tests

You must clone this repository recursively in order to obtain catch2 which is necessary for our test environment using:

git clone --recursive https://github.com/hu-macsy/dhb.git

If you forgot to clone recursive, simply update with initialisation:

git submodule update --init --recursive

You can then build the tests by setting the CMake option DHB_TEST to On.

cmake -GNinja -DCMAKE_BUILD_TYPE=Release -DDHB_TEST=On ..
ninja

Benchmarks and Experimental Evaluation

An evaluation of DHB and other dynamic graph data structures can be found at: https://github.com/hu-macsy/dhb-experiments