3 ms·
A hash table is a well-known term that covers multiple algorithms, but I never seen one that worked the way you describe. False positive lookups is a property o
by wruza 8y ago
A hash table is a well-known term that covers multiple algorithms, but I never seen one that worked the way you describe. False positive lookups is a property of bloom filter-like struct, not of a hash table. Using false positives to remove duplicates would be wrong indeed.
Ed: I missed “It's only definition is key/value pair” part. No, that’s called key-value list or table. Hash table uses hashes of keys to partition itself into quick lookup segments - that’s the point.