6 comments

[ 2.6 ms ] story [ 27.7 ms ] thread
This is my account of how we took the idea of succinct data structures, and added mutability, thereby getting something which allows for git-like functionality, but also fast query and compact memory footprint.
In the third example box of the "Immutable Updates" section, I believe the text '(joe,dob,"Joe Bob") ===> Answer' should be changed to '(joe,dob,"1978-01-01") ===> Answer'.
How good is the overall speed?
Quite speedy, especially when looking at relatively long chains in the graph.