3 ms·
They’re ordered, so - in-order iteration over the items is possible - Searches such as “the smallest item greater than n” are efficient
by Someone 5y ago
They’re ordered, so
- in-order iteration over the items is possible
- Searches such as “the smallest item greater than n” are efficient
- avinassh 5y agoWhat about cache locality which is offered by B Trees
- ignoramous 5y agoRead the memSQL blog I linked to; it talks about why not B-Trees for their workloads. It also points out that the concurrent and lock-free nature of Skip Lists was overall a win, despite cache-locality (and other such) concerns. Though, if one can tame allocs (ref: https://archive.is/kwhnG https://archive.is/kwhnG), then they may have cache-locality (just don't expect it to be at Judy Array levels).