| sqL | nosql | | ———– | ———– | | Table Based database | Document, key-value. graph based database | | non hierarchical data storage | hierarchical data storage | | ACID properties |CAP theorem| |complex query|non complex query| |vertically scalable|horizontally scalable|
| country | city | | ———– | ———– | | US | NewYork | | France | Paris |
- hierarchial data
- a family tree
- noSQL
- noSql since you just add more servers rather than power.
- structure query language
- a collection of data items with pre-determined relationship between them
- schema
- organization of structure for a database
- mongodb which doesn't store data with relational tables but with documents.
- each document contains pairs of fields and values. the values can range from boolean, strings, to numbers.
- mongodb stores data records as documents which are generated together as a collection
- mongodb because you are not forced to use a schema. as well as what information you put in each document.
- high memory usage for storage