Use the following schema to answer the questions 1-3 below.

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
icon
Related questions
Question
Part 1: Use the following schema to answer the questions 1-3 below. This schema refers to a gaming
organization. There can be any number of players per game. Each game and each tournament has one
winner; if the game or tournament is ongoing, the winner is null. The gameWinner and
tournamentWinner attributes are foreign keys for memberID.
Member (memberlD, memberName, joinDate)
Game (gamelD, gameType, gameDate, gameWinner, tournamentName)
MemberGame (memberlD, gamelD)
Tournament (tournamentName, tournamentWinner)
1. Write a description of what each of the following queries does:
a.
SELECT memberID, gamelD
FROM Member NATURAL JOIN MemberGame NATURAL JOIN Game
WHERE joinDate < "2021-01-01" AND gameDate >= "2021-01-01"
b. Write two functionally different relational algebra statements equivalent to the query in
1a.
C. Which of your answers to question 3 will most likely be processed faster? Justify your
answer.
Transcribed Image Text:Part 1: Use the following schema to answer the questions 1-3 below. This schema refers to a gaming organization. There can be any number of players per game. Each game and each tournament has one winner; if the game or tournament is ongoing, the winner is null. The gameWinner and tournamentWinner attributes are foreign keys for memberID. Member (memberlD, memberName, joinDate) Game (gamelD, gameType, gameDate, gameWinner, tournamentName) MemberGame (memberlD, gamelD) Tournament (tournamentName, tournamentWinner) 1. Write a description of what each of the following queries does: a. SELECT memberID, gamelD FROM Member NATURAL JOIN MemberGame NATURAL JOIN Game WHERE joinDate < "2021-01-01" AND gameDate >= "2021-01-01" b. Write two functionally different relational algebra statements equivalent to the query in 1a. C. Which of your answers to question 3 will most likely be processed faster? Justify your answer.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Arrays
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education