Normalized relations for a database

Assignment Help Data Structure & Algorithms
Reference no: EM1380299

Consider the following normalized relations for a database in a large retail store chain:

EMPLOYEE(Emp_Id, Work_Location, Name, Address)
STORE(Store_ID, Region, Manager_ID, Square_Feet)
DEPARTMENT(Dep_ID, Manager_ID, Sales, Goal)
SCHEDULE(Dep_ID, Emp_ID, Date)

Suppose that a information communications network links a computer at corporate headquarters with a computer in each retail outlet. The chain includes fifty stores with an average of 75 workers per store. There are 10 departments in each store. A daily schedule is maintained for 5 months (the previous 2 months, the current month, and next 2 months). Further assume that:

- Each store manager updates the employee work schedule for her or his store
roughly five times per hour.

- The corporation generates all payroll checks, employee notices, and other
mailings for all employees for all stores.

- The corporation establishes a new sales goal each month for each department.

- The corporation hires and fires store managers and control all information about
store managers; store managers hire and fire all store employees and control all
information about employees in that store.

a. Would you recommend a distributed database, a centralized database, or a set of decentralized databases for this retail store chain? Justify your answer.

b. Assuming that some form of distributed database is justified, what would you recommend as a data distribution strategy for this retail store chain? Justify your answer.

Reference no: EM1380299

What is the running time of the algorithm that creates tree

What is the running time of the algorithm that creates the tree? where the measure of the size of the program is the number of rows (n|) and the number of bytes (k|) in the

Prompt the user for the name and age of a group of people

When the user finishes, the program should print each person in order from the youngest to the oldest, that is, the program should sort by age. Implement/use a sorting algor

Create an algorithm to produce list of customers

Create an algorithm to produce list of customers from Glad Rags Clothing Company's customer master file. Each record on customer master file contains the customer's number

Find the two closest points from the list

Show how the algorithm would proceed to find the two closest points from the list [(1,2),(1,11),(7,8),(9,9),(12,13),(13,4) ,(20,8),(22,3),(23,12),(25,14),(26,7)(31,10)].

Write a program for page replacement policy using fifo

Write a program for page replacement policy using FIFOthe program should contain a physical and cache memory array and use replacement to display replacement stepwise in C.

Implement the dynamic-set operation insert

Can you implement the dynamic-set operation INSERT on a singly linked list in O(1) time? How about DELETE - what is the maximum number of keys that can be stored in a B-tree

Design algorithm to produce list of customers

Design an algorithm to produce a list of customers from the Glad Rags Clothing Company's customer master file. Each record on the customer master file contains the custom

Implement the missing methods for class mygraph

Implement the missing methods for class MyGraph which implements the interface Graph where the Integer is a vertex index (0..n-1) and the Double is the edge weight (distanc

Reviews

Write a Review

 
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