5 ms·
Lots of statements about performance, with no benchmarks or numbers. If I've learned one thing about performance optimization, it's that what's obviously faster
by twtw 8y ago
Lots of statements about performance, with no benchmarks or numbers. If I've learned one thing about performance optimization, it's that what's obviously faster is frequently slower (unless cache behavior, ILP, etc is obvious to you) - always measure.
I enjoyed the article and applaud the author's work, but I don't feel good about the claim to beat the standard library without discussing the benchmark that indicates this. Insertion pattern matters a lot for this kind of thing.
- loeg 8y agoAVL (and other binary search) trees in general are just a poor choice for most situations given the realities of cache behavior.
- MaxBarraclough 8y agoHence the development of the 'Judy array' - actually a high-arity tree optimised for good cache behaviour - right? See also the 'masstree' which has a similar premise - https://news.ycombinator.com/item?id=18199086 https://news.ycombinator.com/item?id=18199086
- loeg 8y agoI was thinking of classic B-trees, but yeah something with high arity is the right way to go.