When implementing a distributed runtime there will be cases where having an append only log will be beneficial to store a log of events.
This storage should allow Append which appends to the most right page in the tree. It should also be able to do compaction where it removes entries from the most left page. Finally it should be possible to search the tree based on key.
When implementing a distributed runtime there will be cases where having an append only log will be beneficial to store a log of events.
This storage should allow Append which appends to the most right page in the tree. It should also be able to do compaction where it removes entries from the most left page. Finally it should be possible to search the tree based on key.