dataware house, Database Management System

) 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/29/2013 12:58:21 AM | Location : USA







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

Write discussion on dataware house
Your posts are moderated
Related Questions
Determine Which is not a consequence of concurrent operations? Ans: Update anomaly.

a. Define the term "deadlock". There are four conditions that must hold before deadlock is possible. Name them. b. Outline an algorithm that detects whether there is a deadlock.

various techniques of hashing?

What will be create when a primary key if combined with a foreign key? A primary key if combined with a foreign key it creates Parent-Child relationship between the tables that

Foreign Keys and NULL Let us take the relation:                 DEPT DEPT ID DNAME BUDGET D1 M

Differance between procedural and non procedural DML? Procedural and non procedural DML Procedural DML exactly what data is require and how to obtain those data. Non procedural

Discuss the problem of Spurious tuples and how we may prevent it.    Ans:  A spurious tuple is, mainly, a record in a database that gets created while two tables are joined bad

Explain several types of constraints that can be specified using CREATE TABLE command. Explain CASCADE and RESTRICT clauses of DROP SCHEMA command? Constraint Description PRIM

What is a state chart diagram? State diagrams (State Chart Diagram) explain all possible states that a particular object can get into, and how object's state changes as result

I am doing research in this area, especially in sime join and join efficacy when several relations have been queried. Relations located in different sites. I need something like n