Explain equivalent relational schema, Database Management System

Assignment Help:

Question:

(a) Use the following business rules to produce the E-R diagram. You should clearly show all the minimum and maximum cardinality constraint on each side of the relationship.

King Car Enterprise runs a high quality car sales operation for which they provide a complete customer after sales service. In order to provide this service they keep records of the service needs of each type of car that they sell. This information includes how often a service is required in terms of the number of months between services and the distance covered. A car is serviced either when a predefined period has elapsed or the vehicle has covered a specific distance, whichever is the sooner.

A record is kept of the names and addresses of car owners. For each car that a customer owns a record is kept of the registration number of the car, the type of car, the date it was sold to the customer, the recorded distance traveled by the vehicle and the average distance undertaken by the owner per month.

When a customer makes a booking for a service a record is kept of the registration number of the vehicle and the date for which the service has been booked. Finally, a record is kept of the service history of a car which includes the dates upon which the vehicle was serviced, the registration number of the vehicle and the vehicle mileage when the service was carried out.

The primary goal of the computer system is to be able to send reminders to customers that a vehicle they own is due for service.

(b) Map the ERD produced above into its equivalent Relational Schema.


Related Discussions:- Explain equivalent relational schema

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

Explain candidate key and super key, Explain Candidate Key and Super Key ...

Explain Candidate Key and Super Key A super key is a set of one or more than attributes that, taken collectively, permits us to identify uniquely a tuple in the relation. Wher

Heuristics, Benefits of using heuristics

Benefits of using heuristics

Consistency-transaction , Consistency: This property makes sure that a com...

Consistency: This property makes sure that a complete transaction implementation takes a database from one consistent state to another consistent state. If the transaction fails e

Database, why are older data models are being replaced by new data models

why are older data models are being replaced by new data models

Difference between functions along with or without grouping, Explain the di...

Explain the difference between using functions along with and without grouping attributes in relational algebra. Give examples. Ans: Group functions are used to group data of

Develop a fragment of a hypothetical system, The objectives of this assignm...

The objectives of this assignment are:  - to develop skills in the design of database driven applications  - to develop skills in applying SQL to implement the relational and

Dbms, statical data

statical data

Describe domain constraints, Describe domain constraints. Domain constr...

Describe domain constraints. Domain constraints contain entity integrity and referential integrity. The domain is a set of values that might be assigned to an attribute. The en

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