DATABASE FUNDAMENTALS
BASICS OF BIG DATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
DBMS
|
|
|
HIVE
|
|
|
HBASE
|
|
|
AL;
|
Detailed explanation-1: -CAP Theorem – Brewer’s Theorem. Consistency (all nodes see the same data at the same time) Availability (a guarantee that every request receives a response about whether it succeeded or failed) Partition tolerance (the system continues to operate despite arbitrary message loss or failure of part of the system)
Detailed explanation-2: -Hbase follows the ACID Properties.
Detailed explanation-3: -CAP theorem is designed for distributed file systems(collection of interconnected nodes). CAP Theorem also known as Brewer’s theorem and used to distributed consistency.It contains follwing three technical terms for distributed systems. C – Consistency. A – Availability. P – Partition Tolerance.
Detailed explanation-4: -NoSQL can not provide consistency and high availability together. This was first expressed by Eric Brewer in CAP Theorem. CAP theorem or Eric Brewers theorem states that we can only achieve at most two out of three guarantees for a database: Consistency, Availability, and Partition Tolerance.