Before you can reason about keys, functional dependencies, or normalization, you need a precise vocabulary for what a relation actually is. In relational theory, a relation is not simply a table on a screen — it is a mathematical object defined in terms of sets. A domain is the set of permitted values for an attribute, a tuple is an ordered list of values drawn from those domains, and a relation is a subset of the Cartesian product of the domains involved. Attributes give each position in the tuple a name and a semantic meaning, which is what lets us talk about columns by label rather than by position.
This mathematical grounding matters for the rest of the course because every later result — Armstrong's Axioms, attribute closure, candidate key identification, and the normal forms — is stated and proved in set-theoretic language. If you are comfortable with the ideas of set membership, Cartesian products, n-ary relations, and the distinction between a relation schema (the structure) and a relation instance (the current set of tuples), the formal parts of Module 2 will read as straightforward consequences rather than as arbitrary rules.
As you watch the videos below, keep a running glossary. For each term — domain, tuple, attribute, degree, cardinality, relation, relation schema — write down both the formal definition and the everyday table-based analogy. Notice especially where the practical database vocabulary (table, row, column) lines up with the mathematical vocabulary (relation, tuple, attribute), and where the two differ: tables may tolerate duplicate rows and rely on column order, while a mathematical relation is a set and therefore cannot.
A concise overview from IBM Technology explaining what a relational database is, how data is organized into tables of rows and columns, and how relationships between tables are expressed through keys. Based on its title and description, it is likely to cover the table/row/column vocabulary, primary and foreign keys, and the role of SQL in querying relational data.
It gives you the practical, industry-facing picture of the relational model from a well-known technology producer, which is the concrete counterpart to the set-theoretic definitions — useful for mapping "table, row, column" onto "relation, tuple, attribute."
A lecture from Gate Smashers on tuple relational calculus, a formal query language in which queries are expressed as logical conditions over tuple variables ranging across a relation. Expect worked examples using quantifiers and predicates, with attention to how a tuple variable refers to rows of a named relation.
Tuple calculus is one of the clearest demonstrations that relations are mathematical sets of tuples rather than mere spreadsheets, and this channel is widely used for exam-oriented DBMS instruction with step-by-step examples.
A short set theory lecture introducing n-ary relations — subsets of the Cartesian product of n sets — and their applications, including the use of such relations to model database tables. It should cover the formal definition, the notion of degree, and how attributes correspond to the component sets.
This is the most direct mathematical treatment of the topic's central definition, connecting domains and Cartesian products to the formal notion of a relation in exactly the way the course requires.
Together these three videos build the set-theoretic vocabulary required by MO1: the n-ary relations lecture supplies the formal definition of a relation as a subset of a Cartesian product of domains, the tuple calculus lecture reinforces tuples and attributes as the objects that formal queries quantify over, and the IBM overview anchors those abstractions in the familiar table-row-column language used by real database systems. That shared vocabulary is the prerequisite for the remaining outcomes — you cannot state a functional dependency and classify it as trivial or non-trivial (MO2), apply Armstrong's Axioms (MO3), compute an attribute closure to find candidate keys (MO4), or diagnose redundancy and update anomalies in a schema (MO5) without first being able to speak precisely about attribute sets, tuples, and relation schemas. Treat these videos as the foundation layer; the FD-specific material later in the module assumes you already have it.
These videos were chosen from YouTube on October 2, 2026. Each has captions; the player turns them on. Videos on YouTube can be changed or removed — if one no longer plays, tell your instructor. If a player does not appear, use its Watch on YouTube link.