Project: Building benchmarks for modern graph databases
Description
There exists a wide variety of benchmarks available for graph databases: both synthetic and real-world-based. However, one important problem with current state of the art in graph database benchmarking is that all of the existing benchmarks are inherently based on workloads from relational databases, e.g., subgraph matching which can be achieved by translating a graph query to an equivalent non-recursive SQL.
Graph databases, on the other hand, are supposed to strive in the workloads which solve inherently graph problems: constrained path search, recursive subgraph matching, etc.
A goal of this project is to build a benchmark (both queries and data) which would exploit features and consist of the problems graph databases are designed for: complex navigation over graph substructures.
Details
- Supervisor
-
Nick Yakovets
- Interested?
- Get in contact