Commit 7855b3e

committed

question on eventual consistency

1 parent d1f803f commit 7855b3eCopy full SHA for 7855b3e

File tree

-1

lines changed

-1

lines changed

Lines changed: 8 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1383,6 +1383,7 @@`
`1383`	`1383`	`\| 4 \| [What are the read phenomena in Isolation?](#what-are-the-read-phenomena-in-isolation)`
`1384`	`1384`	`\| 5 \| [What are the four Isolation levels?](#what-are-the-four-isolation-levels)`
`1385`	`1385`	`\| 6 \| [Which isolation levels can prevent problems that occur in read phenomena?](#which-isolation-levels-can-prevent-problems-that-occur-in-read-phenomena)`
	`1386`	`+\| 7 \| [What does Eventually Consistent Mean?](#what-does-eventually-consistent-mean)`
`1386`	`1387`
`1387`	`1388`	`1. ### What is ACID Model in Database?`
`1388`	`1389`
`@@ -1430,4 +1431,11 @@`
`1430`	`1431`
`1431`	`1432`
`1432`	`1433`
	`1434`	`+[ Back to Top ⬆ ](#table-of-contents---database-engineering)`
	`1435`	`+`
	`1436`	`+`
	`1437`	`+7. ### What does Eventually Consistent Mean ?`
	`1438`	`+`
	`1439`	`+ Eventual Consistency concept is that while a database may have some inconsistencies at any point in time, it will eventually become consistent when all updates cease i.e eventually all nodes will receive the latest consistent updates.`
	`1440`	`+`
`1433`	`1441`	`[ Back to Top ⬆ ](#table-of-contents---database-engineering)`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -20,4 +20,4 @@ function hashing(num=0,str) {`
`20`	`20`	return `\| ${num} \| [${str}?](#${hashed})`
`21`	`21`	`}`
`22`	`22`
`23`		`-console.log(hashing(6,'Which isolation levels can prevent problems that occur in read phenomena'));`
	`23`	`+console.log(hashing(6,'What does Eventually Consistent Mean'));`

Comments

(0)