Question
Answer the following about database design, for 10 points each.
[10e] Relational databases organize data in these spreadsheet-like collections. To avoid redundancy, rows in one of these collections use foreign keys to refer to data in another of them.
ANSWER: tables
[10m] A distributed database faces a tradeoff between this property, availability, and partition tolerance. To ensure data validity, transactions should satisfy atomicity, this property, isolation, and durability.
ANSWER: consistency [or consistent; accept correctness] (Those are the CAP theorem and ACID properties, respectively.)
[10h] Public databases with sensitive information can implement this property by adding noise, as shown by Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. This property, which is often confused with k-anonymity, ensures that a query response is nearly the same whether or not an individual is in a database.
ANSWER: differential privacy [accept epsilon-differential privacy; prompt on privacy]
Data
| Team | Opponent | Part 1 | Part 2 | Part 3 | Total |
|---|---|---|---|---|---|
| Penn A | WUSTL B | 0 | 0 | 10 | 10 |