Data Plus Lesson 1

Relational vs Non Relational Databases: Non Relational Databases 5

Non-relational databases can store structured and non-structured data with more flexibly.

Relational vs Non Relational Databases: Non Relational Databases 3

Non-relational databases use various programming languages to retrieve and handle transactions within the stored data.

Relational vs Non Relational Databases: Relational Databases 5

Relational databases expect data to fit within the tables that are designed for the database.

Relational vs Non Relational Databases: Relational Databases 1

Relational databases have tables that store fields in columns, and rows of records that hold data in relational database management systems (RDBMS).

Relational vs Non Relational Databases: Relational Databases 3

Relational databases leverage normalization techniques for optimal design.

Relational vs Non Relational Databases: Relational Databases 2

Relational databases use primary and foreign keys to establish relationships that control how certain data relates to data in other tables.

Relational vs Non Relational Databases: Relational Databases 4

Relational databases use traditional SQL language to query and handle transactions within the database.

one-to-one relationship

means that one record in a table will be associated with only one record in the other table

many-to-many relationship

means that you have many records associated with many other records. Data tools can't resolve a ___ without the use of another table that uses the associated keys from each table to serve as a bridge.

Document-oriented databases

store data in XML documents or JSON. They are flexible in that they allow developers to reshape the data to meet the format needed for the application.

Column-oriented databases

store data in columns rather than rows. This design can make for easier analysis in some cases, such as when counting the total number of orders.

Primary Key

A key used to identify a record

tabular schema

A relational database is also called

non-relational database (NoSQL)

Any alternative to a relational SQL database

denormalized data

Data that is not properly designed using normalization would be referred to as

Relational vs Non Relational Databases: Non Relational Databases 2

Non-relational databases are much easier to scale and build for web-based applications and do not require the same level of detailed planning and structure that relational databases require.

Relational vs Non Relational Databases: Non Relational Databases 1

Non-relational databases are the alternative to relational databases and do not follow the same structural requirements of a SQL-based database.

relational database management system (RDBMS)

Software that maintains relational databases

Structured Query Language (SQL)

The language used to query and manage data in a relational database

Relational vs Non Relational Databases: Non Relational Databases 4

There are four categories of non-relational databases: document- oriented (the most prominent), key-value stores, column-oriented, and graph stores.

Non-Relational Databases

This type of database addresses the need for web-based databases to handle large amounts of traffic and data, and are easier to scale for web applications.

relational database

Uses tables to store data that is captured

normalized data

When a database is designed, the data is structured for optimal storage and use within the program

Cascade Update

When a primary key is changed and __ is enforced, the primary key will change in all other related tables.

Foreign Key

When a primary key is used in another table to refer to your record

Cascade Delete

When a primary key record is deleted and __ is enforced, all records in various tables that are related to the record through that key will be automatically deleted.

one-to-many relationship

a primary key is joined to a foreign key, meaning there is one record (in the table in which the key is primary) associated with multiple records in other tables (in which the key is foreign).

Third Normal Form (3NF)

eliminates fields that do not depend on a key. You will likely find that while some designs go to the 3NF, most do not.

First Normal Form (1NF)

eliminates redundant information in individual tables. Each set of related data will be stored in a dedicated table. Each table of related information will have a primary key assigned.

Referential integrity

ensures that a foreign key definitively has a primary key in the related table

Second Normal Form (2NF)

related information that is applicable to multiple tables will have its own table and will be associated through the use of a foreign key.

Key-value stores

store each value with a key value. This is similar to a table with just two columns: a field (key) and value.

Graph stores

store individual elements as nodes. This type of database is more complex and focuses on the relationships between data elements. In a graph database, the connections are first-class elements of the database and stored directly. You will often find that graph databases run side by side with a relational database.