←back to thread

Relaxed Radix Balanced Trees (2024)

(peter.horne-khan.com)
186 points jasonjmcghee | 1 comments | 19 Feb 25 16:05 UTC | HN request time: 0s | source
Show context
rtheunissen ◴[19 Feb 25 20:57 UTC] No.43107563[source]▶
I would love to add a good RRB implementation to the persistent benchmarks at [1] to get a state-of-the-art comparison between RRB and BST in a persistent context. Duration, of course, but also number of bytes copied etc.

https://rtheunissen.github.io/bst

replies(3): >>43107846 #>>43108214 #>>43108884 #
reitzensteinm ◴[19 Feb 25 21:51 UTC] No.43108214[source]▶
This guide is absolutely fantastic, thank you! You should post it if it hasn't been.
replies(1): >>43109063 #
1. jasonjmcghee ◴[19 Feb 25 23:21 UTC] No.43109063[source]▶
It has, and a pretty good discussion: https://news.ycombinator.com/item?id=37130200