Database Indexing (B-Tree) Visualization
Walk through how a B+ tree database index routes point lookups, supports range scans through leaf links, handles page splits, uses the buffer pool, and competes with sequential scans.
Experiment with how fundamental data structures work under the hood — insertions, lookups, splits, scans, and rebalancing behavior.
Walk through how a B+ tree database index routes point lookups, supports range scans through leaf links, handles page splits, uses the buffer pool, and competes with sequential scans.
See how Redis Sorted Sets power real-time leaderboards with O(log N) inserts and O(log N + M) range queries. Watch ZADD, ZRANK, ZRANGE, and ZINCRBY in action.