Determine the minimal set of functional dependencies, Database Management System

Assignment Help:

Determine the minimal set of functional dependencies for the following data.

This table is part of the OHSU database of extracurricular activities and tracks the DMICE band's concerts for charities.  The DMICE band performs many concerts each year (they're in high demand!).  For each concert, a faculty, staff, or student member of the department volunteers to direct the organization of the concert, and a different member of the department volunteers to be the featured performer (thus lessening the burden of practicing time and effort on the other members of the band).  Concerts are held both in Portland and its suburbs, and concerts may be given names.There is never more than one concert a day."   Sometimes the concert names are used more than once, but always for concerts held in the same city/suburb (i.e. the "Beaverton Bash" held in Beaverton in 2012 and the "Beaverton Bash" held in Beaverton in 2013). Each concert benefits a charity, and the concert director coordinates with a contact person from that charity.  Charities may be benefitted more than once, and the contact person for a charity may vary with each benefit, but there will be only one for each performance.

Data:

concertName: the name of the concert
concertDate: the date of the concert
concertCity:the Portland suburb where the concert is held  
charityName: the name of the charity benefitted by the concert
charityContact: the name of the contact for the charity for the specific performance
charityPhone: the phone number of the charity contact person
concertDirector: the name of the person organizing the concert 
musicianName: the name of a participating musician 
primaryInstrument: a musician's primary instrument  
secondaryInstrument: a musician's secondary instrument   
concertFeaturedMusician: the participant featured in the concert


Related Discussions:- Determine the minimal set of functional dependencies

Where and having clause in sql, WHERE and HAVING clause in SQL ? The WH...

WHERE and HAVING clause in SQL ? The WHERE clause is commonly used for implementing conditions on each tuple of the relation. The HAVING clause is used in combination along wi

What are the object-oriented approaches, What are the object-oriented appro...

What are the object-oriented approaches Software systems which are designed with structured design methodology never support some of desired quality attributes for example reus

Develop a web site to present decision tree structure, I am going to develo...

I am going to develop a web site to present decision tree structure. For this, I want a web application with AJAX technology to connect the database and prepare the decision tree's

Relational algebra, Relational Algebra is a set of basic operations used to...

Relational Algebra is a set of basic operations used to influence the data in relational model. These operations allow the user to specify basic retrieval request. The result of re

Domain constraint, Domain Constraint It shows that each attribute in a ...

Domain Constraint It shows that each attribute in a relation has to contain an atomic value only from the corresponding domains. The data types associated with commercial RDBMS

How to rearrange classes and operations, Rearrange Classes and Operations ...

Rearrange Classes and Operations Sometimes, the similar operation is defined across different classes and can easily be inherited from a familiar ancestor, but more often oper

Determine the advantage of object-orientation, Determine the advantage of o...

Determine the advantage of object-orientation Finally, object-orientation has advantage of continuity throughout analysis, persistent representation and design implementation.

Define rule that value of foreign key appear in other table, Determine the ...

Determine the rule that a value of a foreign key should appear as a value of some particular table is called a  Ans: Referential constraint.    The rule that a value of a fo

Explain b-tree, What is B-Tree? A B-tree eliminates the redundant stora...

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd