# Database flash cards: Master level

24 Database terms at the Master level, as flash cards.

Updated: September 27, 2026

- [Study these as flash cards](https://www.ask-codey.com/decks/database/5/flash)
- [Play Memory with them](https://www.ask-codey.com/games/memory?category=database&level=5)

## Terms in this deck

- [Antijoin](https://www.ask-codey.com/glossary/antijoin): A relational operation returning rows from one side that have no match on the other side.
- [Cartesian Product](https://www.ask-codey.com/glossary/cartesian-product): The relation containing every possible concatenation of a tuple from each input relation.
- [Conflict Serializability](https://www.ask-codey.com/glossary/conflict-serializability): Serializability established by reordering nonconflicting operations into a serial schedule.
- [Domain Relational Calculus](https://www.ask-codey.com/glossary/domain-relational-calculus): A declarative formal query language using variables that range over domain values.
- [Equijoin](https://www.ask-codey.com/glossary/equijoin): A theta join whose condition uses equality.
- [Natural Join](https://www.ask-codey.com/glossary/natural-join): A join matching equally named columns automatically and returning one copy of each matched column.
- [Precedence Graph](https://www.ask-codey.com/glossary/precedence-graph): A directed graph of transaction conflicts used to test conflict serializability.
- [Projection (Relational Algebra)](https://www.ask-codey.com/glossary/projection-relational-algebra): The relational operation that keeps selected attributes and removes duplicate tuples.
- [Relational Algebra](https://www.ask-codey.com/glossary/relational-algebra): A formal collection of operations that take relations as input and produce relations.
- [Relational Closure](https://www.ask-codey.com/glossary/relational-closure): The property that relational operations return relations.
- [Relational Completeness](https://www.ask-codey.com/glossary/relational-completeness): The ability of a query language to express every operation of relational algebra.
- [Relational Difference](https://www.ask-codey.com/glossary/relational-difference): The tuples present in the first compatible relation but absent from the second.
- [Relational Model](https://www.ask-codey.com/glossary/relational-model): A data model representing information through relations, domains, keys, and integrity rules.
- [Selection (Relational Algebra)](https://www.ask-codey.com/glossary/selection-relational-algebra): The relational operation that keeps tuples satisfying a predicate.
- [Semijoin](https://www.ask-codey.com/glossary/semijoin): A relational operation returning rows from one side that have a match on the other side.
- [Serial Schedule](https://www.ask-codey.com/glossary/serial-schedule): A transaction schedule that completes each transaction before starting the next.
- [Serializable Schedule](https://www.ask-codey.com/glossary/serializable-schedule): A concurrent schedule with the same effect as some serial schedule.
- [Theta Join](https://www.ask-codey.com/glossary/theta-join): A join defined by an arbitrary comparison predicate between its inputs.
- [Three-Valued Logic](https://www.ask-codey.com/glossary/three-valued-logic): SQL logic in which a condition can be true, false, or unknown.
- [Tuple Relational Calculus](https://www.ask-codey.com/glossary/tuple-relational-calculus): A declarative formal query language describing desired tuples with logical predicates.
- [Two-Phase Locking](https://www.ask-codey.com/glossary/two-phase-locking): A protocol where a transaction acquires locks before entering a phase that only releases them.
- [Unknown Truth Value](https://www.ask-codey.com/glossary/unknown-truth-value): The third SQL truth value produced when NULL prevents a condition from being known true or false.
- [View Serializability](https://www.ask-codey.com/glossary/view-serializability): Serializability based on transactions reading the same values and producing the same final writes.
- [Write-Ahead Logging](https://www.ask-codey.com/glossary/write-ahead-logging): A recovery rule requiring log records to reach durable storage before related data changes.

[Read them in the glossary](https://www.ask-codey.com/glossary/subjects/database/master)

Source: https://www.ask-codey.com/decks/database/master