Bit Vector

A bit vectorA bit vector is a very simple array or list data structure. Each cell of the array contains a bit (either 0 or 1)…. is a very simple array or list data structure. Each cell of the array

Posted in

Bloom Filters

So, basically, a Bloom Filter is a quick little check to see whether an item is in a set. Scratch that — it is a quick little check to see whether an item is definitely not in a set. Imagine

Posted in

Hashing: Collision Function

A collision functionA collision function exists within the context of hashing and hash tables. Collision functions determine how to handle situations when the array underlying the hash table already has another datapoint in the slot chosen by the hash function.

Posted in

Hashing: Hash Function

A hash functionA hash function exists within the context of hashing and hash tables. Data to be stored in hash tables includes a unique attribute (id number, username, etc.). Hash functions take the unique attribute and translate it into a

Posted in

Hashing: Hash Index

A hash indexA hash index is an index into the underlying array that supports a hash table. A hash index is determined by a hash function…. is an index into the underlying array that supports a hash tableA hash table

Posted in

Hashing: Hash Table

A hash tableA hash table (sometimes also called a hash map) is a data structure that is useful in situations when: you need very quick insertion and retrieval, you very rarely need to iterate over all your items, you don’t

Posted in