DBMS
Foreign Keys and Referential Actions
What happens to child rows when a referenced parent row is deleted or updated. Cascade, restrict, set null, set default and no action, with the rule f...
DBMS
A complete DBMS path: database fundamentals, architecture, data models, the ER model, the relational model, relational algebra, functional dependencies, normalisation, transactions, concurrency control, recovery, storage, indexing, query processing, distributed databases, NoSQL, security, administration, performance and exam preparation.
59 notes in 21 topics
Topics in DBMS
DBMS Fundamentals 9
Database Architecture 4
Data Models 5
ER Model 9
ER Design Projects 5
Relational Model 6
Relational Algebra 6
Functional Dependencies 5
Normalisation 9
Transactions 0
Concurrency Control 1
Recovery 0
Storage and File Organisation 0
Indexing 0
Query Processing 0
Distributed Databases 0
NoSQL and Modern Databases 0
Database Security 0
Database Administration 0
Database Performance 0
Practice and Exams 0
Notes
DBMS
Null Values and Three Valued Logic
Null means the absence of a value, not zero and not empty. Comparisons with null produce unknown, which turns two valued logic into three and changes...
DBMS
Relational Algebra: Selection, Projection and Rename
The three unary operators. Selection picks rows, projection picks columns and removes duplicates, and rename makes an expression reusable. Together th...
DBMS
Set Operations in Relational Algebra
Union, intersection and difference come straight from set theory, but they require union compatibility. Cartesian product combines every pair and is t...
DBMS
Join Operations in Relational Algebra
Theta join, equi join and natural join, all defined as a selection over a Cartesian product. The natural join joins on every common attribute and remo...
DBMS
Outer Joins, Semi Join and Anti Join
Inner joins discard unmatched tuples. Outer joins keep them and pad with nulls. Semi join keeps only the left tuples that matched, and anti join keeps...
DBMS
The Division Operator
Division answers questions containing the word every. It is the hardest operator to recognise and the easiest to verify, and it can always be rewritte...
DBMS
Building Relational Algebra Expressions
How to turn an English question into an algebra expression, read an expression tree, and apply the equivalence rules an optimiser uses to make the sam...
DBMS
Functional Dependencies Explained
A functional dependency says that whenever two tuples agree on X they must also agree on Y. It is a rule about every possible instance, not an observa...
DBMS
Attribute Closure, Step by Step
The closure of an attribute set is everything it determines. Computing it is a short mechanical loop, and it is the single tool used to find keys, tes...
DBMS
Armstrong Axioms and Inference Rules
Three primary axioms - reflexivity, augmentation and transitivity - are sound and complete, meaning they derive every dependency that follows and none...
DBMS
Finding All Candidate Keys of a Relation
A reliable method for finding every candidate key: classify attributes by where they appear in the dependencies, build a compulsory core, then extend...