CS 527 – Database Systems Interactive

Database Systems
Interactive Visualizer

Step through core database algorithms with live, animated visualizations. Based on CS 527 lecture materials.

Insert, delete, and search in a B+ Tree. Watch nodes split and merge as the tree stays balanced.

Insert Delete Search Node Split Merge

See how a probabilistic bit-array answers set membership queries. Insert elements and trigger false positives.

Bit Array Hash Functions False Positives

Explore linear probing, chained hashing, cuckoo hashing, and extendible hashing with collision visualizations.

Linear Probe Chaining Cuckoo Extendible

Simulate page requests and watch replacement policies (LRU, Clock, LRU-K) decide which frames to evict.

LRU Clock LRU-K Eviction

Join Algorithms

Visualize Nested Loop Join, Sort-Merge Join, and Hash Join operating on two relations.

Nested Loop Sort-Merge Hash Join I/O Cost

Step through the two-pass external merge sort algorithm when data doesn't fit in memory.

Merge Sort Runs Buffer Pages

Simulate transactions acquiring and releasing locks. See deadlocks form and how 2PL ensures serializability.

S-Lock X-Lock Deadlock Waits-For