Hacker News new | ask | show | jobs
B+ Tree Visualization (cs.usfca.edu)
137 points by hamid914 557 days ago
5 comments

From what I can tell these two are a little more polished than the main linked one, including features to add random values and trace lookups/range finding through the nodes checked.
I beg of devs, use this (or others as another comment mentioned) to visualize what the poor RDBMS has to deal with when you use non-k-sortable PKs.
UUID was a mistake :-)
I would love an "insert random", or a prefilled / demo mode, or demo set of keys for interesting examples.
Kind of wish you could drop a list in there, and have it step through.
Hasnt this been around for a while now?