For par condicio: I worked at a similar optimization for Redis using different techniques (when I submitted the PR my colleagues informed me that ValKey and another Redis team was working at it, I was not aware: the amoung the three implementation we picked mine after extensive benchmarks) reaching memory savings that sometimes can be tens of percentage of less RAM compared to this ValKey optimization. So if you are exited for less memory for sorted Sets you should try both the implementations. We also got a lot more speed in many use cases compared to the skiplist.
I have to say I was always on the fence about Bill Pugh (Mr Skiplist).<p>Some of his concurrency ideas were pretty good but Skip Lists were about the same time I was realizing that theoretical and practical design for performance had diverged and skip lists were a huge cache miss liability.<p>It didn't hurt that a few people I was aware had tried them had gone back to something else due to live performance analysis being negative or inconclusive (If you can't prove one thing is better than the other, you use the simpler one, and skiplists are not simple)
If cache misses are a huge concern and we have a highly skewed distribution (mostly touching newer records), the splay tree starts to look interesting.<p>We don't like the O(n) worst case, but we really like that magical amortization property. There are some simple ways to avoid getting into a linear hot path.
B+tree were designed around optimized IO in the era of magnetic storage, they're inherently cache-friendly. Skiplists are the same thing as a b+tree but the structure is inverted, which makes skiplists more to concurrent writer-friendly than b+trees. Different tradeoffs.
The data structure is not a pure B+tree. They also strip common key prefix for node elements and store 4 bytes of remaining key data together with a pointer to the children to avoid key lookup in many cases. Plus they tune node sizes to match jemalloc allocation classes to minimize allocation overhead. I am not sure with such focus on cache friendliness the advantage of skip lists for writes still holds as they will still have more cache misses even on inserts.
But more cache misses, due to the variable pointer length structure.<p>That cost varies from chip generation to generation, but it does seem to be the case that b trees win in more generations than they lose.
Yep. I’ve implemented b trees and skip lists a few times. I find skip lists to be a little easier to implement. But b trees seem to perform ~20% faster. I can’t think of any good reasons to use skip lists instead of b trees in high performance code.
Tangentially related, the PR sections for the final PR in this feature is quite nice[0].<p>There is a reviewing guide with suggested reading order, clear design decisions, and scope boundaries for what is intentionally not included.<p>This is the type of thing LLMs are very good at and high ROI for human reviewers.<p>[0]: <a href="https://github.com/valkey-io/valkey/pull/4206" rel="nofollow">https://github.com/valkey-io/valkey/pull/4206</a>
This is the standard LLM wall of irrelevant garbage that always makes me groan when I see it. There's a lot of words but it conveys very little useful information. This is exactly the type of thing that LLMs are terrible at and has negative ROI for human reviewers.
This is an LLM smell and, after having dealt with this sort of thing and realizing it’s usually low-signal high-noise, you end up ignoring this kind of thing outright.
I prefer to go straight to the code when reviewing. I’ll form my own opinion, then read the PR description, then do another, more detailed pass through the code.
The snr of that file is very very low.
You really think that LLMs are “very good” at producing useful PR descriptions? I have had a very different experience.
OMG, I <i>hate</i> the LLM PR descriptions, the comments, the docstrings - anything to be read by a human that isn't code.
The code isn't really much better, having reviewed a decent bit of it myself.
Have you read the code though?
[dead]
I've long since moved to the MultiQueue algorithm for CPQs, seems like SkipList has vanishingly few use cases now...
Is valkey the recommended redis alternative these days ?
Like all things, it depends. If you don't need the latest and greatest features in upstream redis, and you don't want license headaches, Valkey is probably a good default. It's generally cheaper on hosting providers too - AWS will discount you ~20-35% for Valkey vs Redis.
I haven't checked the newest additions, there were some updates about adding login and encryption, but the latest innovation I use from redis is xstream, and almost all clones now support it.<p>And a moderate LLM subscription can readily generate a useful portion of this project overnight, which makes me concerned about their profitability in the long run.
DragonflyDB has had this for years. You might disagree with the licensing choice but the technology is just better IMO.<p>(Disclosure, worked for them 3 years ago for a few months)
Yes
> Every node carries a backward pointer<p>Curious. Skiplists don't need back pointers. You can traverse a skiplist backward almost as fast as forward if you keep the "finger" around. The finger is the set of nodes from level-n down to level-0 that point as close to the goal node as possible without going beyond it. The ideal place to keep these nodes is on the stack. To traverse backwards, you do a conventional search for the starting node but every time you go down a pointer level, you push the last pointer on the stack first. Then back traversal becomes stack pops together with appropriate forward recursive calls when you pop back to a pointer that was too far to the left.<p>It's easier to convey the idea with code than english but I'm not typing the algorithm with my thumbs into my phone.
Do they provide their benchmark code?
Redis historically used a skiplist to keep a sorted index. Valkey showed its inefficient and slow on modern hardware, migrating to a B+ tree instead.
It all ends up back at B trees. Why does it always end up back at B trees?<p>At this point have we optimized hardware to assume B trees in a sort of self-fulfilling prophesy?
B trees are more friendly to being cache oblivious
Binary trees have worse cache locality. The cost of accessing memory has grown so much compared to computation that supposedly slower "heavy weight" data structures are worth it now (as in the last 10-20 years).
Yes, that hardware is called "the memory cache". B-trees were invented because disk reads were very expensive. Now, memory cache fills are very expensive.
Is this AI? Why do we need a summary of the actual article in a comment?
From what I've seen on here many commenters didn't read the article, only the title (I've been guilty of this too). OP is maybe just adapting to HN culture.
The actual article is AI too so this is just saving you time.
<a href="https://github.com/valkey-io/valkey-io.github.io/pull/665/commits" rel="nofollow">https://github.com/valkey-io/valkey-io.github.io/pull/665/co...</a><p>The PR for the article. I'm not convinced it's AI, but I didn't do a deep dive on the commit tree just poked around a bit.
Thanks Bill Pugh for skiplists, worked great for so long. Go terps. <a href="https://dl.acm.org/doi/10.1145/78973.78977" rel="nofollow">https://dl.acm.org/doi/10.1145/78973.78977</a>
- valkey vs redis vs dragonfly 2027?
As a coding exercise I implemented a redis that utilized skiplists. I was excited to read this article. Turns out it's ai slop. Seriously people, stop it. This hurts to read.
[flagged]
[flagged]
[flagged]
[flagged]