string-dictionary

String dictionary implementations for RDF databases

bin/              Helper scripts and compiled executables
boost/            boost library source code
btree/            cpp-btree library source code
b+tree/           stx-btree library source code
data/             Sample data
gmock/            googlemock library source code
gtest/            googletest library source code
hat/              HAT source code
libart/           libart library source code
obj/              Build output
src/              Main source directory
test/             Unit tests

Quickstart

1. Execute make release to compile the source code.
2. Execute ./bin/fetch-yago.sh to download Yago Facts sample data to data/yagoFacts.ttl.
3. Run bin/perftest data/yagoFacts.ttl to execute performance tests for different string dictionary implementations.

To execute the unit tests, run make test.

Requirements

Tested on Arch Linux x64 with Clang 3.3 and GCC 4.8.1. Windows is not supported, though other platforms might work. For the helper scripts, the following programs are used: bash, 7z, and wget or curl.

License notices

Contains modified code from: Adaptive Radix Tree by Viktor Leis and RDF-3X by Thomas Neumann.

Also uses source code of cpp-btree (license terms), stx-btree (license terms), libart (license terms), HAT (license terms), and Boost (license terms).

Includes source code of googletest (license terms) and googlemock (license terms) for the unit tests.