3.1. Relational First Principles (Normalization, ACID, SQL)

💡 First Principle: Relational databases solve a fundamental problem: how do you store related information without duplicating it everywhere? Think of it like a well-organized filing system where each piece of information exists in exactly one folder, with cross-references linking related items. The magic happens through keys (unique identifiers) and relationships (links between tables). This structure sacrifices flexibility for consistency and query power—once you define how data relates, the database enforces those rules automatically.

What happens without this structure? Imagine storing customer information directly in every order record. When a customer changes their address, you'd need to update hundreds of rows—and if you miss one, your data becomes inconsistent. The "truth" about where the customer lives now depends on which order you look at. Relational design eliminates this nightmare through normalization.

Scenario: A hospital stores patient records. Each patient can have multiple visits, and each visit can have multiple prescriptions. If you store all this in a single flat file, you'll duplicate patient names thousands of times and risk inconsistencies. Relational design solves this through separate tables linked by keys.

Relational databases use Structured Query Language (SQL) for all operations and rely on normalization to reduce redundancy.