3 ms·
I'm confuse. From my understanding of B-Tree, B-Tree are good when you load data from hard drive. It allow to minimize the number of time you load a range of da
by olivier1664 14y ago
I'm confuse. From my understanding of B-Tree, B-Tree are good when you load data from hard drive. It allow to minimize the number of time you load a range of data from the hard drive.
Since C++B-Tree is in RAM, and thus the data loading should be less important, how does it appears to have a so good benchmark? What is the secret ingredient?
- alexgartrell 14y agoIf I had to guess, I'd say better cache locality. It's tremendously more expensive to go to main memory for something than to go to the cache.