Yhn SportSports first seen 1 d ago, last 7 min ago, peak #2
Valkey replaces skiplist with B+tree for sorted sets
Original: Valkey kills the skiplist, cuts sorted set overhead by up to 43%
Valkey, the open-source fork of Redis, has replaced the skiplist data structure with a B+tree for sorted sets, cutting per-element memory overhead by up to 43%. The change, detailed on the project's blog, aims to reduce the long-standing memory cost of sorted sets, one of the database's core data types. Developers are discussing the trade-offs and benchmark results of the rewrite.
Why now: The release of a major internal data-structure change with significant memory savings has drawn attention from the database and infrastructure community
Rank over time, top of the chart is #1. 92 snapshots from 1 d ago to 7 min ago.
Evidence
- Valkey kills the skiplist, cuts sorted set overhead by up to 43% · reconditerose · 199
API: https://socialmediatrends-api.osmike.com/v1/trends/6934402