---
date: '2024-12-13'
description: and what is database design anw?
id: finals
modified: 2026-06-05 15:08:42 GMT-04:00
tags:
  - sfwr3db3
title: introduction to databases
created: '2024-12-13'
published: '2024-12-13'
pageLayout: default
slug: thoughts/university/twenty-four-twenty-five/sfwr-3db3/finals
permalink: https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3db3/finals.md
generator:
  quartz: v4.6.0
  hostedProvider: Cloudflare
  baseUrl: aarnphm.xyz
full: https://aarnphm.xyz/llms-full.txt
---
See also [[thoughts/university/twenty-four-twenty-five/sfwr-3db3/midterm|refresh on SQL and indexes with views]], or this [[thoughts/university/twenty-four-twenty-five/sfwr-3db3/SQL.pdf|slides on SQL DSL]], and [[thoughts/university/twenty-four-twenty-five/sfwr-3db3/final-review.pdf|final review]]

> \[!tip\] closure of `F`
>
> For a set of FDs $F$, then closure $F^{+}$ is the set of _all_ FDs that can be derived from $F$
>
> **not to be confused with closure of an attribute set**

![[thoughts/university/twenty-four-twenty-five/sfwr-3db3/Design theory#rules|Armstrong's Axiom]]

![[thoughts/university/twenty-four-twenty-five/sfwr-3db3/Design theory#closure test|FD's closure test]]

![[thoughts/university/twenty-four-twenty-five/sfwr-3db3/Design theory#minimal basis|minimal cover or minimal basis]]

---

![[thoughts/university/twenty-four-twenty-five/sfwr-3db3/Design theory]]

![[thoughts/university/twenty-four-twenty-five/sfwr-3db3/Relational Algebra]]

![[thoughts/university/twenty-four-twenty-five/sfwr-3db3/Transaction]]