The document compares relational and non-relational databases. Relational databases organize data into tables with rows and columns and use SQL for queries. They are good for structured data but difficult to change. Non-relational databases have flexible schemas and adapt easily but can be less reliable. Examples of relational databases include MySQL and SQL Server, while non-relational options include MongoDB, Cassandra, and Redis.
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
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.
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