I think this might be the most comprehensive and brilliant breakdown of SST I've read till now, especially the way things tie down to how memory access works internally.
Interesting point thanks for the comment! I hadn't previously considered the effect of prefix compression on bloom filter FPRs. I know that in theory it might cause some issues with higher collision rates with the hash functions but I feel like a good enough hash function should be able to handle this gracefully enough. Have you had experience in production where this is a problem?
I think this might be the most comprehensive and brilliant breakdown of SST I've read till now, especially the way things tie down to how memory access works internally.
Thanks a lot for writing this.
Great article! Curious: how do you make your diagrams?
Thanks! I use https://monodraw.helftone.com/ - it's one of my favorite tools.
Interesting point thanks for the comment! I hadn't previously considered the effect of prefix compression on bloom filter FPRs. I know that in theory it might cause some issues with higher collision rates with the hash functions but I feel like a good enough hash function should be able to handle this gracefully enough. Have you had experience in production where this is a problem?