Assign, Database Management System

#quesDefine a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pictorial form so that it is easy to understand.
a. Finance cube (3 hours to build)
b. Warranty cube (4 hours to build)
c. Order cube (2 hours to build)
d. Customer master data (30 min run time)
e. Vendor master data (60 min run time)
f. Product master data (60 min run time)
g. Other Master data (2 hour run time)
Finance and Order cubes cannot run together.


2) Above cubes are used by NA and EU users, NA users will only use NA data and EU users will use only EU data but Master data is common for both NA and EU. The requirement of availability stays same for NA (6AM CST) and for EU reports/cubes should be available by 6am CET.

What changes you need to make to the job scheduling proposal of Question 1 to meet the requirement of Question
CST – NA Central Standard Time
CET - EU Central European Time.
tion..
Posted Date: 4/2/2013 12:07:31 PM | Location :







Related Discussions:- Assign, Assignment Help, Ask Question on Assign, Get Answer, Expert's Help, Assign Discussions

Write discussion on Assign
Your posts are moderated
Related Questions
Single Valued Normalisation  Codd in the year 1972 formed three normal forms (1NF, 2NF, and 3NF). These were based on functional dependencies between the attributes of a relati

anyone have a textbook solutions case fair, 8 edition of vol 1 ?, please give me

Show, with the help of an example, that relatively high-level transitions result when system or program is stimulated by the outside events. In diagram below, we can observe i

The First Normal Form (1NF) Let us first describe 1NF: Definition: A relation (table) is in 1NF if 1.      There are no duplicate tuples or rows in the relation. 2.

I need an ERD created for any original database(can be on anything). It needs to be 3NF. I then need all the CREATE STATEMENTS, INSERT STATEMENTS(anything you can think of as long

Define average seek time. The average seek time is the average of the seek times, calculated over a sequence of random requests.

For each 1: n relationship type R involving two entities E1 and E2, we recognize the entity type (say E1) at the n-side of the relationship type R and contain primary key of the en

Aggregation Aggregation is stronger form of association. It represents the "has-a" or "part-of" relationship. An aggregation association depicts a complex object which is comp

How persistent programming languages differ from traditional programming languages? Database languages vary from traditional programming languages in that they directly manipul

Relations create the database. They must satisfy various properties, like no duplicate tuples, no ordering of tuples, and atomic attributes, etc. Relations that satisfy these basic