Cube building in dataware housing , Database Management System

1) Define 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.
Posted Date: 3/27/2013 12:57:15 PM | Location : USA







Related Discussions:- Cube building in dataware housing , Assignment Help, Ask Question on Cube building in dataware housing , Get Answer, Expert's Help, Cube building in dataware housing Discussions

Write discussion on Cube building in dataware housing
Your posts are moderated
Related Questions
Question: (a) e-Government implementations normally evolve through a multi-stage process. Describe, using appropriate examples, the stages involved in an e-Government implemen

What are called journaling file systems? File systems that support log disks are known as journaling file systems.

the of super market system done in database

what benefit can a company gain by managing its own infrasture and services

Define the term- Actors and Data Stores Actors: An actor is the active object which drives data flow graph by producing or consuming values. Actors are attached to inputs a

Functional Dependency Consider a relation R that has 2 attributes A and B. The attribute B of the relation is functionally dependent on the attribute A if and only if for every

what does glory be mean

MOSS VALE is a town with 15000 inhabitants. The fire department wishes to develop a system that automates the despatch of fire engines to attend fires. The ERD below describes the

i want answers this assignment now if yiu can maket for me now ?

What is called as an N-way merge? The merge operation is a generalization of the two-way merge used by the standard in-memory sort-merge algorithm. It merges N runs, so it is k