How Oracle Essbase Aggregate Storage Option
|
|
- Martin Mathews
- 6 years ago
- Views:
Transcription
1 How Oracle Essbase Aggregate Storage Option and how to Dan Pressman Blog: Jun 24, 2014 Seattle, WA
2 Warning Danger! The Information and techniques in this presentation will soon be So sayeth Gabby Rubin So sayeth Kumar Ramaiyer
3 Warning Danger! But they won t sayeth WHEN We all look forward to that day! But in the meantime As governed by Oracle NDA and advance disclosure requirements and other legally necessary equivocations.
4 Assumption, Basis and a Caveat Caveat: No secret discussions with Essbase developers Based on documentation, patent filings, and empirical testing Use accordingly.
5 Assumption, Basis and a Caveat Assumption: Basic understanding of ASO cubes Basis: My chapter, How ASO Works and How to Design for Performance in: Developing Essbase Applications: Advanced Techniques for Finance and IT Professionals
6 Who Has Seen an ASO Cube? By a show of hands: How many of you actually have seen an ASO cube?
7 Who Has Seen an ASO Cube? Really? You ve looked inside the computer and seen an ASO cube?
8 An ASO Cube You Can Hold in Your Hand Still made and used for field identification of minerals. Similar guides are available for Trees and Birds.
9 Card Used With Sorting-Needle Holes represent metadata presence; notches represent absence. Note notches for all levels (67510, Abbyville, Kansas and Central). Query for Check and Adult = ((Check) AND Adult)
10 Data Is Queried Using a Sorting-Needle Cards with holes are pulled up and used for next part of query; cards with notches fall out. Check and adult = ((Check) AND (Adult))
11 Query Performance is Dependent on Length of Sorting-Needle Size of card box Not based on level of query Upper-level data queried as fast as Level 0 Is based on number of Dimensions queried Each Dimension requires another pass of the Sorting-Needle Unless you have the new
12 Patented Multi-Processor Sorting-Needle
13 Card Used With Multi-Processor Sorting-Needle Logic is reversed with multi-processor sorting-needle (holes represent absence of metadata; notches represent presence). Multi-processor needle query pulls cards NOT matching the query. Query for Check and Adult = NOT(NOT(Check) OR NOT(Adult))
14 The Cards Card-based systems widely used in 1960 s Fact data printed on card face Manual aggregation of Fact data after query completion
15 Level 0 bitmap mask New York, Jan, Cola Bitmap mask Aggregated values
16 Moving up the bitmap New York, Qtr1, Cola Bitmap mask Aggregated values
17 A little higher Colas, East, Qtr1 Bitmap mask Aggregated values
18 Almost at the top Year, Colas, East Bitmap mask Aggregated values
19 Top of the stack Product, Market, Year Bitmap mask Aggregated values
20 ASO Essbase vs. The Cards Holes and notches represented by bitmap, as seen on DB statistics page Upper-level membership coded into bitmap Fact data Multiple pieces often on single card Equivalent to ASO Compression dimension Computers are fast at running query through card stack and summing Fact data Often a hardware instruction
21 ASO Essbase vs. The Cards Complex query results are calculated only after all Sorting-Needle queries Equivalent to ASO Stored Hierarchy summations Complex query results are equivalent to MDX Sorting-needle length and Card-box size equivalent to amount of RAM
22 ASO Rule R1 R1 - The Input-level and Aggregation-data for all loaded ASO cubes should fit into memory (or it ain t really ASO) Card-deck Queries: If cards don t fit into single box, you d have to: Fetch Box 1 Perform query on Box 1 and store results Repeat for all boxes Fetch combined results
23 ASO Rule R1 R1 - The Input level and Aggregation-data for all loaded ASO cubes should fit into memory (or it ain t really ASO) ASO Queries: Fetch data for Stored Hierarchy portion of query in pieces and sum results Performance primarily related to memory footprint of input data
24 A BSO Analogy Dynamic calcs first seen in v5 Essbase Reduced disk size of dense data blocks Allowed elimination of dynamic sparse blocks ASO is logical extension of Dynamic calcs ASO design can be summarized thus:
25 Pop s Rule Pop s Rule - Computers do arithmetic fast - but they don t like to run errands My father (hardware designer in late 1940 s) taught me at age 10 this way: Two numbers and their sum were written on separate pieces of paper and placed in another room I could fetch only one piece of paper at a time I was timed fetching: 3 pieces of paper vs. 2 and adding them Even at age 10, I could add faster than I could fetch ASO works the same way
26 The Rest of the Rules Remaining rules derived from analysis of Bitmap, as on Statistics page Bitmap documentation first appeared in v11 DBAG Chapter 62 page 934: An aggregate storage database outline cannot exceed 64-bits per dimension Note: ASOsamp application shown in DBAG differs slightly from delivered ASOsamp. To replicate DBAG results, modify your ASOsamp to match example.
27 The Bitmap and the Statistics Page
28 Highlights from the Bitmap Bitmap Size based on: Width of widest level Number of levels Bitmap rounded up to next higher 64-bit level Cube size dependent on: Bitmap size Number of data rows, modified by Compression dimension settings
29 The Rules of ASO Designing for Performance 12+1 Rules numbered in order developed Selected Rules discussed in simplest order For more detail: See my chapter in Developing Essbase Applications Note: I did not write this book to get rich! My shameless plugs are only for my vanity and your use
30 The Rules of ASO Designing for Performance R1 - The Input level and Aggregation-data for all loaded ASO cubes should fit into memory (or it ain t really ASO) R2 - Wherever possible, data should be calculated from Stored non-formula Members R3 - All queries against the same aggregation level take the same time R4 - Do not depend on aggregation or other Maintenance to make up for bad design R5 - Alternate hierarchies, whether Dynamic or Stored or Attribute, are almost always cheap give the user what they want
31 The Rules of ASO Designing for Performance R6 - Label-Only members have no cost - use them to enhance your cube s readability R7 - Changes to hierarchy order are cheap or free, so design for user convenience R8 - Designs requiring queries of multiple Attributes of the same base dimension may suffer performance degradation - evaluate and consider alternatives R9 - The use of a Compression dimension is not a given; consider and test alternatives including not having a Compression dimension
32 The Rules of ASO Designing for Performance R10 - The use of the Accounts dimension tag has substantial costs - alternatives should be considered strongly R11 - Analysis dimensions are cheap or free - use them R12 - A query will be run against the smallest View whose aggregation level on each dimension is less than or equal to the aggregation level of the query (for the same hierarchy) - you do not have to create Aggregated Views on all dimensions And One More Rule: Pop s Rule - Computers do arithmetic fast - but they don t like to run errands
33 Rules R2 and R3 R2 - Wherever possible, data should be calculated from Stored non-formula Members R3 - All queries against the same aggregation level take the same time Card-deck analogy makes R2 apparent All queries resolved as MDX combination of one or more Stored Hierarchy queries Objective is to eliminate or more
34 Rules R2 and R3 R2 - Wherever possible, data should be calculated from Stored non-formula Members R3 - All queries against the same aggregation level take the same time Like a Sorting-Needle, ASO is dumb: Both go through entire deck for each query Unlike BSO, there s no sparse dimension index Bitmap reflects all dimensions: Which ones would you index, in what order?
35 Alternate Hierarchies Based on R2 R2 - Wherever possible, data should be calculated from Stored non-formula Members Load data with Natural Sign Positive and Negative Values Not + and consolidations Use UDA s to flip signs for presentation In high solve-order MDX
36 Alternate Hierarchies Based on R2 R2 - Wherever possible, data should be calculated from Stored non-formula Members Load Flow data, not Balance data YTD s don t change every period why load them? Load BoY and Period deltas Reconstruct YTD values using: MDX (boo hiss), or Stored Hierarchies (much faster) The Result: Major Reductions in Cube Size If your only data source is YTD, load it; then load again reversed to following month
37 Alternate Hierarchies Based on R2 R2 - Wherever possible, data should be calculated from Stored non-formula Members Avoid Summing using MDX Use compound members to recreate YTD values JunYTD instead of (Jun, YTD) Construct Stacked Hierarchies to calculate Hide ugly stacked hierarchies Use MDX to redirect queries from (Jun YTD) or (Jun, YTD) to JunYTD
38 Monthly Stacked Hierarchy
39 Monthly Stacked Hierarchy New! Blurred concatenation formula replaced with
40 Monthly Stacked Hierarchy New Info a simple case statement to avoid performance issues:
41 Rule R10 R10 - The use of the Accounts dimension tag has substantial costs - alternatives should be considered strongly Rule is restatement of R2, specific to Accounts dimension Use of Accounts Dimension Tag forces entire Accounts dimension to be Dynamic
42 Rule R9 R9 - The use of a Compression dimension is not a given; consider and test alternatives including not having a Compression dimension Tagging a dimension Compression forces it to be Dynamic Are there Intra-dimension calculations that could have used Stored Hierarchies? What is cost, in terms of increased memory footprint, of forgoing Compression?
43 Rule R9 R9 - The use of a Compression dimension is not a given; consider and test alternatives including not having a Compression dimension If memory is available and Stored Hierarchy consolidation options exist: Then NO Compression performs fastest Use Compression Dimension Wizard Use Real data when evaluating Average Bundle Fill (ABF) and Average Value Length (AVL) must be based on realistic data
44 Rule R9 R9 - The use of a Compression dimension is not a given; consider and test alternatives including not having a Compression dimension ABF is optimal for multiples of 16 Level 0, non-formula members Follow DBAG recommendations for member order in outline AVL is optimal when data have fewer significant digits Note: Two digits after decimal seem to be optimized
45 Rule R12 - But First, What Is an Aggregation? R12 - A query will be run against the smallest View whose aggregation level on each dimension is less than or equal to the aggregation level of the query (for the same hierarchy) - you do not have to create Aggregated Views on all dimensions To visualize an Aggregation, think of card deck Aggregated Deck would have fewer cards Aggregated Deck would have shorter cards
46 Rule R12 - Data Card Representing Aggregation Aggregation at: Time L1, Stores L2 and Age L1 Can calculate how much shorter the Bitmap will be Cannot calculate how many cards, without checking every card in input level view (aka Level 0 view) L0 View: Bitmap: Cells: Rows: 63 Bits 1,249, ,156 Aggregated View: Bitmap: Cells: Rows: 54 bits??????
47 Rule R12 - What Is the Cost of an Aggregation? Time to Compute Accuracy based on ASOSAMPLESIZEPERCENT Disk/Memory Footprint Design wizard gives estimate only of Aggregation size ASOSamp Recommended Views: 24 Total 4 at L1 of Time (Qtr) 10 at L2 of Time (Half)
48 Rule R12 - What Is the Benefit of an Aggregation? Queries run on smaller stack of shorter cards Will all Aggregations be used? Recommended ASOsamp Aggregation: Levels 1&2 of Time - how often are Qtrs or Halves used? Consider adding hint into outline Better to have Aggregations that speed up YTDs YTDs are Stored Hierarchies now, right? Remember, Aggregations can be done only on Stored Hierarchies
49 Rule R12 R12 - A query will be run against the smallest View whose aggregation level on each dimension is less than or equal to the aggregation level of the query (for the same hierarchy) - you do not have to create Aggregated Views on all dimensions Important: Not all dimensions require Aggregation Some Aggregations, expected to be useful, will be used rarely (Rule R8)
50 Rule R5 R5 - Alternate hierarchies, whether Dynamic or Stored or Attribute, are almost always cheap give the user what they want Each dimension has fixed number of allocated bits Based on requirements of largest Alternate Hierarchy Therefore, only one Hierarchy is represented in Bitmap at any one time
51 Rule R5 R5 - Alternate hierarchies, whether Dynamic or Stored or Attribute, are almost always cheap give the user what they want Add all Alternate Hierarchies the users want Without increasing Bitmap size Performance is independent of number of Alternate Hierarchies Use them freely (unlike BSO!)
52 Rule R5 R5 - Alternate hierarchies, whether Dynamic or Stored or Attribute, are almost always cheap give the user what they want But if Alternate Hierarchy is not in Bitmap, how will Sorting-Needle work? I don t know but I have some guesses Several algorithms can be envisioned, but precise ASO method not disclosed
53 Rule R5 Even if we don t know how an Alternate Hierarchy is queried in Level 0 view, it s easy to imagine an upper-level Attribute Aggregation on the data card. Note: Square Footage Hierarchy never appeared on previous slides.
54 Rule R8 R8 - Designs requiring queries of multiple Attributes of the same base dimension may suffer performance degradation - evaluate and consider alternatives Attribute Dimensions are Alternate Hierarchies Only one Alternate Hierarchy in Bitmap at a time ASO must query an un-aggregated view of the dimensions Aggregation no longer knows the base associated Level 0
55 Rule R8 R8 - Designs requiring queries of multiple Attributes of the same base dimension may suffer performance degradation - evaluate and consider alternatives Includes anything other than topmost level of base dimension and Attribute dimension And at topmost level only if ALL Level 0 members roll up to it AND All Level 0 members are associated to each Attribute Dimension
56 Rule R8 R8 - Designs requiring queries of multiple Attributes of the same base dimension may suffer performance degradation - evaluate and consider alternatives First rule to consider when users ask: Why is cube slow sometimes? Why are some queries slower than others?
57 Other Suggestions Temp Tablespace A separate drive/spindle/channel Great place to employ SSD drives Operating System File Compression If you have CPU cycles, employ Pop s Rule: Try compressing primary tablespace directory Try compressing temp tablespace directory
58 Summary Buy more memory Use Stored Hierarchies Stop writing MDX!!! (No one will think less of you) Let ASO be ASO
59 Contact Information Dan Pressman ntuple, LLC TheEssbaseMechanic.wordpress.com See You Later in 2014 at:
60 Developing Essbase Applications Like the best, most advanced Essbase conference there ever could be Advanced content Good practices Written by some of the most well known Essbase developers Source code at You should buy it
61 Developing Essbase Applications My chapter, How ASO Works and How to Design for Performance includes: 12+1 Rules to guide your ASO Designs: Previously unpublished information based on the statistics page and documentation, and gleaned from related patent filings, all distilled into 12+1 Rules to guide your ASO Designs. These Rules will ensure that your cubes perform maximally, require less Aggregation, and have a minimal memory footprint. The 12+1 Rules emphasize the use of Stored Hierarchies and include real-world examples showing how to design around common requirements without using MDX and in conformance to the rules, to truly Let ASO be ASO. Much of this information is found nowhere else.
How Oracle Essbase Aggregate Storage Option. And How to. Dan Pressman
How Oracle Essbase Aggregate Storage Option And How to Dan Pressman San Francisco, CA October 1, 2012 Assumption, Basis and a Caveat Assumption: Basic understanding of ASO cubes Basis: My chapter How ASO
More information<Insert Picture Here> Implementing Efficient Essbase ASO Application
Implementing Efficient Essbase ASO Application Buland Chowdhury & Steve Liebermensch Senior Technical Director Agenda Basic Design Dimension settings and usage Partitioning Formulas
More informationQuestion No : 2 Identify four disadvantages / considerations when using a transparent partition.
Volume: 69 Questions Question No : 1 Which two are Essbase components? A. Essbase server B. Administration services C. C API D. Web Analysis E. Financial reporting Answer: A,B Question No : 2 Identify
More informationTop 10 Essbase Optimization Tips that Give You 99+% Improvements
Top 10 Essbase Optimization Tips that Give You 99+% Improvements Edward Roske info@interrel.com BLOG: LookSmarter.blogspot.com WEBSITE: www.interrel.com TWITTER: Eroske 3 About interrel Reigning Oracle
More informationKSCOPE11.COM/BIEPM. USE THE SPECIAL interrel CODE IRC TO RECEIVE A $100 DISCOUNT ON REGISTRATION
Oracle BI & EPM Tracks Essbase Hyperion Planning & HFM Beginner to Guru Content OBIEE 11g Hyperion Developers On-Site CONFERENCE HIGHLIGHTS 250+ Sessions Hands-on Training Six full-day Symposiums CHECK
More informationOracle Essbase XOLAP and Teradata
Oracle Essbase XOLAP and Teradata Steve Kamyszek, Partner Integration Lab, Teradata Corporation 09.14 EB5844 ALLIANCE PARTNER Table of Contents 2 Scope 2 Overview 3 XOLAP Functional Summary 4 XOLAP in
More informationExcel Basics Rice Digital Media Commons Guide Written for Microsoft Excel 2010 Windows Edition by Eric Miller
Excel Basics Rice Digital Media Commons Guide Written for Microsoft Excel 2010 Windows Edition by Eric Miller Table of Contents Introduction!... 1 Part 1: Entering Data!... 2 1.a: Typing!... 2 1.b: Editing
More informationHyperion Essbase Audit Logs Turning Off Without Notification
Hyperion Essbase Audit Logs Turning Off Without Notification Audit logs, or SSAUDIT, are a crucial component of backing up Hyperion Essbase applications in many environments. It is the equivalent of a
More informationUsing Microsoft Excel
Using Microsoft Excel Introduction This handout briefly outlines most of the basic uses and functions of Excel that we will be using in this course. Although Excel may be used for performing statistical
More informationEvolution or Revolution the new Hybrid Essbase. Cameron Lackpour Tim German Dan Pressman
Evolution or Revolution the new Hybrid Essbase Cameron Lackpour Tim German Dan Pressman Developing Essbase Applications Like the best, most advanced Essbase conference there ever could be Advanced content
More informationDATABASE PERFORMANCE AND INDEXES. CS121: Relational Databases Fall 2017 Lecture 11
DATABASE PERFORMANCE AND INDEXES CS121: Relational Databases Fall 2017 Lecture 11 Database Performance 2 Many situations where query performance needs to be improved e.g. as data size grows, query performance
More informationWelcome to Part 3: Memory Systems and I/O
Welcome to Part 3: Memory Systems and I/O We ve already seen how to make a fast processor. How can we supply the CPU with enough data to keep it busy? We will now focus on memory issues, which are frequently
More informationCreating Custom Financial Statements Using
Creating Custom Financial Statements Using Steve Collins Sage 50 Solution Provider scollins@iqacct.com 918-851-9713 www.iqaccountingsolutions.com Financial Statement Design Sage 50 Accounting s built in
More informationPlot SIZE. How will execution time grow with SIZE? Actual Data. int array[size]; int A = 0;
How will execution time grow with SIZE? int array[size]; int A = ; for (int i = ; i < ; i++) { for (int j = ; j < SIZE ; j++) { A += array[j]; } TIME } Plot SIZE Actual Data 45 4 5 5 Series 5 5 4 6 8 Memory
More information<Insert Picture Here> Optimizing ASO
Optimizing ASO Steve Liebermensch Consulting Technical Director The following is intended to outline our general product direction. It is intended for information purposes only, and
More informationLecture 16. Today: Start looking into memory hierarchy Cache$! Yay!
Lecture 16 Today: Start looking into memory hierarchy Cache$! Yay! Note: There are no slides labeled Lecture 15. Nothing omitted, just that the numbering got out of sequence somewhere along the way. 1
More informationMS Office 2016 Excel Pivot Tables - notes
Introduction Why You Should Use a Pivot Table: Organize your data by aggregating the rows into interesting and useful views. Calculate and sum data quickly. Great for finding typos. Create a Pivot Table
More informationChapter 12: Indexing and Hashing. Basic Concepts
Chapter 12: Indexing and Hashing! Basic Concepts! Ordered Indices! B+-Tree Index Files! B-Tree Index Files! Static Hashing! Dynamic Hashing! Comparison of Ordered Indexing and Hashing! Index Definition
More informationDivisibility Rules and Their Explanations
Divisibility Rules and Their Explanations Increase Your Number Sense These divisibility rules apply to determining the divisibility of a positive integer (1, 2, 3, ) by another positive integer or 0 (although
More informationChapter 12: Indexing and Hashing
Chapter 12: Indexing and Hashing Basic Concepts Ordered Indices B+-Tree Index Files B-Tree Index Files Static Hashing Dynamic Hashing Comparison of Ordered Indexing and Hashing Index Definition in SQL
More informationVariables and Data Representation
You will recall that a computer program is a set of instructions that tell a computer how to transform a given set of input into a specific output. Any program, procedural, event driven or object oriented
More informationMemory Hierarchy. Memory Flavors Principle of Locality Program Traces Memory Hierarchies Associativity. (Study Chapter 5)
Memory Hierarchy Why are you dressed like that? Halloween was weeks ago! It makes me look faster, don t you think? Memory Flavors Principle of Locality Program Traces Memory Hierarchies Associativity (Study
More informationCS161 Design and Architecture of Computer Systems. Cache $$$$$
CS161 Design and Architecture of Computer Systems Cache $$$$$ Memory Systems! How can we supply the CPU with enough data to keep it busy?! We will focus on memory issues,! which are frequently bottlenecks
More information2.3 Algorithms Using Map-Reduce
28 CHAPTER 2. MAP-REDUCE AND THE NEW SOFTWARE STACK one becomes available. The Master must also inform each Reduce task that the location of its input from that Map task has changed. Dealing with a failure
More informationSeagate Crystal Reports 8 and Hyperion Essbase
Seagate Crystal Reports 8 and Hyperion Essbase Seagate Crystal Reports 8 provides dramatic improvements in OLAP reporting for users of Hyperion Essbase and all other supported OLAP systems. Now more than
More informationDatabasesystemer, forår 2005 IT Universitetet i København. Forelæsning 8: Database effektivitet. 31. marts Forelæser: Rasmus Pagh
Databasesystemer, forår 2005 IT Universitetet i København Forelæsning 8: Database effektivitet. 31. marts 2005 Forelæser: Rasmus Pagh Today s lecture Database efficiency Indexing Schema tuning 1 Database
More informationCache introduction. April 16, Howard Huang 1
Cache introduction We ve already seen how to make a fast processor. How can we supply the CPU with enough data to keep it busy? The rest of CS232 focuses on memory and input/output issues, which are frequently
More informationFinancial Statements Using Crystal Reports
Sessions 6-7 & 6-8 Friday, October 13, 2017 8:30 am 1:00 pm Room 616B Sessions 6-7 & 6-8 Financial Statements Using Crystal Reports Presented By: David Hardy Progressive Reports Original Author(s): David
More informationHere are some of the more basic curves that we ll need to know how to do as well as limits on the parameter if they are required.
1 of 10 23/07/2016 05:15 Paul's Online Math Notes Calculus III (Notes) / Line Integrals / Line Integrals - Part I Problems] [Notes] [Practice Problems] [Assignment Calculus III - Notes Line Integrals Part
More informationChapter 3 - Memory Management
Chapter 3 - Memory Management Luis Tarrataca luis.tarrataca@gmail.com CEFET-RJ L. Tarrataca Chapter 3 - Memory Management 1 / 222 1 A Memory Abstraction: Address Spaces The Notion of an Address Space Swapping
More informationBusiness Analytics in the Oracle 12.2 Database: Analytic Views. Event: BIWA 2017 Presenter: Dan Vlamis and Cathye Pendley Date: January 31, 2017
Business Analytics in the Oracle 12.2 Database: Analytic Views Event: BIWA 2017 Presenter: Dan Vlamis and Cathye Pendley Date: January 31, 2017 Vlamis Software Solutions Vlamis Software founded in 1992
More informationSAS Data Integration Studio 3.3. User s Guide
SAS Data Integration Studio 3.3 User s Guide The correct bibliographic citation for this manual is as follows: SAS Institute Inc. 2006. SAS Data Integration Studio 3.3: User s Guide. Cary, NC: SAS Institute
More informationDatabase Applications (15-415)
Database Applications (15-415) DBMS Internals- Part V Lecture 13, March 10, 2014 Mohammad Hammoud Today Welcome Back from Spring Break! Today Last Session: DBMS Internals- Part IV Tree-based (i.e., B+
More informationOverview. DW Performance Optimization. Aggregates. Aggregate Use Example
Overview DW Performance Optimization Choosing aggregates Maintaining views Bitmapped indices Other optimization issues Original slides were written by Torben Bach Pedersen Aalborg University 07 - DWML
More informationRAID in Practice, Overview of Indexing
RAID in Practice, Overview of Indexing CS634 Lecture 4, Feb 04 2014 Slides based on Database Management Systems 3 rd ed, Ramakrishnan and Gehrke 1 Disks and Files: RAID in practice For a big enterprise
More informationCSE373: Data Structure & Algorithms Lecture 18: Comparison Sorting. Dan Grossman Fall 2013
CSE373: Data Structure & Algorithms Lecture 18: Comparison Sorting Dan Grossman Fall 2013 Introduction to Sorting Stacks, queues, priority queues, and dictionaries all focused on providing one element
More informationVirtual Memory. ICS332 Operating Systems
Virtual Memory ICS332 Operating Systems Virtual Memory Allow a process to execute while not completely in memory Part of the address space is kept on disk So far, we have assumed that the full address
More informationCSE332: Data Abstractions Lecture 7: B Trees. James Fogarty Winter 2012
CSE2: Data Abstractions Lecture 7: B Trees James Fogarty Winter 20 The Dictionary (a.k.a. Map) ADT Data: Set of (key, value) pairs keys must be comparable insert(jfogarty,.) Operations: insert(key,value)
More informationExcel 2007/2010. Don t be afraid of PivotTables. Prepared by: Tina Purtee Information Technology (818)
Information Technology MS Office 2007/10 Users Guide Excel 2007/2010 Don t be afraid of PivotTables Prepared by: Tina Purtee Information Technology (818) 677-2090 tpurtee@csun.edu [ DON T BE AFRAID OF
More informationAs your databases continue to evolve, you will need to incorporate advanced queries and reports. This chapter addresses how to create and use action
As your databases continue to evolve, you will need to incorporate advanced queries and reports. This chapter addresses how to create and use action queries and how to create queries that perform more
More informationFile Structures and Indexing
File Structures and Indexing CPS352: Database Systems Simon Miner Gordon College Last Revised: 10/11/12 Agenda Check-in Database File Structures Indexing Database Design Tips Check-in Database File Structures
More informationUsing SAP NetWeaver Business Intelligence in the universe design tool SAP BusinessObjects Business Intelligence platform 4.1
Using SAP NetWeaver Business Intelligence in the universe design tool SAP BusinessObjects Business Intelligence platform 4.1 Copyright 2013 SAP AG or an SAP affiliate company. All rights reserved. No part
More informationHFM Extended Analytics Integration with ASO Essbase. Speakers: Brian Marshall Jon Rambeau
HFM Extended Analytics Integration with ASO Essbase Speakers: Brian Marshall Jon Rambeau Agenda Why HFM to Essbase? Why ASO Instead of BSO? Getting Data Out of HFM. Customer Needs. Needs and Challenges.
More informationMemory Hierarchies &
Memory Hierarchies & Cache Memory CSE 410, Spring 2009 Computer Systems http://www.cs.washington.edu/410 4/26/2009 cse410-13-cache 2006-09 Perkins, DW Johnson and University of Washington 1 Reading and
More informationChapter 11: Indexing and Hashing
Chapter 11: Indexing and Hashing Basic Concepts Ordered Indices B + -Tree Index Files B-Tree Index Files Static Hashing Dynamic Hashing Comparison of Ordered Indexing and Hashing Index Definition in SQL
More informationCache Timing Analysis of LFSR-based Stream Ciphers
Cache Timing Analysis of LFSR-based Stream Ciphers Gregor Leander, Erik Zenner and Philip Hawkes Technical University Denmark (DTU) Department of Mathematics e.zenner@mat.dtu.dk Cirencester, Dec. 17, 2009
More informationDOING MORE WITH EXCEL: MICROSOFT OFFICE 2013
DOING MORE WITH EXCEL: MICROSOFT OFFICE 2013 GETTING STARTED PAGE 02 Prerequisites What You Will Learn MORE TASKS IN MICROSOFT EXCEL PAGE 03 Cutting, Copying, and Pasting Data Basic Formulas Filling Data
More informationAdvanced Data Management Technologies
ADMT 2017/18 Unit 13 J. Gamper 1/42 Advanced Data Management Technologies Unit 13 DW Pre-aggregation and View Maintenance J. Gamper Free University of Bozen-Bolzano Faculty of Computer Science IDSE Acknowledgements:
More informationOperating Systems 2230
Operating Systems 2230 Computer Science & Software Engineering Lecture 6: Memory Management Allocating Primary Memory to Processes The important task of allocating memory to processes, and efficiently
More informationDimensionality & Dimensions of Hyperion Planning
Dimensionality & Dimensions of Hyperion Planning This tutorial will take you through the dimensionality concepts of Hyperion Planning. Dimensions are the basic foundation of the Hyperion Planning application
More informationPointers. A pointer is simply a reference to a variable/object. Compilers automatically generate code to store/retrieve variables from memory
Pointers A pointer is simply a reference to a variable/object Compilers automatically generate code to store/retrieve variables from memory It is automatically generating internal pointers We don t have
More informationSection 1. The essence of COBOL programming. Mike Murach & Associates
Chapter 1 Introduction to COBOL programming 1 Section 1 The essence of COBOL programming The best way to learn COBOL programming is to start doing it, and that s the approach the chapters in this section
More informationComputer Science 210 Data Structures Siena College Fall Topic Notes: Searching and Sorting
Computer Science 10 Data Structures Siena College Fall 016 Topic Notes: Searching and Sorting Searching We all know what searching is looking for something. In a computer program, the search could be:
More informationCS 31: Intro to Systems Caching. Kevin Webb Swarthmore College March 24, 2015
CS 3: Intro to Systems Caching Kevin Webb Swarthmore College March 24, 205 Reading Quiz Abstraction Goal Reality: There is no one type of memory to rule them all! Abstraction: hide the complex/undesirable
More informationDOING MORE WITH EXCEL: MICROSOFT OFFICE 2010
DOING MORE WITH EXCEL: MICROSOFT OFFICE 2010 GETTING STARTED PAGE 02 Prerequisites What You Will Learn MORE TASKS IN MICROSOFT EXCEL PAGE 03 Cutting, Copying, and Pasting Data Filling Data Across Columns
More informationChapter 12: Indexing and Hashing
Chapter 12: Indexing and Hashing Database System Concepts, 5th Ed. See www.db-book.com for conditions on re-use Chapter 12: Indexing and Hashing Basic Concepts Ordered Indices B + -Tree Index Files B-Tree
More informationFundamentals of Database Systems Prof. Arnab Bhattacharya Department of Computer Science and Engineering Indian Institute of Technology, Kanpur
Fundamentals of Database Systems Prof. Arnab Bhattacharya Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture - 18 Database Indexing: Hashing We will start on
More informationCreating Dashboards using Web Intelligence
September 9 11, 2013 Anaheim, California Creating Dashboards using Web Intelligence Session 8806 Alan Mayer Solid Ground Technologies Agenda Introduction Examining interactive features Graphing relationships
More informationRev. C 11/09/2010 Downers Grove Public Library Page 1 of 41
Table of Contents Objectives... 3 Introduction... 3 Excel Ribbon Components... 3 Office Button... 4 Quick Access Toolbar... 5 Excel Worksheet Components... 8 Navigating Through a Worksheet... 8 Making
More informationExcel Tips and FAQs - MS 2010
BIOL 211D Excel Tips and FAQs - MS 2010 Remember to save frequently! Part I. Managing and Summarizing Data NOTE IN EXCEL 2010, THERE ARE A NUMBER OF WAYS TO DO THE CORRECT THING! FAQ1: How do I sort my
More informationETL and OLAP Systems
ETL and OLAP Systems Krzysztof Dembczyński Intelligent Decision Support Systems Laboratory (IDSS) Poznań University of Technology, Poland Software Development Technologies Master studies, first semester
More informationFor more info on Cloud9 see their documentation:
Intro to Wordpress Cloud 9 - http://c9.io With the free C9 account you have limited space and only 1 private project. Pay attention to your memory, cpu and disk usage meter at the top of the screen. For
More informationColumn Stores vs. Row Stores How Different Are They Really?
Column Stores vs. Row Stores How Different Are They Really? Daniel J. Abadi (Yale) Samuel R. Madden (MIT) Nabil Hachem (AvantGarde) Presented By : Kanika Nagpal OUTLINE Introduction Motivation Background
More informationR-Trees. Accessing Spatial Data
R-Trees Accessing Spatial Data In the beginning The B-Tree provided a foundation for R- Trees. But what s a B-Tree? A data structure for storing sorted data with amortized run times for insertion and deletion
More informationRutgers University. Smart View Training Guide
Rutgers University Smart View Training Guide Contents What is Smart View?... 2 Installing Smart View... 2 Establishing a Connection... 3 Ad-Hoc Analysis... 5 Creating an Ad-Hoc Analysis... 5 Dimensions
More informationChapter 5. Indexing for DWH
Chapter 5. Indexing for DWH D1 Facts D2 Prof. Bayer, DWH, Ch.5, SS 2000 1 dimension Time with composite key K1 according to hierarchy key K1 = (year int, month int, day int) dimension Region with composite
More informationSigned umbers. Sign/Magnitude otation
Signed umbers So far we have discussed unsigned number representations. In particular, we have looked at the binary number system and shorthand methods in representing binary codes. With m binary digits,
More informationCSE 332: Data Structures & Parallelism Lecture 12: Comparison Sorting. Ruth Anderson Winter 2019
CSE 332: Data Structures & Parallelism Lecture 12: Comparison Sorting Ruth Anderson Winter 2019 Today Sorting Comparison sorting 2/08/2019 2 Introduction to sorting Stacks, queues, priority queues, and
More informationKathleen Durant PhD Northeastern University CS Indexes
Kathleen Durant PhD Northeastern University CS 3200 Indexes Outline for the day Index definition Types of indexes B+ trees ISAM Hash index Choosing indexed fields Indexes in InnoDB 2 Indexes A typical
More informationPage Replacement. (and other virtual memory policies) Kevin Webb Swarthmore College March 27, 2018
Page Replacement (and other virtual memory policies) Kevin Webb Swarthmore College March 27, 2018 Today s Goals Making virtual memory virtual : incorporating disk backing. Explore page replacement policies
More informationInteractive Reporting & Essbase. interrel Consulting
Interactive Reporting & Essbase interrel Consulting interrel - Founded in 1997 2008 Oracle Titan Award winner for EPM Solution of the year 2008 Oracle Excellence Award winner with Pearson Education One
More informationBar Graphs and Dot Plots
CONDENSED LESSON 1.1 Bar Graphs and Dot Plots In this lesson you will interpret and create a variety of graphs find some summary values for a data set draw conclusions about a data set based on graphs
More informationVirtual Memory #2 Feb. 21, 2018
15-410...The mysterious TLB... Virtual Memory #2 Feb. 21, 2018 Dave Eckhardt Brian Railing 1 L16_VM2 Last Time Mapping problem: logical vs. physical addresses Contiguous memory mapping (base, limit) Swapping
More informationCS 405G: Introduction to Database Systems. Storage
CS 405G: Introduction to Database Systems Storage It s all about disks! Outline That s why we always draw databases as And why the single most important metric in database processing is the number of disk
More informationIndexing. Jan Chomicki University at Buffalo. Jan Chomicki () Indexing 1 / 25
Indexing Jan Chomicki University at Buffalo Jan Chomicki () Indexing 1 / 25 Storage hierarchy Cache Main memory Disk Tape Very fast Fast Slower Slow (nanosec) (10 nanosec) (millisec) (sec) Very small Small
More informationLECTURE 11. Memory Hierarchy
LECTURE 11 Memory Hierarchy MEMORY HIERARCHY When it comes to memory, there are two universally desirable properties: Large Size: ideally, we want to never have to worry about running out of memory. Speed
More informationChapter 6 Memory 11/3/2015. Chapter 6 Objectives. 6.2 Types of Memory. 6.1 Introduction
Chapter 6 Objectives Chapter 6 Memory Master the concepts of hierarchical memory organization. Understand how each level of memory contributes to system performance, and how the performance is measured.
More informationSQL Tuning Reading Recent Data Fast
SQL Tuning Reading Recent Data Fast Dan Tow singingsql.com Introduction Time is the key to SQL tuning, in two respects: Query execution time is the key measure of a tuned query, the only measure that matters
More informationGeneral Objective:To understand the basic memory management of operating system. Specific Objectives: At the end of the unit you should be able to:
F2007/Unit6/1 UNIT 6 OBJECTIVES General Objective:To understand the basic memory management of operating system Specific Objectives: At the end of the unit you should be able to: define the memory management
More informationPractical Guide For Transformer in Production
Practical Guide For Transformer in Production Practical Guide for Transformer in Production i Table of Contents 1. PURPOSE...3 2. AUDIENCE...3 3. OVERVIEW...3 3.1 Test Model Information...3 4. DATA RELATED
More informationWhat Are CSS and DHTML?
6/14/01 10:31 AM Page 1 1 What Are CSS and DHTML? c h a p t e r ch01.qxd IN THIS CHAPTER What Is CSS? What Is DHTML? DHTML vs. Flash Browser Hell What You Need to Know Already Welcome to the world of CSS
More informationCSE 373: Data Structures and Algorithms. Memory and Locality. Autumn Shrirang (Shri) Mare
CSE 373: Data Structures and Algorithms Memory and Locality Autumn 2018 Shrirang (Shri) Mare shri@cs.washington.edu Thanks to Kasey Champion, Ben Jones, Adam Blank, Michael Lee, Evan McCarty, Robbie Weber,
More informationDatabase Use & Design
Database Use & Design 1 Important Terms and Definitions Database A collection of information organized in such a way that a computer program can quickly select desired pieces of data. Field Form Primary
More information1. Attempt any two of the following: 10 a. State and justify the characteristics of a Data Warehouse with suitable examples.
Instructions to the Examiners: 1. May the Examiners not look for exact words from the text book in the Answers. 2. May any valid example be accepted - example may or may not be from the text book 1. Attempt
More informationDefinition of RAID Levels
RAID The basic idea of RAID (Redundant Array of Independent Disks) is to combine multiple inexpensive disk drives into an array of disk drives to obtain performance, capacity and reliability that exceeds
More informationVMware vcenter AppSpeed User s Guide AppSpeed 1.0 EN
VMware vcenter AppSpeed User s Guide AppSpeed 1.0 EN-000213-01 VMware vcenter AppSpeed User s Guide You can find the most up-to-date technical documentation on the VMware Web site at: http://www.vmware.com/support/
More informationOracle TIGHT / Oracle General Ledger Guide / Cameron / / Blind folio: 127 CHAPTER. Financial Statement Generator
/ Blind folio: 127 CHAPTER 6 Financial Statement Generator 127 ch06.indd 127 4/1/2009 10:14:13 AM 128 Oracle General Ledger Guide T he Financial Statement Generator, or FSG, is EBS s tool for writing financial
More informationData parallel algorithms 1
Data parallel algorithms (Guy Steele): The data-parallel programming style is an approach to organizing programs suitable for execution on massively parallel computers. In this lecture, we will characterize
More informationOver provisioning in solid state hard drives: benefits, design considerations, and trade-offs in its use
Over provisioning in solid state hard drives: benefits, design considerations, and trade-offs in its use Conditions of use: Intended to provide the reader with some background on over provisioning, this
More informationThe Root Cause of Unstructured Data Problems is Not What You Think
The Root Cause of Unstructured Data Problems is Not What You Think PRESENTATION TITLE GOES HERE Bruce Thompson, CEO Action Information Systems www.expeditefile.com What is this presentation all about?
More informationThe Emergence of Application Logic Compilers Stefan Dipper, SAP BW Development Sept, Public
The Emergence of Application Logic Compilers Stefan Dipper, SAP BW Development Sept, 2013 Public Agenda What is an application logic compiler? Why stored procedures History Domain specific language - Why
More informationWhat did we talk about last time? Finished hunters and prey Class variables Constants Class constants Started Big Oh notation
Week 12 - Friday What did we talk about last time? Finished hunters and prey Class variables Constants Class constants Started Big Oh notation Here is some code that sorts an array in ascending order
More informationAdmin. How's the project coming? After these slides, read chapter 13 in your book. Quizzes will return
Recursion CS 1 Admin How's the project coming? After these slides, read chapter 13 in your book Yes that is out of order, but we can read it stand alone Quizzes will return Tuesday Nov 29 th see calendar
More informationRecursive Algorithms II
Recursive Algorithms II Margaret M. Fleck 23 October 2009 This lecture wraps up our discussion of algorithm analysis (section 4.4 and 7.1 of Rosen). 1 Recap Last lecture, we started talking about mergesort,
More informationNew and Improved Formula Editor in JMP 13
These are the step-by-step instructions for the 'New and Improved Formula Editor in JMP 13' demo. This contains talking points and also the demo steps. Demo instructions are underlined and in bold to highlight
More information(Introduction Title slide) (Forward engineering) [Start demo]
(Introduction Title slide) Welcome to this demonstration of IBM InfoSphere Data Architect. InfoSphere Data Architect is a collaborative data design solution to discover, model, relate, and standardize
More informationCreating Dashboards using Web Intelligence
September 9 11, 2013 Anaheim, California Creating Dashboards using Web Intelligence Session 8806 Alan Mayer Solid Ground Technologies Agenda Introduction Examining interactive features Graphing relationships
More informationAccess Intermediate
Access 2010 - Intermediate (103-134) Building Access Databases Notes Quick Links Building Databases Pages AC52 AC56 AC91 AC93 Building Access Tables Pages AC59 AC67 Field Types Pages AC54 AC56 AC267 AC270
More informationLearning the Binary System
Learning the Binary System www.brainlubeonline.com/counting_on_binary/ Formated to L A TEX: /25/22 Abstract This is a document on the base-2 abstract numerical system, or Binary system. This is a VERY
More information(Refer Slide Time: 00:50)
Programming, Data Structures and Algorithms Prof. N.S. Narayanaswamy Department of Computer Science and Engineering Indian Institute of Technology Madras Module - 03 Lecture 30 Searching Unordered linear
More information