DBMS
53 articles in this topic

B+ Trees and Database Indexing: why indexes are fast, with a worked insert
B+ trees and database indexing explained: dense vs sparse, primary clustering and secondary indexes, B-tree vs B+ tree, with a worked B+ tree insert example.

SQL Queries and Joins in DBMS: sublanguages, joins, and GROUP BY worked out
SQL queries and joins in DBMS: DDL DML DCL TCL sublanguages, SELECT and WHERE, inner and outer joins, GROUP BY with HAVING, plus a worked join example.

Transactions and concurrency control in DBMS: ACID, schedules, serializability
Transactions in DBMS explained: ACID properties, schedules, conflict serializability with a worked precedence graph, two-phase locking, and the exam angle.

Normalization in DBMS: 1NF to BCNF, with the exam angle
Normalization in DBMS explained: functional dependencies, the exact 1NF, 2NF, 3NF and BCNF rules, a worked decomposition of one relation, and 3NF vs BCNF.

DBMS Normalization Explained Simply (With the Questions That Test It)
Normalization confuses almost everyone the first time. Here is a plain-English walk from functional dependencies to BCNF, and the exact question patterns that test it.