News for hackers. Stuff that matters.
Re:Btrees are the new black by joe_the_user on Wednesday April 02, 2014 @03:31AM (#7514099)
Well,

If the hype is to be believed, Cache-oblivious b-trees are an even better match for today's hierarchical memory systems.

Unfortunately, I don't know any simple free/open-source implementation of these.

But here is a "home page" for them: http://supertech.csail.mit.edu/cacheObliviousBTree.html

Re:Btrees are the new black by JulienSchmidt on Wednesday April 02, 2014 @05:32AM (#7514406)
There are even better fits for modern CPU architectures and hierarchical memory systems (but not on HDDs) than B-Tree based structures, like the adaptive radix tree: http://wwwkemper.informatik.tu-muenchen.de/~leis/papers/ART....

I think B-Trees are mostly important for educational purposes, since this is a very important general way of organizing data. For real world usage, there are hundreds of different structures optimized for different use cases.

Re:Btrees are the new black by justin66 on Wednesday April 02, 2014 @10:24PM (#7520526)
Do you know of any examples of good open source projects using the ART?