This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: NetID: Problem 2 ( 24 points ) Database Design You have been asked to design a database of college basketball teams, in time for March Madness, with the following constraints: 1. Each Team has a unique TeamID, a TeamName, and a Seed. 2. Each Player has a unique Number, a Name, and belongs to exactly one Team. It is impossible for a player to not belong to a Team. 3. The Number of a Player is unique within a Team, but is not unique across Teams. In other words, it is not possible that two Players on the same Team both have the Number 30. However, it is possible that two players on different Teams both have the Number 30. 4. Teams play with each other in Games. Each Game consists of exactly two Teams, a Home Team and an Away Team (hint: think of it as each Game having one relationship with each Team, Home Team and Away Team). 5. Players play in Games - over the course of the tournament a Player might play in one, many, or no Games. Each Game will have several Players playing....
View Full Document
This note was uploaded on 02/17/2012 for the course CS 411 taught by Professor Winslett during the Fall '07 term at University of Illinois at Urbana–Champaign.
- Fall '07