Hacker News new | ask | show | jobs
by Genbox 602 days ago
Do you have any regrets about an algorithm/data structure and wish you picked something else?
1 comments

Absolutely not. I love log structured merge trees and I worked on the algorithms for weeks and I'm fairly confident and happy with them.
To add to this, I've played around with implementing many more disk based data structures such as BTree, BTree B+Tree, etc and LSM tree is the easiest to work with, optimize, etc. The write speed also is much greater than the b tree and its varients which I like. I will continue to do research on them all as I normally do :P
I don't know why star doesn't show above but BTree, BStarTree, BStarPlus tree I meant not "BTree, BTree B+Tree"