Discussion
As per the CAP theorem, distributed database can provide ...................... to achieve high scalability.
Answer: D
The answer is At least two among (A), (B) and (C).
Eric Brewer's CAP theorem says that a distributed data store cannot guarantee consistency, availability and partition tolerance all at once. When the network partitions, it must give up either consistency or availability. So a design achieves two of the three properties: CA, CP or AP. Highly scalable systems spread over many machines must tolerate partitions, and then choose between consistency and availability.
The option is worded 'at least two', but its sense is a pair of the three, which is what the theorem allows. Each of the other options names a single property, which understates what a system can provide.
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development