Distributed versions of these are essential features of P2P and BitTorrent services.
The Rabin-Karp algorithm, useful for detecting plagiarism, employs a function of this data structure to increase the efficiency of string matching from quadratic to linear time. One issue associated with these structures occurs where changing a single bit can have disproportionately large changes in output known as the avalanche effect. Algorithms that are used to resolve common events associated with these structures include quadratic probing, separate chaining and Robin Hood; those events, called collisions, occur when two data elements are set to the same value. Distributed versions of these are essential features of P2P and BitTorrent services. For 10 points name this data structure that has an array, keys and an associated mapping function useful in improving the efficiencies of lookups and searches.
The Rabin-Karp algorithm, useful for detecting plagiarism, employs a function of this data structure to increase the efficiency of string matching from quadratic to linear time.
{hash table} [prompt on hash]