This is a repository with utils that can be used to reproduce experiments described in Single-Source Regular Path Querying in Terms of Linear Algebra paper. The paper is about evaluating graph Regular Path Queries using linear algebra over sparse adjacency matrices implemented using SuiteSparse:GraphBLAS.
Currently, we use the following datasets for the experiments information on which is available within the Datasets directory.
- Wikidata snapshot from MillenniumDB path-query-challenge this is a snapshot of a real-world Wikidata graph and 660 queries taken from the query log.
- Yago-2S knowledge base is a large knowledge base evaluated with 7 complex RPQ queries taken from academic papers.
For running the experiments in a specific environment refer to Databases folder with information on evaluating the experiments. These are the competitors.
- rpq-matrix is another linear algebra-based algorithm for evaluating RPQs using their own implementation of sparse matrices.
- MillenniumDB is a graph database demonstrating state-of-the-art performance among other competitors and that might cache the data to execute queries out of the RAM.
- FalkorDB (ex. RedisGraph) is an in-memory graph database employing SuiteSparse:GraphBLAS sparse matrix approaches for query evaluation.
- Memgraph is quite advanced in-memory graph database.
- Semyon Grigorev (mail: [email protected]).
- Georgiy Belyanin (mail: [email protected]).