storage
Key-Value Store
O(1) get/put/delete backed by a hash map. The simplest storage abstraction.
entries0
operations0
Hash Map (0 entries)
empty — use PUT to add entries
// operation log
No operations yet
How It Works
- Hash function maps keys → array indices
- GET/PUT/DEL all O(1) average case
- Collisions handled via chaining/open addressing
- Foundation of caches and in-memory DBs
Use Cases
- Redis, Memcached
- Session stores
- Configuration management
- DynamoDB (partition key lookup)