CAP THEOREM
what is CAP?
CAP means Consistency Availability and Partition tolerance
CAP theorem, also known as Brewer's theorem
This theorem is about database
This Theorem states that it is impossible for a distributed computer system to simultaneously provide all three i.e, the database cannot have consistency availability and partition tolerance at one
what is CAP?
CAP means Consistency Availability and Partition tolerance
CAP theorem, also known as Brewer's theorem
This theorem is about database
This Theorem states that it is impossible for a distributed computer system to simultaneously provide all three i.e, the database cannot have consistency availability and partition tolerance at one
- Consistency : all nodes see the same data at the same time
- Availability :a guarantee that every request receives a response about whether it was successful or failed
- Partition tolerance :the system continues to operate despite arbitrary message loss or failure of part of the system
At present world we see relational database i.e oracleDB,SQL SERVER,mySQL,DB2 etc,these database support only relation data in the form of tables but what about non-relational data i.e behavioral data
what is behavioral data?
Data about an entity example consider that your searching in Google when you are logged in with Google account rater than keeping your account in data based(i.e relational one) they collect the data about what your are searching? so that when you are searching and when you are logged in,if you search the first preference will be given to the behavioral data of yours and so that no need to type the whole sentence again.
This type of data is useful for analysis business and people.
In NoSQL we can use 4 type of data:
Document store
The central concept of a document store is the notion of a "document". While each document-oriented database implementation differs on the details of this definition, in general, they all assume that documents encapsulate and encode data (or information) in some standard formats or encodings. Encodings in use include XML, YAML, and JSON as well as binary forms like BSON, PDF and Microsoft Office documents (MS Word, Excel, and so on).
Different implementations offer different ways of organizing and/or grouping documents:
- Collections
- Tags
- Non-visible Metadata
- Directory hierarchies
Graph
This kind of database is designed for data whose relations are well represented as a graph (elements interconnected with an undetermined number of relations between them). The kind of data could be social relations, public transport links, road maps or network typologies,
Key–value store
Key–value stores allow the application to store its data in a schema-less way. The data could be stored in a datatype of a programming language or an object. Because of this, there is no need for a fixed data model.
Column Family Stores
These were created to store and process very large amounts of data distributed over many machines. There are still keys but they point to multiple columns. The columns are arranged by column family.
For maintaining these database different vendors have different softwares
This NoSql is famous by this name BigData.
After few days if you don't know about it,you may not be eligible for employment in database field.






.jpg)
.jpg)
.jpg)
.jpg)
.jpg)
.jpg)


.jpg)

.jpg)
.jpg)


