I'm curious to know what the actual data structure is. Also, it should be noted that "append only b-tree" gives a lot of leeway in how something is actually implemented. That is as easily seen as a family of data structures as it is a specific one. (Not to mention "it uses persistent data structures instead of append-only B tree" is a somewhat silly statement. As append-only B tree is persistent.)
And there is something amusing about using git as an example of how there is no technical argument against losing information. Because, losing information is a specific feature that was added to git. (Look up shallow clones.) I can accept that there is no technical reason to have this, actually. But there are pragmatic reasons to have it. Which is basically the point of this article.
And there is something amusing about using git as an example of how there is no technical argument against losing information. Because, losing information is a specific feature that was added to git. (Look up shallow clones.) I can accept that there is no technical reason to have this, actually. But there are pragmatic reasons to have it. Which is basically the point of this article.