Software Engineering KB

Home

❯

03 Data Management

❯

00 Relational Databases

❯

02 Sub Concept

❯

O(1) Equality Lookups

O(1) Equality Lookups

Feb 10, 20261 min read

  • relational-databases
  • indexing
  • hash

O(1) Equality Lookups

← Back to Hash Indexes

Hash indexes provide constant-time lookups for exact equality conditions by hashing the search key directly to a bucket.

relational-databases indexing hash


Graph View

Backlinks

  • Hash Indexes

Created with Quartz v4.5.2 © 2026

  • GitHub