What I learned this week⌗

Software⌗

Some light Wikpedia reading on db normalization: Boyce–Codd normal form (BCNF or 3.5NF)

If a relational schema is in BCNF, then all redundancy based on functional dependency has been removed
A 3NF table that does not have multiple overlapping candidate keys is guaranteed to be in BCNF Elementary key normal form Functional Dependencies
A dependency FD: X → Y means that the values of Y are determined by the values of X. Two tuples sharing the same values of X will necessarily have the same values of Y. Candidate Keys
A candidate key, or simply a key, of a relational database is any set of columns that have a unique combination of values in each row, with the additional constraint that removing any column could produce duplicate combinations of values.
A candidate key is a minimal superkey,[1] i.e., a superkey that does not contain a smaller one. Super Key
A superkey is any set of attributes that uniquely identifies each tuple of a relation. The set of all attributes is always a superkey (the trivial superkey).

Committing to submodule:

cd into submodule, add changes, commit and then git push
cd .. out and back to parent repository, add sub modules directory, commit and push