New method accelerates data retrieval in huge databases

Hashing is a core operation in most online databases, like a library catalogue or an e-commerce website. A hash function generates codes that directly determine the location where data would be stored. So, using these codes, it is easier to find and retrieve the data. However, because traditional hash functions generate codes randomly, sometimes two pieces of data can be hashed with the same value. This causes collisions -- when searching for one item points a user to many pieces of data with the same hash value.