User Account

All Pages

eer diagram, Database Management System

Assignment Help:
Design an EER schema for the following application and
translate the EER schema into relational schemas (and
constraints). It is possible that some requirements cannot
be captured by the EER schema and some constraints
in the EER schema cannot be captured in your relational
schemas. Identify these and describe them in succinct
manner if there are any. List additional reasonable assumptions
if you definitely need them
The facilities consist of a number of sports complexes.
A sports complex has a unique address, and
has an area.
 Sports complexes are divided into two types: the
single sport type and the multi-sport type. No other
types of sports complex exist.
 Each multi-sport complex is partitioned into different
parts; each part has a location indicator (e.g.
center, NE corner, ...) indicating where it is within
the complex; each such part is allocated to exactly
one sport.
 Each complex has exactly one chief organizing person.
 Each complex will hold a number of events (e.g. different
stages of swimming competitions).
 Each event is identified by an event ID, and for each
event there is a planed date, duration, number of
participants, number of officials, and so on.
 We want to keep track of which officials participate
in which event. (But for simplicity we do not keep
track of the sport persons in the event.)
 There are two types of persons that we want to keep
track of: Organizing persons, and Officials. Each
person is identified by a person ID, and has a name
and sex.
 Different equipments are needed for different events.
We are only interested in equipments that are needed
by at least one event.

Related Discussions:- eer diagram

Intersection, If R1 and R2 are two union compatible relations or functions,...

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

Define the term- having clause and a where clause, What is the difference ...

What is the difference between a HAVING CLAUSE and a WHERE CLAUSE? HAVING CLAUSE - HAVING CLAUSE is used only with SELECT statement. - It is normally used in a GROUP BY

Prove that a relation which is 4nf must be bcnf, Prove that a relation whic...

Prove that a relation which is 4NF must be BCNF.   Ans Let R be in 4NF.  Suppose it is not in BCNF.  Hence, there exists an FD X→Y in R such that x is not a super key. Although

What are the parts of sql language, What are the parts of SQL language? ...

What are the parts of SQL language? The SQL language has various parts: data - definitition language  Data manipulation language  View definition  Transaction contr

Explain the term - handling boundary condition, Explain the term - Handling...

Explain the term - Handling Boundary Condition These are some circumstances that to be handled in any system initialization and termination. Describes how system is bro

Draw the E/R diagrams, for the following business rules . Identify all enti...

for the following business rules . Identify all entities, attributes, relationships, primary keys, cardinalities and constraints where appropriate 3. (9) An art museum owns a larg

Describe the advantage of state chart diagram, Describe the advantage of St...

Describe the advantage of State chart Diagram A state chart represents a state machine, emphasizing flow of control from one state to other. A state machine is a behaviour whi

Keys - relational database integrity, Candidate Key:  In a relation R, a ca...

Candidate Key:  In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1)        Uniqueness:                N

Sorting-stacks, 1. Identify the comparisons and exchanges made to sort the ...

1. Identify the comparisons and exchanges made to sort the following array using the selection exchange sort technique. Note: you may not need all columns. Ori

Process-oriented decompositions, Process-oriented decompositions Pr...

Process-oriented decompositions Process-oriented decompositions divide complex process, task or function into simpler sub processes until they get simple enough to be deal

Write Your Message!

Captcha
Order Assignment

Featured Services

Order Now

Popular Subjects

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!

Submit Assignment

Academics

Major Subjects

Majors

Get In Touch

whatsapp: +91-977-207-8620

Phone: +91-977-207-8620

Email: [email protected]

TERMS & POLICIES

HELP & SUPPORT

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