DW, Database Management System

#ques
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.tion..
Posted Date: 4/2/2013 6:00:12 AM | Location : USA







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

Write discussion on DW
Your posts are moderated
Related Questions
Java program for horrizontal fragmentation in distributed database

Discuss the differences among the candidate keys and the primary key of a relation. Give instance to describe your answer? A candidate key is one that can be used as primary ke

Illustrate the Deployment Diagram A deployment diagram shows all nodes on network, their processor execution and interconnections. In a dynamic model, this is used to represen

Data Handling and Research Methods: The dataset encompassing 130 participants contains several variables measuring detrimental health related behaviours referring to the use o

Object-based Models: Use objects as key data representation components . Examples:-   Entity-Relationship Model: It is a collection of real world objects known as entitie

DDL Compiler The DDL compiler changes the data definition statements (such as CREATE TABLE .... in SQL) into a set of tables having metadata tables. These tables have infor

Table Handling  In RDBMS more than one table can be tackled at a time by using join operation. Join operation is a relational operation that causes 2 tables with a common domai

What is Normalization? Database normalization is a data design and organization method applied to data structures based on rules that help building relational databases. In rel

construct a B+ tree for the following set of key value (2,3,5,7,11,19,23,29,31) in ascending order where the pointers that will fit in one node is as follows:A. four B. six C. eigh

Explain the difference between optimistic locking and pessimistic locking. Optimistic locking supposes no transaction conflict will occur and deals with the consequences if it