Chapter 1 Datawarehouse
Chapter 1 Datawarehouse
A decision support database that is maintained separately from the organizations operational database Support information processing by providing a solid platform of consolidated, historical data for analysis.
Data WarehouseSubject-Oriented
product, sales
Focusing on the modeling and analysis of data for decision makers, not on daily operations or transaction
processing
Provide a simple and concise view around particular subject issues by excluding data that are not useful in
Data WarehouseIntegrated
Constructed by integrating multiple, heterogeneous data sources relational databases, flat files, on-line transaction records Data cleaning and data integration techniques are applied. Ensure consistency in naming conventions, encoding structures, attribute measures, etc. among different data sources
The time horizon for the data warehouse is significantly longer than that of operational systems
Operational database: current value data Data warehouse data: provide information from a historical perspective (e.g., past 5-10 years) Contains an element of time, explicitly or implicitly But the key of operational data may or may not contain time element
Data WarehouseNonvolatile
A physically separate store of data transformed from the operational environment Operational update of data does not occur in the data warehouse environment
Does not require transaction processing, recovery, and concurrency control mechanisms Requires only two operations in data accessing:
DBMS tuned for OLTP: access methods, indexing, concurrency control, recovery Warehousetuned for OLAP: complex OLAP queries, multidimensional view, consolidation missing data: Decision support requires historical data which operational DBs do not typically maintain data consolidation: DS requires consolidation (aggregation, summarization) of data from heterogeneous sources data quality: different sources typically use inconsistent data representations, codes and formats which have to be reconciled
Note: There are more and more systems which perform OLAP analysis directly on relational databases
9
10
A data warehouse is based on a multidimensional data model which views data in the form of a data cube
Dimension tables, such as item (item_name, brand, type), or time(day, week, month, quarter, year) Fact table contains measures (such as dollars_sold) and keys to each of the related dimension tables
cuboid. The top most 0-D cuboid, which holds the highest-level of
summarization, is called the apex cuboid. The lattice of cuboids forms a data cube.
11
1-D cuboids
time,location
time,item
item,location
item,supplier
location,supplier
time,supplier
2-D cuboids
time,location,supplier
3-D cuboids
time,item,location
time,item,supplier
item,location,supplier
Star schema: A fact table in the middle connected to a set of dimension tables Snowflake schema: A refinement of star schema where some dimensional hierarchy is normalized into a set of smaller dimension tables, forming a shape similar to snowflake Fact constellations: Multiple fact tables share
item
Sales Fact Table time_key item_key branch_key
item_key item_name brand type supplier_type
branch
branch_key branch_name branch_type
location
location_key street city state_or_province country
14
item
Sales Fact Table time_key item_key
item_key item_name brand type supplier_key
supplier
supplier_key supplier_type
branch_key
branch
branch_key branch_name branch_type
location
location_key street city_key
city
city_key city state_or_province country
15
item
Sales Fact Table
time_key item_key branch_key
item_key item_name brand type supplier_type
branch
branch_key branch_name branch_type
location
location_key street city province_or_state country
country
Germany
...
Spain
Canada
...
Mexico
city office
Frankfurt
...
Toronto
M. Wind
17
Distributive: if the result derived by applying the function to n aggregate values is the same as that derived by applying the function on all the data without partitioning
Algebraic: if it can be computed by an algebraic function with M arguments (where M is a bounded integer), each of which is obtained by applying a distributive aggregate function
Holistic: if there is no constant bound on the storage size needed to describe a subaggregate.
Specification of hierarchies
Schema hierarchy
19
Multidimensional Data
Product
Product
City
Month Week
Office
Day
Month
20
Date
3Qtr 4Qtr sum
Country
TV PC VCR sum
21
date
product,country
country
date, country
1-D cuboids
product,date
2-D cuboids
3-D (base) cuboid
product, date, country
22
from higher level summary to lower level summary or detailed data, or introducing new dimensions Slice and dice: project and select
Pivot (rotate):
reorient the cube, visualization, 3D to series of 2D planes drill across: involving (across) more than one fact table drill through: through the bottom level of the cube to its back-end relational tables (using SQL)
23
Other operations
24
AIR-EXPRESS
TRUCK Time ANNUALY QTRLY CITY SALES PERSON COUNTRY DISTRICT DAILY ORDER PRODUCT LINE Product
REGION
Location
Top-down view
allows selection of the relevant information necessary for the data warehouse
exposes the information being captured, stored, and managed by operational systems
consists of fact tables and dimension tables sees the perspectives of data in the warehouse from the view of end-user
28
Spiral: rapid generation of increasingly functional systems, short turn around time, quick turn around
Choose a business process to model, e.g., orders, invoices, etc.
Other sources
Operational DBs
Metadata
Data Warehouse
Serve
Data Marts
Data Sources
Data Storage
Data extraction get data from multiple, heterogeneous, and external sources Data cleaning detect errors in the data and rectify them when possible Data transformation convert data from legacy or host format to warehouse format Load sort, summarize, consolidate, compute views, check integrity, and build indicies and partitions Refresh propagate the updates from the data sources to the warehouse
31
Metadata Repository
Meta data is the data defining warehouse objects. It stores: Description of the structure of the data warehouse
schema, view, dimensions, hierarchies, derived data defn, data mart locations and contents
data lineage (history of migrated data and transformation path), currency of data (active, archived, or purged), monitoring information (warehouse usage statistics, error reports, audit trails)
Operational meta-data
The algorithms used for summarization The mapping from operational environment to the data warehouse Data related to system performance warehouse schema, view and derived data definitions Business data
Enterprise warehouse collects all of the information about subjects spanning the entire organization Data Mart a subset of corporate-wide data that is of value to a specific groups of users. Its scope is confined to specific, selected groups, such as marketing data mart
Virtual warehouse A set of views over operational databases Only some of the possible summary views may be materialized
33
Data Mart
Data Mart
Model refinement
Model refinement
Information processing
supports querying, basic statistical analysis, and reporting using crosstabs, tables, charts and graphs
multidimensional analysis of data warehouse data supports basic OLAP operations, slice-dice, drilling, pivoting knowledge discovery from hidden patterns
Analytical processing
Data mining
supports associations, constructing analytical models, performing classification and prediction, and presenting the mining results using visualization tools
35
Why online analytical mining? High quality of data in data warehouses DW contains integrated, consistent, cleaned data Available information processing structure surrounding data warehouses ODBC, OLEDB, Web accessing, service facilities, reporting and OLAP tools OLAP-based exploratory data analysis Mining with drilling, dicing, pivoting, etc. On-line selection of data mining functions Integration and swapping of multiple mining functions, algorithms, and tasks
36
37
Materialize every (cuboid) (full materialization), none (no materialization), or some (partial materialization) Selection of which cuboids to materialize
38
Cube definition and computation in DMQL define cube sales [item, city, year]: sum (sales_in_dollars)
Transform it into a SQL-like language (with a new operator cube by, introduced by Gray et al.96) () SELECT item, city, year, SUM (amount) FROM SALES
(city) (item) (year)
(date, product, customer), (date,product),(date, customer), (product, customer), (city, item, year) (date), (product), (customer) ()
(city, item)
(city, year)
(item, year)
39
Index on a particular column Each value in the column has a bit vector: bit-op is fast The length of the bit vector: # of records in the base table The i-th bit is set if the i-th row of the base table has the value for the indexed column not suitable for high cardinality domains A recent bit compression technique, Word-Aligned Hybrid (WAH), makes it work for high cardinality domain as well [Wu, et al. TODS06]
Base table
Cust C1 C2 C3 C4 C5 Region Asia Europe Asia America Europe
Index on Region
Index on Type
Type RecIDAsia Europe America RecID Retail Dealer Retail 1 1 0 1 1 0 0 Dealer 2 2 0 1 0 1 0 Dealer 3 1 0 0 3 0 1 Retail 4 0 0 1 4 1 0 0 1 0 5 0 1 Dealer 5
40
Join index: JI(R-id, S-id) where R (R-id, ) S (S-id, ) Traditional indices map the values to a list of record ids It materializes relational join in JI file and speeds up relational join In data warehouses, join index relates the values of the dimensions of a start schema to rows in the fact table. E.g. fact table: Sales and two dimensions city and product A join index on city maintains for each distinct city a list of R-IDs of the tuples recording the Sales in the city Join indices can span multiple dimensions
41
Transform drill, roll, etc. into corresponding SQL and/or OLAP operations,
Let the query to be processed be on {brand, province_or_state} with the condition year = 2004, and there are 4 materialized cuboids available:
Explore indexing structures and compressed vs. dense array structs in MOLAP
42
Use relational or extended-relational DBMS to store and manage warehouse data and OLAP middle ware Include optimization of DBMS backend, implementation of aggregation navigation logic, and additional tools and services Greater scalability Sparse array-based multidimensional storage engine Fast indexing to pre-computed summarized data
44
45
Summary
A data cube consists of dimensions & measures Star schema, snowflake schema, fact constellations OLAP operations: drilling, rolling, slicing, dicing and pivoting Multi-tiered architecture Business analysis design framework
Information processing, analytical processing, data mining, OLAM (Online Analytical Mining) Implementation: Efficient computation of data cubes Partial vs. full vs. no materialization Indexing OALP data: Bitmap index and join index OLAP query processing OLAP servers: ROLAP, MOLAP, HOLAP
Data Warehouse: Basic Concepts (a) What Is a Data Warehouse? (b) Data Warehouse: A Multi-Tiered Architecture (c) Three Data Warehouse Models: Enterprise Warehouse, Data Mart, ad Virtual Warehouse (d) Extraction, Transformation and Loading (e) Metadata Repository Data Warehouse Modeling: Data Cube and OLAP (a) Cube: A Lattice of Cuboids (b) Conceptual Modeling of Data Warehouses (c) Stars, Snowflakes, and Fact Constellations: Schemas for Multidimensional Databases (d) Dimensions: The Role of Concept Hierarchy (e) Measures: Their Categorization and Computation (f) Cube Definitions in Database systems (g) Typical OLAP Operations (h) A Starnet Query Model for Querying Multidimensional Databases Data Warehouse Design and Usage (a) Design of Data Warehouses: A Business Analysis Framework (b) Data Warehouses Design Processes (c) Data Warehouse Usage (d) From On-Line Analytical Processing to On-Line Analytical Mining Data Warehouse Implementation (a) Efficient Data Cube Computation: Cube Operation, Materialization of Data Cubes, and Iceberg Cubes (b) Indexing OLAP Data: Bitmap Index and Join Index (c) Efficient Processing of OLAP Queries (d) OLAP Server Architectures: ROLAP vs. MOLAP vs. HOLAP Summary 47