Develop a fragment of a hypothetical system, Database Management System

Assignment Help:

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 object-relational design

 - to make you aware of the differences between set-processing and block-structured programming paradigms

 - to present an opportunity to practice problem solving and communication skills.

TASK

Develop a fragment of a hypothetical System for Timely Recording IN Global Yo-yoing (STRINGY), whose underlying logical data model includes the following entities:

  • COMPETITOR - an entrant to one or more of the federation's events
  • EVENT - each event is specified in terms of the number and type of yo-yos, the length of the string, and any other, more specific rules (e.g. The player must use two long spinning yo-yos and perform tricks with both simultaneously)
  • COMPETITION - a selected set of events, in which competitors collect points towards an overall competition winner. Each competition will be specified for a particular class of event (e.g. Single, unattached yo-yo). Occasionally, a single event will form a part of more than one competition.
  • VENUE - The location of each event. Several events will take place during an afternoon or evening, at the same venue.
  • CLUB - competitors may belong to a club. Competition results also contribute to annual club trophies for each event class, awarded to the club whose members receive the most competition points that year, in that class.

STRINGY is to be used by the UK Yo-yo Society to monitor and manage the results of each event, and the individual and club competitions. It also needs to manage the allocation of events to venues. Use the first deliverable to clearly state any other assumptions that you make, and any additions or changes to the outline data model above.

DELIVERABLES  

Deliverables are divided into two stages.

Stage 1 submission is due on Friday, week 5, 4th March 2011, and should contain

(1) Specification of the scope and functionality of your system.

(2) Logical data model: 

EAR scheme and its relational representation. RI diagram with its concise but informative description.

Stage 2 is due on Friday, week 10, 15th April 2011, and should contain:

(3) Identification of functional dependencies and normalisation of tables. Table definition & population with the relevant data:         

SQL code + final data set (presented in an Appendix). The use of sqlloader is encouraged but not required.

(4) A transaction (delete_X) that causes the biggest propagation effect (i.e. affects most of the database tables),

      appropriately designed and coded in SQL:

                • specification of pre- and post-conditions

                • definition of input & output

                • processing logic and the SQL code

                • illustrative test run.                                                                                                                      

(5) A non-trivial query (e.g. involving multiple joins, group functions, qualifiers, correlation variables) appropriately designed and coded in SQL.


Related Discussions:- Develop a fragment of a hypothetical system

Explain the relational completeness, Explain the Relational Completeness ...

Explain the Relational Completeness Codd described the term relational completeness to consider to a language that is complete with respect to first-order predicate calculus ex

Forward recovery (redo), Forward Recovery (Redo): In this system the commit...

Forward Recovery (Redo): In this system the committed changes made by a transaction are reapplied to a previous copy of the database.                          In simpler

Explain how the law ensures data protection and security, Question 1: (...

Question 1: (a) Explain the legal meaning of :- (i) Computer Service Person (ii) Data holding (b) Explain how the law ensures Data protection and Security. Qu

What is alternate key, What is Alternate Key Alternate Key: This is t...

What is Alternate Key Alternate Key: This is the candidate key which is not taken as the primary key of the table. They are named so because although not the primary key, the

What is entity in dbms, What is entity in DBMS? Entity: A DBMS entity i...

What is entity in DBMS? Entity: A DBMS entity is either a thing in the modelled world or a drawing element in an ERD.

What is bankers algorithm, What is banker's algorithm?  Banker's algori...

What is banker's algorithm?  Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple instances of each resource ty

Define an operator that a relational algebra does not have, Define an opera...

Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.

Backward recovery (undo), Backward Recovery (UNDO): In this system the unco...

Backward Recovery (UNDO): In this system the uncommitted changes made by a transaction to a database are undone.  Instead the system is reset to the last consistent state of databa

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