A graph is a mathematical object. It has well defined properties, such as 'degree', 'radius', etc. Just as in e.g. relational domain you can propose well defin

A graph is a mathematical object. It has well defined properties, such as 'degree', 'radius', etc. Just as in e.g. relational domain you can propose well defined operations (such as join two relations based on a common foreign key) and devise benchmarks for these operations, it should be possible to do the same precise thing for graph databases. For a graph database, you would want (a) ingress, (b) comps, and (c) recovery benchmarks. The (b) comps per above can be based on a set of common patterns of queries applied to a parametric graph spec. > In fairness, graph workload performance, compared to other types of workloads, is unusually sensitive to a diverse set of details that are rarely captured adequately by researchers. That reads: we don't understand graphs.