Earlier quoted context omitted.
Yes. I suppose that probability to get such bad random distribution which makes SL search to be linear is similar to probability of moving all oxygen atoms to only one side of your room.
Even against an adversary? (Asking because I don't know the data structure too well.)
Iowow – C11 skiplist-based persistent key/value storage engine
11–14 of 14 posts
Re: Iowow – C11 skiplist-based persistent key/value storage engine
#12unrelated: I need a key-value storage engine/data structure that is suitable to use on a microcontroller, with sdcard as the storage medium. Performance isn't critical (within reason of course), but must need very little ram (10s-100s of bytes, at the high end), and of course must minimize/optimize sdcard writes and reads. Any suggestions?
Re: Iowow – C11 skiplist-based persistent key/value storage engine
#13unrelated: I need a key-value storage engine/data structure that is suitable to use on a microcontroller, with sdcard as the storage medium. Performance isn't critical (within reason of course), but must need very little ram (10s-100s of bytes, at the high end), and of course must minimize/optimize sdcard writes and reads. Any suggestions?
Re: Iowow – C11 skiplist-based persistent key/value storage engine
#14https://github.com/cyrusimap/cyrus-imapd/blob/master/lib/cyr...
https://github.com/cyrusimap/cyrus-imapd/blob/master/lib/cyr...
They take slightly different tradeoffs. I wrote twoskip to work around a handful of issues with skiplist around crash recovery. The big cost still is repack speed, which is why I have a project to build something called zeroskip, which won't be single-file, but will have some very nice never-rewrite behaviour.
http://opera.brong.fastmail.fm/talks/twoskip/twoskip-yapc12.... describes the design of twoskip a bit.