Home

Welcome to the project wiki!

This is the C++ implementation of the GraphAPI project that implements various representations of the graphs (Adjacency List, CSR etc.) and uses the WiredTiger KV store as the storage engine. We implement the graph representations, and the benchmark code to measure the performance of these systems.

Prerequisites:

• The project uses WiredTiger v3.2.1. WiredTiger is configured as a git submodule for this project. Running cmake should initialize the submodule, and run autoconf on it.

• This project (partly, as of now) uses google-test for testing. It is configured using cmake.

Building the project:

• After cloning this repository we must configure the project. To do that, run the following from the top level directory :

 mkdir build
 cd build
 cmake ..

Once this is done, you should have wiredtiger configured, installed, and ready to use in libs/wiredtiger

• To run the tests, go to build/test and run make
• It is possible that you would want to run some simple experiments with the GraphAPI code, unimpeded by google-test. In order to do so, add your test code to src/ and use the Makefile present there.