Granularity in the Data Warehouse. Raw Estimate  The raw estimate of the number of rows of data that will reside in the data warehouse tells the architect.

Slides:



Advertisements
Similar presentations
Making It Happen! Bill Morland Orange County SCORE
Advertisements

The Aged Care Standards and Accreditation Agency Ltd Continuous Improvement in Residential Aged Care.
Software Process Models
1 CS 151: Digital Design Chapter 5: Sequential Circuits 5-3: Flip-Flops I.
Chapter 3 IFTHENELSE Control Structure © 2008 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved. Marilyn Bohl/Maria Rynn Tools for Structured.
Chapter 2 - Problem Solving
Systems in Technology Objectives:  Define: system, component, troubleshooting, feedback, and automation  Draw and label an open and closed loop systems.
Sample Size Estimation and Re- Estimation Break-out Session.
Optimization of pilot Locations in Adaptive M-PSK Modulation in a Rayleigh Fading Channel Khaled Almustafa Information System Prince Sultan University.
Paper Title Your Name CMSC 838 Presentation. CMSC 838T – Presentation Motivation u Problem paper is trying to solve  Characteristics of problem  … u.
CS351 © 2003 Ray S. Babcock Cost Estimation ● I've got Bad News and Bad News!
CS107 Introduction to Computer Science Lecture 5, 6 An Introduction to Algorithms: List variables.
Storage Assignment during High-level Synthesis for Configurable Architectures Wenrui Gong Gang Wang Ryan Kastner Department of Electrical and Computer.
Blind Search-Part 2 Ref: Chapter 2. Search Trees The search for a solution can be described by a tree - each node represents one state. The path from.
T T20-00 Range Chart Control Limit Calculations Purpose Allows the analyst to calculate the "Range Chart" 3- sigma control limits based on table.
BPC.1 Basic Programming Concepts
Software Verification and Validation (V&V) By Roger U. Fujii Presented by Donovan Faustino.
Introduction - The Need for Data Structures Data structures organize data –This gives more efficient programs. More powerful computers encourage more complex.
1 A Introduction to Data Structures and Algorithm Analysis Data Structures Asst. Professor Kiran Soni.
DATA STRUCTURE Subject Code -14B11CI211.
 A data processing system is a combination of machines and people that for a set of inputs produces a defined set of outputs. The inputs and outputs.
Brute Force Search Depth-first or Breadth-first search
1 ECE 453 – CS 447 – SE 465 Software Testing & Quality Assurance Instructor Kostas Kontogiannis.
Artificial Neural Nets and AI Connectionism Sub symbolic reasoning.
2Object-Oriented Analysis and Design with the Unified Process The Requirements Discipline in More Detail  Focus shifts from defining to realizing objectives.
Algorithms and Algorithm Analysis The “fun” stuff.
Table of Contents Unit 1- Understand the Problem Unit 2- Gather Information Unit 3- Develop Solutions Unit 4- Implement A Solution Unit 5- Test and Evaluate.
ICT IGCSE.  Introducing or changing a system needs careful planning  Why?
To the Computer Lab at Saint Bridget School  I will trust you until you give me reason to do otherwise.  I will work with you to solve problems.
IFS310: Module 3 1/25/2007 Fact Finding Techniques.
1 CSCI N201 Programming Concepts and Database 9 – Loops Lingma Acheson Department of Computer and Information Science, IUPUI.
1 Modeling System Requirements with Use Cases. 2 Why Do We Need Use Cases? Primary challenge in a system design process –ability to elicit correct and.
Data Structures and Algorithms Dr. Tehseen Zia Assistant Professor Dept. Computer Science and IT University of Sargodha Lecture 1.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
Granularity in the Data Warehouse Chapter 4. Raw Estimates The single most important design issue facing the data warehouse developer is determining the.
How Are Computers Programmed? CPS120: Introduction to Computer Science Lecture 5.
Chapter Topics 2.1 Designing a Program 2.2 Output, Input, and Variables 2.3 Variable Assignment and Calculations 2.4 Variable Declarations and Data Types.
1 Programming in C++ Dale/Weems/Headington Chapter 9 Additional Control Structures (Switch, Do..While, For statements)
Granularity in the Data Warehouse Chapter 4. Raw Estimates The single most important design issue facing the data warehouse developer is determining the.
FLOWCHARTING AND ALGORITHMS
To RAD or not to RAD? RAD is the relatively new kid on the block. You know the one. The one with all the flashy stuff and is practically the Usain Bolt.
MIS 321 PS 2 FACT FINDING METHODS: SURVEY AND INTERVIEW.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
12-Jun-16 Event loops. 2 Programming in prehistoric times Earliest programs were all “batch” processing There was no interaction with the user Input Output.
CHAPTER #7 Problem Solving with Loop. Overview Loop logical structure Incrementing Accumulating WHILE/WHILE-END FOR Nested loop Pointer Algorithmic instruction.
Chapter 2: Input, Processing, and Output
Event loops 16-Jun-18.
C++ coding standard suggestion… Separate reasoning from action, in every block. Hi, this talk is to suggest a rule (or guideline) to simplify C++ code.
Gary Hughes, South Oakleigh College
Introduction to Algorithms
Chapter Topics 2.1 Designing a Program 2.2 Output, Input, and Variables 2.3 Variable Assignment and Calculations 2.4 Variable Declarations and Data Types.
PowerPoint presentation
Workflow materials models: template 1
Chapter 14 of Sterman: Formulating Nonlinear Relationships
Cause and Effect Graphing
Algorithms & Pseudocode
Event loops.
For Loops.
Cost Estimation I've got Bad News and Bad News!.
Event loops 17-Jan-19.
Event loops 17-Jan-19.
Control Controlling is determining what is being accomplished, that is , evaluating the performance and , if necessary , applying corrective measures so.
Project name and logo Workflow materials models: template 1
Event loops 8-Apr-19.
ICS 3U Thursday, September 9.
Software Effort Estimation
WJEC GCSE Computer Science
Joint Application Development (JAD)
Event loops.
Event loops 19-Aug-19.
Presentation transcript:

Granularity in the Data Warehouse

Raw Estimate  The raw estimate of the number of rows of data that will reside in the data warehouse tells the architect a great deal.  Example of an algorithmic path to calculate the space occupied by a data ware house.

Input to the Planning Process Space estimates, row estimates Are dual levels of granularity needed? How much DASD is needed ? How much lead time for ordering can be expected ?

Data in Overflow ?  What is data overflow ?  How it could happen and how to solve that problem ?  Overflow Storage ? How to solve it ?

What the Levels of Granularity Will Be  Rule of Thumb : if 50% of the first iteration of design is correct,the design effort has been a success  Building very small subsets quickly and carefully listening to feedback  Prototyping  Looking at what other people have done  Working with an experienced user  Looking at what the organization has now  JAD sessions with simulated output

Some Feedback Loop Techniques  Build the first parts of the data warehouse in very small, very fast steps, and carefully listen to the end users comments at the end of each step of development. Be prepared to make adjustments quickly.  If available, use prototyping and allow the feedback loop to function using observations gleaned from the prototype.  Look at how other people have built their levels of granularity and learn from their experience.  Go through the feedback process with an experienced user who is aware of the process occurring.  Look at whatever the organization has now that appears to be working, and use those functional requirements as guideline.  Execute joint application design (JAD) sessions and simulate the output in order to achieve the desired feedback

Granularity of data can be raised by  Summarize data from the source as it goes into the target  Average or otherwise calculate data as it goes into the target  Push only data that is obviously needed into the target  Use conditional logic to select only a subset of records to go into the target.

Levels of Granularity – Banking Environment  Example