Develop a fragment of a hypothetical system, Database Management System

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.

Posted Date: 3/9/2013 2:30:08 AM | Location : United States







Related Discussions:- Develop a fragment of a hypothetical system, Assignment Help, Ask Question on Develop a fragment of a hypothetical system, Get Answer, Expert's Help, Develop a fragment of a hypothetical system Discussions

Write discussion on Develop a fragment of a hypothetical system
Your posts are moderated
Related Questions
Define canonical cover? A canonical cover Fc for F is a set of dependencies like F logically implies all dependencies in FC and Fc logically shows all dependencies in F.

Define Atom of domain relational calculus An atom has the outline 1 , x 2 , ... , x n > -> r , in which r stands for a relation on n attributes and x 1 , x 2 , ... , x n ar

how many types of data model in DBMS? explain data abstraction with its different level

Can a filed occur in several field groups. Yes.  But it leads to redundant data redundancy.

Index And Tree Structure Let us talk about the data structure that is used for creating indexes. Can we use Binary Search Tree (BST) as Indexes? Let us initial reconsider

Describe the Association: Design  Before we describe association design let us define association "Association is set of links between two objects in the object model". It is

Do the 11.1 11.1 Credit Card Use. Consider the following hypothetical bank data on consumers’ use of credit card credit facilities in Table 11.3. Create a small worksheet in Exce

Write a program within embedded SQL to associative the total trip expenses of the salesman named ‘John' for the relations. EXEC SQL BEGIN DECLARE SECTION; long total_expenses;

Question 1 Discuss the classification of DBMS based on location of database Question 2 Explain with examples different SQL commands used for creating and deleting relations.

Define the categories of SQL Statements? 1) Statements that don't return a result set. This statement class includes INSERT, DELETE, and UPDATE. 2)Statements that return