Versions Compared
Version | Old Version 6 | New Version 7 |
---|---|---|
Changes made by | ||
Saved on |
Key
- This line was added.
- This line was removed.
- Formatting was changed.
Tip |
---|
The Framework proposed in this space (Alex Xu) is not exactly applied to propose a design : Getting started - a framework to propose... |
Introduction
A key-value store (KVS) referred to a key-value database (KVD), is a non-relational database.
Unique identifier is stored as a key with its associated value.
Key must be unique and value is accessed through key.
On this page.
Table of Contents |
---|
Part 1 - Understand the problem and establish design scope
Size of a KV pair | Small : less than 10 KB |
---|---|
Ability to store big data ? | Yes. |
High Availability: system responds quickly even during failures ? | Yes. |
High Availability: system can be scaled to support large data set ? | Yes. |
Automatic scaling: adding / deleting servers based on traffic ? | Yes. |
Tunable consistency ? | Yes. |
Low latency ? | Yes. |
Part 2 - KVS in Single Server

Even with the optimisations (data compression, frequently used data in memory and rest on disk), a distributed KV store is required for big data.