In this session we'll go over the two most common open source relational databases. We'll start with a quick introduction to relational theory and an overview of why this technology is still powerful and relevant. We will address the challenges and operational specifics of developing against relational databases on Cloud environments.
Note: This talk is aimed to developers
8. Relational Databases
DATA PERC EIVED BY USER S
AS TABL E S & ONLY T A BLE S
OPERATOR S GE NERATE
N E W TABLE S FROM OLD
* Trivia Q1: Why ‘Relation’?
9. E NTI TIE S
RE LAT I ON SHIPS
C ON STR AINTS
ATTRIB UTE S
Relational
Concepts
10. E NTI TIE S
RE LAT I ON SHIPS
C ON STR AINTS
AT TRIB UTE S
Relational
Concepts
11. E NTI TIE S
RE LAT I ON SHIPS
C ON STR AINTS
ATTRIB UTE S
Relational
Concepts
12. E NTI TIE S
RE LAT I ON SHIPS
C O N STRAINTS
ATTRIB UTE S
Relational
Concepts
15. On SQL
D ML : DATA MA NIPU L ATI ON
(SEL EC T, IN SER T, U PDATE … )
D DL: DATA DEF INI TI ON
(C R EATE, DR OP, A LTER)
D C L: DATA C ONTROL
(GRA N T, RE VOK E)
30. Pro: Versatile
LI STE N/N OTIF Y
FL EXIBLE INDEXE S
PE R TRA N SAC TI ON
SYN C HRON OUS REPLICATI ON
31. B-TREE S
DEF AULT. N UME RIC, TEXT,NULL
HASH
EQUA LI T Y. D ON ’T USE
GIN
A RRAY VA LUE S & F TS
GI ST
GE OME TRI C DATA & F TS
They Can Be
Created
Concurrently!
Many Indexes
32. PA R TIA L I NDEX E S
IND EX + WHERE C LAUSE
EXPRE SSI ON I NDE X E S
MAT C H ON FUN C TI ON/ MOD IF ICATI ON
UNIQU E I NDEX E S
PR E VE N TS DUPE S
SOR TE D I NDEX E S
A LT ER B-TREE FROM ASC TO DE SC
Many Indexes
33. Cons
C LUSTERING STORY I S N OT
Q UI T E THERE YE T
MORE STRIC T IN TE RM S
OF T YPE S. N O MORE
SHE NA NIGA N S!
34. Common Mistakes
UNNEC E SSA RY INDE X E S
(MU LTI-C OLUMN)
OVERLOOK EXT E N S I ON S
GIVIN G UP ON IN S TA L L
37. Know YourReplication
DB RE P LIC ATI ON I S A MUST H AVE
USE D IFFERE NT FAILURE D OMAIN S
UNDER STA ND DR/HA OPTI ON S
PRAC TIC E REPLICA PR OMOTI ON S
38. BAC KUPS≠D I SAS TER REC OVERY
HAV E A P LA N & PRAC TIC E I T!
Expect Failures
DB Master
us-east-1a
Replica
us-east-1b
App
App
X