2 ms·
Tangentially, graph platforms have long had the issue that performance claims are astonishingly unreliable and come with so many caveats and qualifications (doc
by jandrewrogers 9y ago
Tangentially, graph platforms have long had the issue that performance claims are astonishingly unreliable and come with so many caveats and qualifications (documented or not) that the claims don't generalize usefully in practice. One of the reasons I got out of the graph database business was the pervasive lack of rigor and repeatability when it comes to measuring scalability and performance across platforms; there is a cost asymmetry to properly addressing the volume of questionable performance measurements made in the graph database world.
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. As often as not, you are actually measuring things unrelated to the graph algorithm itself. Measuring graph databases properly would require a level of specification for how to measure such things that hasn't happened yet. And many people like it that way, it makes it relatively easy to contrive details that make your particular algorithm or implementation look good despite the reality that serious weaknesses are pervasive across graph database platforms. A generally, objectively strong graph database platform doesn't exist AFAIK -- they all kind of suck in unique ways.
- eternalban 9y agoA 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.