Despite the increasing interest in graph databases their requirements and specifications are not yet fully understood by everyone, leading to a great deal of variation in the supported functionalities and the achieved performances.
We provide a comprehensive study of the existing graph database systems.
We introduce a novel micro-benchmarking framework that provides insights on their performance that go beyond what macro-benchmarks can offer.
We have identified and included in our framework the largest set of queries and operators, we have evaluated the systems on both synthetic and real data, from different domains, and at much larger scales of any previous work.
We materialized our evaluation framework in an open-source suite that can be easily extended with new datasets, systems, or queries.