Data Warehousing and Decision Support

Similar documents
Data Warehousing and Decision Support

Data Warehousing and Decision Support. Introduction. Three Complementary Trends. [R&G] Chapter 23, Part A

Data Warehousing 2. ICS 421 Spring Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa

Decision Support. Chapter 25. CS 286, UC Berkeley, Spring 2007, R. Ramakrishnan 1

Introduction to Data Warehousing

Data Warehousing and Decision Support (mostly using Relational Databases) CS634 Class 20

Data warehouses Decision support The multidimensional model OLAP queries

Announcements. Course Outline. CS/INFO 330 Data Warehousing and OLAP. Mirek Riedewald

CSE 544 Principles of Database Management Systems. Alvin Cheung Fall 2015 Lecture 8 - Data Warehousing and Column Stores

Data Warehouses. Yanlei Diao. Slides Courtesy of R. Ramakrishnan and J. Gehrke

Data Warehousing and OLAP

CSE 544 Principles of Database Management Systems. Fall 2016 Lecture 14 - Data Warehousing and Column Stores

One Size Fits All: An Idea Whose Time Has Come and Gone

Beyond Databases Advanced Topics

Data Warehousing & OLAP

Data Warehousing 3. ICS 421 Spring Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa

Data Mining Concepts & Techniques

Database design View Access patterns Need for separate data warehouse:- A multidimensional data model:-

An Overview of Data Warehousing and OLAP Technology

CHAPTER 8 DECISION SUPPORT V2 ADVANCED DATABASE SYSTEMS. Assist. Prof. Dr. Volkan TUNALI

Syllabus. Syllabus. Motivation Decision Support. Syllabus

DATA WAREHOUSE EGCO321 DATABASE SYSTEMS KANAT POOLSAWASD DEPARTMENT OF COMPUTER ENGINEERING MAHIDOL UNIVERSITY

collection of data that is used primarily in organizational decision making.

SQL Server Analysis Services

This tutorial will help computer science graduates to understand the basic-to-advanced concepts related to data warehousing.

CS614 - Data Warehousing - Midterm Papers Solved MCQ(S) (1 TO 22 Lectures)

Decision Support Systems aka Analytical Systems

ETL and OLAP Systems

Summary of Last Chapter. Course Content. Chapter 2 Objectives. Data Warehouse and OLAP Outline. Incentive for a Data Warehouse

REPORTING AND QUERY TOOLS AND APPLICATIONS

Information Management course

Data Warehouse and Data Mining

What is a Data Warehouse?

Improving the Performance of OLAP Queries Using Families of Statistics Trees

IDU0010 ERP,CRM ja DW süsteemid Loeng 5 DW concepts. Enn Õunapuu

Advanced Data Management Technologies

Evolution of Database Systems

CT75 DATA WAREHOUSING AND DATA MINING DEC 2015

Chapter 13 Business Intelligence and Data Warehouses The Need for Data Analysis Business Intelligence. Objectives

Data Warehousing (1)

OLAP Introduction and Overview

Decision Support, Data Warehousing, and OLAP

CHAPTER 8: ONLINE ANALYTICAL PROCESSING(OLAP)

Data Warehousing Conclusion. Esteban Zimányi Slides by Toon Calders

CS 245: Database System Principles. Warehousing. Outline. What is a Warehouse? What is a Warehouse? Notes 13: Data Warehousing

Chapter 18: Data Analysis and Mining

Data Warehousing and Decision Support, part 2

SQL Server 2005 Analysis Services

Data Warehouses and OLAP. Database and Information Systems. Data Warehouses and OLAP. Data Warehouses and OLAP

How am I going to skim through these data?

A Multi-Dimensional Data Model

Data Analysis and Data Science

Call: SAS BI Course Content:35-40hours

DATA MINING AND WAREHOUSING

Data Warehouse. Asst.Prof.Dr. Pattarachai Lalitrojwong

Processing of Very Large Data

~ Ian Hunneybell: DWDM Revision Notes (31/05/2006) ~

Unit 7: Basics in MS Power BI for Excel 2013 M7-5: OLAP

Fig 1.2: Relationship between DW, ODS and OLTP Systems

CHAPTER 3 Implementation of Data warehouse in Data Mining

Data Warehousing & Mining. Data integration. OLTP versus OLAP. CPS 116 Introduction to Database Systems

OLAP2 outline. Multi Dimensional Data Model. A Sample Data Cube

Basics of Dimensional Modeling

Data Warehousing and OLAP Technologies for Decision-Making Process

A Novel Approach of Data Warehouse OLTP and OLAP Technology for Supporting Management prospective

Adnan YAZICI Computer Engineering Department

Big Data 13. Data Warehousing

Chapter 4, Data Warehouse and OLAP Operations

1 Dulcian, Inc., 2001 All rights reserved. Oracle9i Data Warehouse Review. Agenda

1. Attempt any two of the following: 10 a. State and justify the characteristics of a Data Warehouse with suitable examples.

Information Management course

On-Line Analytical Processing (OLAP) Traditional OLTP

Data Warehousing and Data Mining. Announcements (December 1) Data integration. CPS 116 Introduction to Database Systems

Advanced Data Management Technologies Written Exam

Data Warehouses Chapter 12. Class 10: Data Warehouses 1

The Evolution of Data Warehousing. Data Warehousing Concepts. The Evolution of Data Warehousing. The Evolution of Data Warehousing

Introduction to DWML. Christian Thomsen, Aalborg University. Slides adapted from Torben Bach Pedersen and Man Lung Yiu

Create Cube From Star Schema Grouping Framework Manager

DATA MINING TRANSACTION

Deccansoft Software Services Microsoft Silver Learning Partner. SSAS Syllabus

Reminds on Data Warehousing

Data Warehousing Lecture 8. Toon Calders

Data warehouse architecture consists of the following interconnected layers:

This tutorial will help computer science graduates to understand the basic-to-advanced concepts related to data warehousing.

Information Integration

Rocky Mountain Technology Ventures

QUALITY MONITORING AND

Data Mining. Data warehousing. Hamid Beigy. Sharif University of Technology. Fall 1394

Lectures for the course: Data Warehousing and Data Mining (IT 60107)

IT DATA WAREHOUSING AND DATA MINING UNIT-2 BUSINESS ANALYSIS

Proceedings of the IE 2014 International Conference AGILE DATA MODELS

CS 1655 / Spring 2013! Secure Data Management and Web Applications

Data Warehousing. Data Warehousing and Mining. Lecture 8. by Hossen Asiful Mustafa

Data Mining. Data warehousing. Hamid Beigy. Sharif University of Technology. Fall 1396

DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI

Data Warehousing. Overview

Data Warehouses These slides are a modified version of the slides of the book Database System Concepts (Chapter 18), 5th Ed McGraw-Hill by

Exam Datawarehousing INFOH419 July 2013

Enterprise Informatization LECTURE

The University of Iowa Intelligent Systems Laboratory The University of Iowa Intelligent Systems Laboratory

Transcription:

Data Warehousing and Decision Support [R&G] Chapter 23, Part A CS 4320 1

Introduction Increasingly, organizations are analyzing current and historical data to identify useful patterns and support business strategies. Emphasis is on complex, interactive, exploratory analysis of very large datasets created by integrating data from across all parts of an enterprise; data is fairly static. Contrast such On-Line Analytic Processing (OLAP) with traditional On-line Transaction Processing (OLTP): mostly long queries, instead of short update Xacts. CS 4320 2

Three Complementary Trends Data Warehousing: Consolidate data from many sources in one large repository. Loading, periodic synchronization of replicas. Semantic integration. OLAP: Complex SQL queries and views. Queries based on spreadsheet-style operations and multidimensional view of data. Interactive and online queries. Data Mining: Exploratory search for interesting trends and anomalies. CS 4320 3

EXTERNAL DATA SOURCES Data Warehousing Integrated data spanning long time periods, often augmented with summary information. Several gigabytes to terabytes common. Interactive response times expected for complex queries; ad-hoc updates uncommon. DATA MINING Metadata Repository EXTRACT TRANSFORM LOAD REFRESH SUPPORTS DATA WAREHOUSE OLAP CS 4320 4

Warehousing Issues Semantic Integration: When getting data from multiple sources, must eliminate mismatches, e.g., different currencies, schemas. Heterogeneous Sources: Must access data from a variety of source formats and repositories. Replication capabilities can be exploited here. Load, Refresh, Purge: Must load data, periodically refresh it, and purge too-old data. Metadata Management: Must keep track of source, loading time, and other information for all data in the warehouse. CS 4320 5

Multidimensional Data Model Collection of numeric measures, which depend on a set of dimensions. E.g., measure Sales, dimensions Product (key: pid), Location (locid), and Time (timeid). Slice locid=1 is shown: pid 11 12 13 8 10 10 30 20 50 25 8 15 1 2 3 timeid locid 11 1 1 25 11 2 1 8 11 3 1 15 12 1 1 30 12 2 1 20 12 3 1 50 13 1 1 8 13 2 1 10 13 3 1 10 11 1 2 35 CS 4320 6 pid timeid locid sales

MOLAP vs ROLAP Multidimensional data can be stored physically in a (disk-resident, persistent) array; called MOLAP systems. Alternatively, can store as a relation; called ROLAP systems. The main relation, which relates dimensions to a measure, is called the fact table. Each dimension can have additional attributes and an associated dimension table. E.g., Products(pid, pname, category, price) Fact tables are much larger than dimensional tables. CS 4320 7

Dimension Hierarchies For each dimension, the set of values can be organized in a hierarchy: PRODUCT TIME LOCATION year quarter country category week month state pname date city CS 4320 8

OLAP Queries Influenced by SQL and by spreadsheets. A common operation is to aggregate a measure over one or more dimensions. Find total sales. Find total sales for each city, or for each state. Find top five products ranked by total sales. Roll-up: Aggregating at different levels of a dimension hierarchy. E.g., Given total sales by city, we can roll-up to get sales by state. CS 4320 9

OLAP Queries Drill-down: The inverse of roll-up. E.g., Given total sales by state, can drill-down to get total sales by city. E.g., Can also drill-down on different dimension to get total sales by product for each state. Pivoting: Aggregation on selected dimensions. E.g., Pivoting on Location and Time yields this cross-tabulation: 63 81 144 Slicing and Dicing: Equality and range selections on one or more dimensions. 1995 1996 1997 Total WI CA Total 38 107 145 75 35 110 176 223 339 CS 4320 10

Comparison with SQL Queries The cross-tabulation obtained by pivoting can also be computed using a collection of SQLqueries: SELECT SUM(S.sales) FROM Sales S, Times T, Locations L WHERE S.timeid=T.timeid AND S.timeid=L.timeid GROUP BY T.year, L.state SELECT SUM(S.sales) FROM Sales S, Times T WHERE S.timeid=T.timeid GROUP BY T.year SELECT SUM(S.sales) FROM Sales S, Location L WHERE S.timeid=L.timeid GROUP BY L.state CS 4320 11

The CUBE Operator Generalizing the previous example, if there are k dimensions, we have 2^k possible SQL GROUP BY queries that can be generated through pivoting on a subset of dimensions. CUBE pid, locid, timeid BY SUM Sales Equivalent to rolling up Sales on all eight subsets of the set {pid, locid, timeid}; each roll-up corresponds to an SQL query of the form: Lots of work on optimizing the CUBE operator! SELECT SUM(S.sales) FROM Sales S GROUP BY grouping-list CS 4320 12

Design Issues TIMES timeid date week month quarter year holiday_flag pid timeid locid sales SALES (Fact table) PRODUCTS LOCATIONS pid pname category price locid city state country Fact table in BCNF; dimension tables un-normalized. Dimension tables are small; updates/inserts/deletes are rare. So, anomalies less important than query performance. This kind of schema is very common in OLAP applications, and is called a star schema; computing the join of all these relations is called a star join. CS 4320 13

Implementation Issues New indexing techniques: Bitmap indexes, Join indexes, array representations, compression, precomputation of aggregations, etc. E.g., Bitmap index: Bit-vector: F M 1 bit for each possible value. Many queries can be answered using bit-vector ops! sex custid name sex rating rating 10 10 01 10 112 Joe M 3 115 Ram M 5 119 Sue F 5 112 Woo M 4 00100 00001 00001 00010 CS 4320 14

Join Indexes Consider the join of Sales, Products, Times, and Locations, possibly with additional selection conditions (e.g., country= USA ). A join index can be constructed to speed up such joins. The index contains [s,p,t,l] if there are tuples (with sid) s in Sales, p in Products, t in Times and l in Locations that satisfy the join (and selection) conditions. Problem: Number of join indexes can grow rapidly. A variation addresses this problem: For each column with an additional selection (e.g., country), build an index with [c,s] in it if a dimension table tuple with value c in the selection column joins with a Sales tuple with sid s; if indexes are bitmaps, called bitmapped join index. CS 4320 15

PRODUCTS Bitmapped Join Index pid timei d pname dat e week pid category mont h timeid price quarte r locid locid sales year state country Consider a query with conditions price=10 and country= USA. Suppose tuple (with sid) s in Sales joins with a tuple p with price=10 and a tuple l with country = USA. There are two join indexes; one containing [10,s] and the other [USA,s]. Intersecting these indexes tells us which tuples in Sales are in the join and satisfy the given selection. CS 4320 16 city holiday_fla g SALES TIMES (Fact table) LOCATIONS

Querying Sequences in SQL:1999 Trend analysis is difficult to do in SQL-92: Find the % change in monthly sales Find the top 5 product by total sales Find the trailing n-day moving average of sales The first two queries can be expressed with difficulty, but the third cannot even be expressed in SQL-92 if n is a parameter of the query. The WINDOW clause in SQL:1999 allows us to write such queries over a table viewed as a sequence (implicitly, based on user-specified sort keys) CS 4320 17

The WINDOW Clause SELECT L.state, T.month, AVG(S.sales) OVER W AS movavg FROM Sales S, Times T, Locations L WHERE S.timeid=T.timeid AND S.locid=L.locid WINDOW W AS (PARTITION BY L.state ORDER BY T.month RANGE BETWEEN INTERVAL `1 MONTH PRECEDING AND INTERVAL `1 MONTH FOLLOWING) Let the result of the FROM and WHERE clauses be Temp. (Conceptually) Temp is partitioned according to the PARTITION BY clause. Similar to GROUP BY, but the answer has one row for each row in a partition, not one row per partition! Each partition is sorted according to the ORDER BY clause. For each row in a partition, the WINDOW clause creates a window of nearby (preceding or succeeding) tuples. Can be value-based, as in example, using RANGE Can be based on number of rows to include in the window, using ROWS clause The aggregate function is evaluated for each row in the partition using the corresponding window. New aggregate functions that are useful with windowing include RANK (position of a row within its partition) and its variants DENSE_RANK, PERCENT_RANK, CUME_DIST. CS 4320 18

Top N Queries If you want to find the 10 (or so) cheapest cars, it would be nice if the DB could avoid computing the costs of all cars before sorting to determine the 10 cheapest. Idea: Guess at a cost c such that the 10 cheapest all cost less than c, and that not too many more cost less. Then add the selection cost<c and evaluate the query. If the guess is right, great, we avoid computation for cars that cost more than c. If the guess is wrong, need to reset the selection and recompute the original query. CS 4320 19

Top N Queries SELECT P.pid, P.pname, S.sales FROM Sales S, Products P WHERE S.pid=P.pid AND S.locid=1 AND S.timeid=3 ORDER BY S.sales DESC OPTIMIZE FOR 10 ROWS SELECT P.pid, P.pname, S.sales FROM Sales S, Products P WHERE S.pid=P.pid AND S.locid=1 AND S.timeid=3 AND S.sales > c ORDER BY S.sales DESC OPTIMIZE FOR construct is not in SQL:1999! Cut-off value c is chosen by optimizer. CS 4320 20

Online Aggregation Consider an aggregate query, e.g., finding the average sales by state. Can we provide the user with some information before the exact average is computed for all states? Can show the current running average for each state as the computation proceeds. Even better, if we use statistical techniques and sample tuples to aggregate instead of simply scanning the aggregated table, we can provide bounds such as the average for Wisconsin is 2000±102 with 95% probability. Should also use nonblocking algorithms! CS 4320 21

Summary Decision support is an emerging, rapidly growing subarea of databases. Involves the creation of large, consolidated data repositories called data warehouses. Warehouses exploited using sophisticated analysis techniques: complex SQL queries and OLAP multidimensional queries (influenced by both SQL and spreadsheets). New techniques for database design, indexing, view maintenance, and interactive querying need to be supported. CS 4320 22