Home
Data Structures and Algorithms
Complexity Analysis
Arrays
Searching & Sorting
Linked Lists
Stacks
Queues
Heaps & Priority Queues
Hashing
Trees
Graphs
Tries
Math & Bit Manipulation
Greedy Algorithms
Backtracking
Dynamic Programming
Summary
About
Dark
Guide contents
Databases and SQL
Getting Started
1.
Introduction: How This Course Works
2.
The Sample Database
SQL Fundamentals
3.
SELECT, WHERE, ORDER BY, and LIMIT
4.
NULL and Three-Valued Logic
5.
Aggregation, GROUP BY, and HAVING
6.
Joins
7.
Subqueries and EXISTS
8.
Set Operations, CTEs, and Recursion
9.
Window Functions
10.
Functions and Expressions
11.
Changing Data
Schema Design
12.
Data Types and Constraints
13.
Normalization
14.
Views and Routines
Indexes and Performance
15.
How Indexes Work
16.
Query Plans
17.
Fixing Slow Queries
Transactions and Concurrency
18.
Transactions and ACID
19.
Isolation Levels
20.
Locking and Deadlocks
Database Internals and Scaling
21.
Storage and Pages
22.
WAL and Crash Recovery
23.
MVCC and Vacuum
24.
Query Execution and the Optimizer
25.
LSM Trees vs B-Trees
26.
Partitioning and Sharding
27.
Replication and CAP
28.
SQL vs NoSQL
Interview Practice
29.
Classic SQL Interview Problems
30.
SQL Interview Questions
Home
/
Databases and SQL
/
Schema Design
Schema Design
Data types, constraints, keys, and normalization.
3 lessons
12.
Data Types and Constraints
13.
Normalization
14.
Views and Routines
