We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent ec09f97 commit 2aff68bCopy full SHA for 2aff68b
1 file changed
distributed/intro.md
@@ -32,8 +32,8 @@ CAP theorem states that a distributed data store cannot simultaneously be consis
32
## BASE Theory
33
- **B**asically **A**vailable — The system always returns a response.
34
- **S**oft state — The system could change over time, even during times of no input (due to eventual consistency).
35
-- **E**ventual consistency — In the absence of input, the data will spread to every node sooner or later — thus becoming consistent.
36
--
+- **E**ventual #consistency — In the absence of input, the data will spread to every node sooner or later — thus becoming consistent.
+
37
## Categories
38
39
### Distributed Storage
0 commit comments