Bullshit graph database performance benchmarks
I am really stunned by this story. It made me check the MemGraph benchmarks section. Don&#x27;t get me wrong, it may be 10-100x faster than Neo4J in even the most basic operations. Moreover, given the quality of Neo4J, it is hard not to be that much quicker. Even Postgres and MySQL are better at storing graphs than Neo4J.<p>---<p>Disclosure: I have worked on Graph Algorithms, Graph Databases, and Database Engines for years, and we are now preparing a commercial solution based on UKV [1]. I don&#x27;t know anyone at MemGraph or Neo4J. Never used the first. As for the second, I am not a fan.<p>---<p>Aside from licensing, there are 3 primary complaints. I will address them individually, and I am open to a discussion.<p>A. Using Python for Benchmarks instead of Gatling. I don&#x27;t entirely agree with this. Python still has the fastest-growing programming community while already being one of the 2 most popular languages. Gatling, however, never heard of it. Choosing between the two, I would pick Python. But neither works if you want to design a High-Performance benchmark for a fast system. Without automatic memory management and expensive runtimes, you can only implement those in C, C++, Rust, or another systems-programming language. We have faced that too many times that the benchmark itself works worse than the system it is trying to evaluate [2].<p>B. Using hardware from 2010 [3], weird datasets [4]. This shocked me. When I looked at the charts [5] and the benchmarking section, it seemed highly professional and good-looking. I wouldn&#x27;t expect less from a startup with $20M VC funding. But the devil is in the details. I would have never expected anyone benchmarking a new DBMS to use now 13-year-old CPUs and an unknown dataset. Assuming current developer salaries, hiring people to design a DBMS doesn&#x27;t make sense if you will be evaluating on a $1000 machine is just financially irresponsible. We buy expensive servers, they cost like sports cars or even apartments in poorer countries. It is hard to maintain, but they are essential to quality work. It is sad to see companies taking such shortcuts. But to be a devil&#x27;s advocate, there is no 1 graph benchmark or dataset that everyone agrees on. So I imagine people experimenting with multiple real datasets of different sizes or generating them systemically using one of the Random Generator algorithms. In UKV, we have used Twitter data to construct both document and graph collections. In the past, we have also used `ci-patent`,  `bio-mouse-gene`, `human-Jung2015-M87102575`, and hundreds of other public datasets from the Network Repository and SNAP [6]. There are datasets of every shape and size, reaching around 1 Billion edges, in case someone is searching for data. For us the next step is the reconstruction of the Web from the 300 TB CommonCrawl dataset [7]. There is no such Graph benchmark in existence, but it is the biggest public dataset we could find.<p>C. Running query different number of times for various engines. This can be justified, and it is how current benchmarks are done. You are tracking not just the mean execution time but also variability, so if at some point results converge, you abrupt before hitting the expected iterations number to save time.<p>---<p>LDBC [8] seems like a good contestant for a potential industry standard, but it needs to be completed. Its &quot;Business Intelligence workload&quot; and &quot;Interactive workload&quot; categories exclude any real &quot;Graph Analytics&quot;. Running an All-Pairs-Shortest-Paths algorithm on a large external memory graph could have been a much more interesting integrated benchmark. Similarly, one can make large-scale community detection or personalized recommendations based on Graphs and evaluate the overall cost&#x2F;performance. It, however, poses another big challenge. Almost all algorithm implementations for those problems are vertex-centric. They scale poorly with large sparse graphs that demand edge-centric algorithms, so a new implementation has to be written from scratch. We will try to allocate more resources towards that in 2023 and invite anyone curious to join.<p>---<p>[1] <a href="https:&#x2F;&#x2F;github.com&#x2F;unum-cloud&#x2F;ukv">https:&#x2F;&#x2F;github.com&#x2F;unum-cloud&#x2F;ukv</a>
[2] <a href="https:&#x2F;&#x2F;unum.cloud&#x2F;post&#x2F;2022-03-22-ucsb" rel="nofollow">https:&#x2F;&#x2F;unum.cloud&#x2F;post&#x2F;2022-03-22-ucsb</a>
[3] <a href="https:&#x2F;&#x2F;github.com&#x2F;memgraph&#x2F;memgraph&#x2F;tree&#x2F;master&#x2F;tests&#x2F;mgbench#intel---hp">https:&#x2F;&#x2F;github.com&#x2F;memgraph&#x2F;memgraph&#x2F;tree&#x2F;master&#x2F;tests&#x2F;mgben...</a>
[4] <a href="https:&#x2F;&#x2F;github.com&#x2F;memgraph&#x2F;memgraph&#x2F;tree&#x2F;master&#x2F;tests&#x2F;mgbench#pokec">https:&#x2F;&#x2F;github.com&#x2F;memgraph&#x2F;memgraph&#x2F;tree&#x2F;master&#x2F;tests&#x2F;mgben...</a>
[5] <a href="https:&#x2F;&#x2F;memgraph.com&#x2F;benchgraph&#x2F;base" rel="nofollow">https:&#x2F;&#x2F;memgraph.com&#x2F;benchgraph&#x2F;base</a>
[6] <a href="https:&#x2F;&#x2F;snap.stanford.edu&#x2F;data" rel="nofollow">https:&#x2F;&#x2F;snap.stanford.edu&#x2F;data</a>
[7] <a href="https:&#x2F;&#x2F;commoncrawl.org" rel="nofollow">https:&#x2F;&#x2F;commoncrawl.org</a>
[8] <a href="https:&#x2F;&#x2F;ldbcouncil.org&#x2F;benchmarks&#x2F;snb" rel="nofollow">https:&#x2F;&#x2F;ldbcouncil.org&#x2F;benchmarks&#x2F;snb</a>