d3.js algorithm visualizations

Data visualizations done under the Human-Data Interaction Lab in NYU Abu Dhabi. I was responsible for building algorithm visualizations of some algorithms commonly used in a Computer Science course called Database Management Systems.

Those algorithms were made to help students understand algorithms by visualizing them and providing an interactive way of playing with the parameters of the algorithm.

Below are demos of some of the algorithms that I've built using D3.js. Please note that those algorithms were not built for this site or mobile in mind. There may be some problems with your experience of the demo and I apologize in advance if it does not work as well as it should.

Bloom Filters

A "space-efficient probabilistic data structure". False positive matches are possible. However, false negatives are not, so it provides an efficient way of testing whether an element exists in a set. Allows for searching and insertion in O(n) time in O(m) space.

Linear Hashing

Extendible Hashing