search
B+tree
Trends
- 1Valkey replaces skiplist with B+tree for sorted sets●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.
Repos
- N1nEmAn/sapper-v2 The first fruit of the Nüwa tree — an autonomous AI pentest legion (634-team champion, 8h unattended, 1B tokens beat 4.5