Repository for the prototype source code of the paper Time- and Space-Efficient Regular Path Queries on Graphs. This is just a prototype version aiming at reproducing the experiments of the paper. A final version will be added soon.
The queries are available in data/paths.tsv of this repository.
The data used are available here: Wikidata (about 1000M triples).
To run our code, please install an extended version of the library SDSL. Go to this this repository and follow the instructions.
After the extended version of SDSL is installed, clone this repository and follow these steps:
- Compile the source code by first moving to the directory that contains the code, and then execute:
bash build.shThis shall create two executable files: build-index and query-index.
-
Download the version of Wikidata used in the paper (note the original triples have been enumerated): Wikidata (about 1000M triples) and uncompress it.
-
To build the index run:
./build-index <path-to-wikidata-file> This will create the index on the same directory were the wikidata file is. Keep all these files in the same directory.
-
Move files data/wikidata-enumerated.dat.P and data/wikidata-enumerated.dat.SO to the directory were the index is stored. Please keep these file names, or change them acordingly, keeping the same prefix for all of them.
-
To run queries, do as follows:
./query-index <path-to-index-file> data/paths.tsv