DATABASE FUNDAMENTALS
BASICS OF BIG DATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
At any time, the system is linearizable
|
|
|
At any time, concurrent reads from any node return the same values
|
|
|
If writes stop, a distributed system will become consistent
|
|
|
If writes stop, all reads will return the same value after a while
|
|
|
If writes stop, all reads will return the same value after a while
|
Detailed explanation-1: -Linearizability is the strongest form of consistency. This means that all operations are executed in a way as if executed on a single machine, despite the data being distributed across multiple replicas. As a result, every operation returns an up-to-date value.
Detailed explanation-2: -Eventual Consistency is a guarantee that when an update is made in a distributed database, that update will eventually be reflected in all nodes that store the data, resulting in the same response every time the data is queried.
Detailed explanation-3: -Eventual consistency is a characteristic of distributed computing systems such that the value for a specific data item will, given enough time without updates, be consistent across all nodes. Accordingly, the value across all nodes will be consistent with the last update that was made–eventually.
Detailed explanation-4: -Linearizability cares about time. Sequential consistency cares about program order. – Should provide the behavior of a single copy – A read operation returns the most recent write, regardless of the clients. – All subsequent read ops should return the same result until the next write, regardless of the clients.