News for hackers. Stuff that matters.
Re:Static search trees: 40x faster than binary search by natmaka on Wednesday January 01, 2025 @01:01AM (#42564253)
It enhances the throughput (on average everyone waits less) at the price of a higher max latency (some, who posted a request mobilizing a very-recently-out-of-cache-index, will wait way, way more...), isn't it? In the real world those worst cases quite often kill such optimization.

The (data size / cache size) ratio and queries local (in time) dispersion are key.

Re:Static search trees: 40x faster than binary search by Bulat_Ziganshin on Friday January 03, 2025 @09:49AM (#42586079)
higher throughput means we can serve more people, not that anyone will be served faster. it's like a multi-lane highway
Re:Static search trees: 40x faster than binary search by natmaka on Saturday January 04, 2025 @11:30PM (#42599778)
Indeed, my point was about "faster" (in the title).