If you belive Wikipedia https://en.wikipedia.org/wiki/Atomic_radius then the atomic radius of Helium has never been measured, but it is predicted to be smaller than Hydrogen.
Metadata operations on partitions can be very fast. One simple example is date based housekeeping. Deleting a month of data will be quite intensive on most databases, whereby dropping a partition from the table is effectively instant.
Partion switching is also fast. Say you have a summary table that is rolled up by month, but you want to recalculate the summaries every so often. You can build a month into a new table and then switch the new table for a partition in the summary table.
Firstly there are vastly more positions in Go.
Secondly, it's very hard to evaluate a Go position, especially at the start of the game when there are few stones on the board. In chess you can get a long way using a simple evaluation (K=99, Q=9, R=5, B=3, N=3, P=1).
For a lot of RDBMS, transaction semantics can be later with different transaction isolation levels. There levels like repeatable read which work in this way, but the default level is usually weaker.
Funnily enough if you buy Tesco's electrical goods online and pick up at store you don't get a paper receipt. The security guard (through lack of training) wasn't keen on letting me out without one.
I had a go at something similar for the Facebook version a couple of years ago. My main goal was to stop playing the game, but it was also an excuse to try Clojure. At the time it absolutely thrashed my best scores, though I'm sure it won't work with the updates the developers have made since then.
I think it was the first thing I wrote that drove home the power of having a REPL for exploratory programming: