CAP Theorem in Hadoop What is CAP Theorem? 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 Consistency: When you read data it will give same data how many times read and server send response each and every request but systems always consistent when read data.(all node having same data) Availability: It means all requests give response and no error accured in this systems. Partition Tolerance: All functions run all time when more nodes not responsive and commnication break between two nodes Distributed systems statisfy any two terms only and not satisfy three terms Selecting Two options in CAP Theorem: CP – Consistency/Partition Tolerance: It wait for response form partioned nodes and that ...
Popular posts from this blog
Types of Nodes in Hadoop 1. NameNode: NameNode is the main and heartbeat node of Hdfs and also called master. It stores the meta data in RAM for quick access and track the files across hadoop cluster. If Namenode failure the whole hdfs is inaccessible so NameNode is very critical for HDFS. NameNode is the health of datanode and it access datanode data only. NameNode Tracking all information from files such as which file saved in cluster, access time of file and Which user access a file on current time.There are two types of NameNode 2. Secondary NameNode: Secondary NameNode helps to Primary NameNode and merge the namespaces. Secondary NameNode stores the data when NameNode failure and used to restart the NameNode. It requires huge amount of memory for data storing. Secondary NameNode runs on different machines for memory management. Secondary NameNode is checking point of NameNode. 3. DataNode: DataNode stores actual data of HDFS and also called Sl...

Comments
Post a Comment