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

Definitions and discussion on best-average-worst case

Definitions and discussion (0-complexity of algorithms discussed: best-average-worst case, doubly linked list, trees, binary trees, binary search trees, AVL, and b-tree.

Design a simple algorithm by giving pseudocode

Design a simple algorithm by giving pseudocode, for constructing a binary search tree T on n elements in O(nlogn) time with the property that any Find operation on T takes O

Describe why algorithm runs in on time

Assume you have the array A of n items, and you want to find k items in A closest to the median of A. Describe why your algorithm runs in O(n) time.

Writing the opeartors which contains the states

I want help with writing the opeartors which contains the states includiing its precondition and action for the eight queens problem. that is placing 8 pieces (the queens) o

What are the icmp type and code numbers

Examine the corresponding ping reply packet. What are the ICMP type and code numbers? What other fields does this ICMP packet have? How many bytes are the checksum, sequence

How implement both a push and pop instruction

A computer has 8 general purpose registers (R0 to R7) but does not have PUSH or POP instructions. The computer does have the register indirect with auto increment mode (post

Create program algorithm in pseudocode to store quiz grades

The elementary school for which you are doing development work has asked you to create a program algorithm in pseudocode to store quiz grades for the students of a class

Evaluate a virtual memory system

The objective of this lab is to simulate and evaluate a virtual memory system, and experiment with different page replacement algorithms. You will need a threads package, e.


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