An index specialized for exact-match lookups, using a value produced by running the search key through a hash function.
While a B-tree index can also handle range searches (greater than, less than, etc.), a hash index is specialized purely for equality checks, making it faster for exact-match lookups in exchange for that narrower use.
© 2026 ITBGM