awmarthur
Joined 6 years ago
Karma
66
Submissions
26
Member since
Feb 3
Recent submissions
Comment · 3 years ago
Comment · 4 years ago
related and useful: "Ribbon filter: Practically smaller than Bloom and Xor" (https://arxiv.org/abs/2103.02515)
This paper does a good job of showing the space/time tradeoffs of various approximate sets.
Comment · 4 years ago
That sounds somewhat similar to Dolt's storage index structure: Prolly Trees
https://www.dolthub.com/blog/2020-04-01-how-dolt-stores-tabl...
The reference to Tries came from the original issue in the Golang repo about possible uses for a standard library hash function: https://github.com/golang/go/issues/21195
And you're right, the Trie implementation linked there was indeed a Hash-Array Mapped Tried: https://pkg.go.dev/github.com/lleo/go-hamt-key#Key