Problem 2: A database for maintaining information about the cities in the United States has the following relation schema Info(city_name, state, governor, mayor) The city_name attribute is the name of a city, state is the abbreviation for state the city is in, governor is the name of the governor of the state the city is in, and mayor is the name of the mayor of the city. For example, the tuple ('New York', 'NY', 'Andrew Cuomo', 'Bill de Blasio') gives information about New York City. Two cities may have the same name (for example there are at least two cities named Portland in the US), but two cities in the same state cannot have the same name. Two states cannot have the same abbreviation. Each city has exactly one mayo and each state has exactly one governor. 1. Which of the following are super keys? Which are candidate keys? (There may be more than one): {city_name} {state} {city_name, state} {city_name, state, mayor} 2. If there are 1000 cities from NY state in a relation of this schema, how many rows will need to be updated when NY gets a new governor? 3. Give an example of a non-trivial functional dependency in this schema for which the left-hand side is not a superkey. 4. Decompose the schema into two schemas that are in Boyce-Codd Normal Form (BCNF). 5. If there are 1000 cities from NY state in relations of the BCNF schemas, how many rows will need to be updated when NY gets a new governor?
Problem 2: A database for maintaining information about the cities in the United States has the following relation schema Info(city_name, state, governor, mayor) The city_name attribute is the name of a city, state is the abbreviation for state the city is in, governor is the name of the governor of the state the city is in, and mayor is the name of the mayor of the city. For example, the tuple ('New York', 'NY', 'Andrew Cuomo', 'Bill de Blasio') gives information about New York City. Two cities may have the same name (for example there are at least two cities named Portland in the US), but two cities in the same state cannot have the same name. Two states cannot have the same abbreviation. Each city has exactly one mayo and each state has exactly one governor. 1. Which of the following are super keys? Which are candidate keys? (There may be more than one): {city_name} {state} {city_name, state} {city_name, state, mayor} 2. If there are 1000 cities from NY state in a relation of this schema, how many rows will need to be updated when NY gets a new governor? 3. Give an example of a non-trivial functional dependency in this schema for which the left-hand side is not a superkey. 4. Decompose the schema into two schemas that are in Boyce-Codd Normal Form (BCNF). 5. If there are 1000 cities from NY state in relations of the BCNF schemas, how many rows will need to be updated when NY gets a new governor?
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Transcribed Image Text:Problem 2:
A database for maintaining information about the cities in the United States has the following
relation schema
Info(city_name, state, governor, mayor)
The city_name attribute is the name of a city, state is the abbreviation for state the city is in,
governor is the name of the governor of the state the city is in, and mayor is the name of the mayor
of the city. For example, the tuple ('New York', 'NY', 'Andrew Cuomo', 'Bill de Blasio') gives
information about New York City. Two cities may have the same name (for example there are at
least two cities named Portland in the US), but two cities in the same state cannot have the same
name. Two states cannot have the same abbreviation. Each city has exactly one mayo and each
state has exactly one governor.
1. Which of the following are super keys? Which are candidate keys? (There may be more than one):
{city_name}
{state}
{city_name, state}
{city_name, state, mayor}
2. If there are 1000 cities from NY state in a relation of this schema, how many rows will need to be
updated when NY gets a new governor?
3. Give an example of a non-trivial functional dependency in this schema for which the left-hand
side is not a superkey.
4. Decompose the schema into two schemas that are in Boyce-Codd Normal Form (BCNF).
5. If there are 1000 cities from NY state in relations of the BCNF schemas, how many rows will need
to be updated when NY gets a new governor?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 7 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education