4 ms·
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
by joe_the_user 13y ago
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 http://supertech.csail.mit.edu/cacheObliviousBTree.html
- deleted 13y ago[deleted]
- JulienSchmidt 13y agoThere 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.pdf 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.
- justin66 13y agoDo you know of any examples of good open source projects using the ART?