Relational VS Non
Relational Databases
Angelica Lo Duca
https://alod83.medium.com/
Basic Structure
Relational Databases
Definition
● A Relational Database is a collection of items with
pre-established relationships among them.
● All the items are organised in tables, where columns
represent items attributes.
● Every row of a table represents a single data item.
The Structured Query Language (SQL) is the
most famous interface used to communicate
with a Relational Database.
Examples of SQL databases
● Mysql
● Postgres
● Microsoft SQL Server
● SQLlite.
Pros and Cons of Relational DBs
PROS
● Great for structured data
● Use of an existing query
language (SQL)
● Great for complex queries
● Easy data navigation
● High level of data integration,
due to relationships and
constraints among tables
● Transactions are secure
● High reliability
CONS
● Up-front schema definition
● No adaptation to changing
requirements: dynamic
changes to an item affect all
the other items in the same
table
● Data processing may be
slow. High performance is
possible with expensive
hardware
Non Relational Databases
Definition
● A Non Relational Database is a collection of unstructured,
structured or semi-structured items, usually represented in
the form key-value.
● Every item in the collection may either represent a
document, a table or anything else.
Examples of Non Relational database engines
● MongoDB
● Apache Cassandra
● Redis
● Couchbase
● Apache HBase
Pros and Cons of Non Relational DBs
PROS
● Flexible data model
● Rapid adaptation to changing
requirements: dynamic
changes to a item do not
affect the other items
● Storage of huge amount of
data with little structure
● High performance
CONS
● Low reliability
● Manual query language
● It is difficult to verify data
integrity and consistency
Relational VS Non Relational DB
Read more...
You can read the full article at this link:
https://towardsdatascience.com/relational-vs-non-relational-databases-f2ac79248
2e3

Relational vs Non Relational Databases

  • 1.
    Relational VS Non RelationalDatabases Angelica Lo Duca https://alod83.medium.com/
  • 2.
  • 3.
  • 4.
    Definition ● A RelationalDatabase is a collection of items with pre-established relationships among them. ● All the items are organised in tables, where columns represent items attributes. ● Every row of a table represents a single data item.
  • 5.
    The Structured QueryLanguage (SQL) is the most famous interface used to communicate with a Relational Database.
  • 6.
    Examples of SQLdatabases ● Mysql ● Postgres ● Microsoft SQL Server ● SQLlite.
  • 7.
    Pros and Consof Relational DBs PROS ● Great for structured data ● Use of an existing query language (SQL) ● Great for complex queries ● Easy data navigation ● High level of data integration, due to relationships and constraints among tables ● Transactions are secure ● High reliability CONS ● Up-front schema definition ● No adaptation to changing requirements: dynamic changes to an item affect all the other items in the same table ● Data processing may be slow. High performance is possible with expensive hardware
  • 8.
  • 9.
    Definition ● A NonRelational Database is a collection of unstructured, structured or semi-structured items, usually represented in the form key-value. ● Every item in the collection may either represent a document, a table or anything else.
  • 10.
    Examples of NonRelational database engines ● MongoDB ● Apache Cassandra ● Redis ● Couchbase ● Apache HBase
  • 11.
    Pros and Consof Non Relational DBs PROS ● Flexible data model ● Rapid adaptation to changing requirements: dynamic changes to a item do not affect the other items ● Storage of huge amount of data with little structure ● High performance CONS ● Low reliability ● Manual query language ● It is difficult to verify data integrity and consistency
  • 12.
    Relational VS NonRelational DB
  • 14.
    Read more... You canread the full article at this link: https://towardsdatascience.com/relational-vs-non-relational-databases-f2ac79248 2e3