From Skiplists to B+ Trees: Making Valkey Sorted Sets More Memory Efficient
0 comments · compsci, databases, performance
- Comments0
0 comments · compsci, databases, performance
Story details from Lobsters ↗ · linked article on valkey.io.
From Skiplists to B+ Trees: Making Valkey Sorted Sets More Memory Efficient was first seen on Lobsters · Hottest on Nov 21, 2026. Since then it has appeared in 48 checks on 2 different days. Its best position was #16 of 25, reached on Nov 21, 04:52 UTC. It dropped off the list after Nov 22, 14:22 UTC. The same link also trended on Hacker News, which raises its cross-platform score.
Position on Lobsters · Hottest at every check (lower is better).
Best rank per day (UTC).
Platform metric as reported by Lobsters.
| List | Best | Days | Checks | Last seen |
|---|---|---|---|---|
| Lobsters · Hottest | #16 | 2 | 48 | |
| YHacker News · Front page Valkey kills the skiplist, cuts sorted set overhead by up to 43% | same link | |||
Archived daily, weekly and monthly lists that include this entry.
Not at the moment. It was last on the list on Nov 22, 14:22 UTC, after 2 days of trending.
#16 on Lobsters · Hottest, on Nov 21, 04:52 UTC. Trendoday checks this list every 30 minutes.
It was first seen on Nov 21, 2026 and has been on the list on 2 days (48 checks) since.