Re: [boost] Interest in B-tree library for Boost?

On Wed, Sep 15, 2010 at 2:23 PM, Giorgio Zoppi <giorgio.zoppi@gmail.com> wrote:

It would be interesting see how in this case could work skip-lists in term of time and concurrency.

Disk-based skip lists where you keep the top N levels of skips in memory work well. Or at least did 15-20 years ago. It's been a while. Tony