Hacker News new | ask | show | jobs
by br1 5524 days ago
Read "Cache-Oblivious Streaming B-trees" http://supertech.csail.mit.edu/cacheObliviousBTree.html It' LSM with faster searches.
1 comments
psaccounts 5524 days ago
Thanks for the pointer. Are there any known open-source implementations of the same?
link
br1 5523 days ago
Not that I know of. Also, they have a patent, but that didn't stop Acunu from reimplementing and improving the algorithm.
link