Today Question 1

What is the CAP Theorem in Hadoop?
In case of distributed  databases, the three important aspects of the CAP theorem are consistently (A) , Availability (A),and partition  tolerance (P) . The first one refers to the number of nodes that should respond to  a read request before it is considered as a successful operation. The second is the number of nodes that should respond to a write request before its considered a successful operation. The third is the number of nodes where the data is replicated or copied. its certainty of HDFS.

But what constitutes the CAP “theorem” (it is not an actual mathematical theorem) is that at most 2 of the 3 aspects can be provided by a database system

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s