Data Mining:

Concepts and
Techniques

1
 Knowledge discovery

 Data cleaning – to remove noise and

inconsistent data
 Data integration- where multiple data sources
may be combined
 Data selection- where data relevant to the
analysis task are retrieved from the database
 Data transformation- where data are
transformed or consolidated into forms
appropriate for mining by performing summary
or aggregation operations
 Data mining- a process where intelligent
methods are applied in order to extract data 2
 Knowledge discovery

 Pattern evaluation- to identify the truly

interesting patterns representing knowledge
based on some interestingness measures
 Knowledge presentation- where visualization and
knowledge representation techniques are used
to present the mined knowledge to the user

3
 Data mining system

 Data Base, data warehouse or other information

repository – this is one or a set of databases,
data warehouse, spreadsheets or other kinds of
information repositories.
 Database or data warehouse server –
responsible for fetching the relevant data, based
on the user’s data mining request.
 Knowledge base - domain knowledge used to
guide the search or evaluate the interestingness
of resulting patterns.

4
 Data mining system

 Data mining engine – consists of a set of

functional modules for tasks such as
characterization, association, classification,
cluster analysis and evolution
 Pattern evaluation module- employs
interestingness measures and interacts with the
data mining modules so as to focus the search
towards interesting patterns.
 Graphical User Interface- communicates
between users and the data mining system,
allowing user to interact with the system by
specifying a data mining query or task, providing
information to help focus the search, and
performing exploratory data mining based on 5
Architecture of a Typical Data
Mining System

Graphical user interface

Pattern evaluation

Data mining engine

Knowledge-
Database or
base
data warehouse
server
Data cleaning & data integration Filtering

Data
Databases Warehouse

6
What is a data warehouse?

7
 What is Data Warehouse?

 Defined in many different ways, but not

rigorously.
 A decision support database that is maintained

separately from the organization’s operational

database
 Support information processing by providing a

solid platform of consolidated, historical data

for analysis.
 “A data warehouse is a subject-oriented,
integrated, time-variant, and nonvolatile
collection of data in support of management’s
decision-making process.”—W. H. Inmon
 Data warehousing:
 The process of constructing and using data
8
 Data Warehouse—Subject-
Oriented

 Organized around major subjects, such as

customer, 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 the decision support process.

9
 Data Warehouse—Integrated
 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

E.g., Hotel price: currency, tax, breakfast covered,
etc.
 When data is moved to the warehouse, it is
converted.
10
 Data Warehouse—Time Variant

 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)
 Every key structure in the data warehouse
 Contains an element of time, explicitly or
implicitly
 But the key of operational data may or may not
11
 Data Warehouse—Non-Volatile

 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:
 12
 Data Warehouse vs. Heterogeneous
DBMS

 Traditional heterogeneous DB integration:

 Build wrappers/ integrators (or mediators) on top of
heterogeneous databases
 Query driven approach

When a query is posed to a client site, a meta-
dictionary is used to translate the query into queries
appropriate for individual heterogeneous sites
involved, and the results are integrated into a global
answer set
 Requires complex information filtering, compete for
resources
 Data warehouse: update-driven, high performance
 Information from heterogeneous sources is integrated in
13
 Data Warehouse vs. Operational
DBMS
 OLTP (on-line transaction processing)
 Major task of traditional relational DBMS
 Day-to-day operations: purchasing, inventory, banking,
manufacturing, payroll, registration, accounting, etc.
 OLAP (on-line analytical processing)
 Major task of data warehouse system
 Data analysis and decision making
 Distinct features (OLTP vs. OLAP):
 User and system orientation: customer vs. market
 Data contents: current, detailed vs. historical,
consolidated
 Database design: ER (entity-relationship) data model+
application-oriented database design vs. star model +
subject-oriented database design 14
Data Warehouse vs. Operational
DBMS

 View: current, local (within an organization, without

referring to historical data or data in different
organizations)
vs. evolutionary, integrated (deal with information that
originates from different organizations, b’coz of huge
volume data stored on multiple storage media
 Access patterns: update (short, atomic transactions,
requires concurrency control and recovery
mechanisms)
vs. read-only but complex queries

15
 OLTP vs. OLAP
OLTP OLAP
users clerk, IT professional knowledge worker
function day to day operations decision support
DB design application-oriented subject-oriented
data current, up-to-date historical,
detailed, flat relational summarized, multidimensional
isolated integrated, consolidated
usage repetitive ad-hoc
access read/write lots of scans
index/hash on prim. key
unit of work short, simple transaction complex query
# records accessed tens millions
#users thousands hundreds
DB size 100MB-GB 100GB-TB
metric transaction throughput query throughput, response

16
 Why Separate Data Warehouse?
 High performance for both systems
 DBMS— tuned for OLTP: access methods,

indexing, concurrency control, recovery

 Warehouse—tuned for OLAP: complex OLAP

queries, multidimensional view, consolidation.

 Different functions and different data:
 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

17
A multi-dimensional data model

18
 From Tables and
Spreadsheets to Data
Cubes

Adata warehouse is based on a multidimensional
data model which views data in the form of a
data cube
 A data cube (such as sales) allows data to be
modeled and viewed in multiple dimensions. It is
defined by dimensions and facts.
 Dimensions are the perspectives or entities wrt
which an organization wants to keep records.
e.g. A sales data warehouse to keep records of
the store’s sales wrt dimensions time, item,
branch and location
19
 From Tables and Spreadsheets to
Data Cubes

 Each dimension may have a table associated

with it called a dimension table, which further
describes the dimension. E.g. dimension table
for item may contain the attributes item_name,
brand, type.
 Facts are numerical measures. Quantities by
which we want to analyze relationship between
dimensions. E.g. facts for a sales data
warehouse include dollars_sold (sales amount in
dollars), units_sold( number of units sold) and
amount_budgeted.
20
 From Tables and Spreadsheets to
Data Cubes

 Fact table contains the names of the facts or

measures, as well as keys to each of the related
dimension tables.
 In data warehousing literature, an n-D base
cube is called a base 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.

21
 Cube: A Lattice of
Cuboids

all
0-D(apex) cuboid

time item location supplier

1-D cuboids

time,item time,location item,location location,supplier

2-D cuboids
time,supplier item,supplier

time,location,supplier
time,item,location 3-D cuboids
time,item,supplier item,location,supplier

4-D(base) cuboid
time, item, location, supplier
22
 Conceptual Modeling
of Data Warehouses
 Modeling data warehouses: dimensions &
measures
 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
dimension tables, viewed as a collection of
23
 Example of Star Schema
time
time_key item
day item_key
day_of_the_week Sales Fact Table item_name
month brand
quarter time_key type
year supplier_type
item_key
branch_key
branch location
location_key
branch_key location_key
branch_name units_sold street
branch_type city
dollars_sold province_or_street
country
avg_sales
Measures

24
 Example of Snowflake
Schema
time
time_key item
day item_key supplier
day_of_the_week Sales Fact Table item_name supplier_key
month brand supplier_type
quarter time_key type
year item_key supplier_key

branch_key
location
branch location_key
location_key
branch_key
units_sold street
branch_name
city_key city
branch_type
dollars_sold
city_key
avg_sales city
province_or_street
Measures country

25
 Example of Fact
Constellation
time
time_key item Shipping Fact Table
day item_key
day_of_the_week Sales Fact Table item_name time_key
month brand
quarter time_key type item_key
year supplier_type shipper_key
item_key
from_location
branch_key
branch location_key location to_location
branch_key location_key dollars_cost
branch_name units_sold
street
branch_type dollars_sold city units_shipped
province_or_street
avg_sales country shipper
Measures shipper_key
shipper_name
location_key
shipper_type 26
 Data warehouse and data mart

 A data warehouse collects information about

subjects that span the entire organization, such
as customers, items, sales, assets and personal,
and its scope enterprise-wide. Fact constellation
schema is commonly used (it can model
multiple, interrelated subjects).
 A data mart is a department subset of the data
warehouse that focuses on selected subjects,
and its scope is department-wide. Star and
snowflake schema are commonly used (both are
geared towards modeling single subjects, star is
more popular and efficient).
27
 A Data Mining Query
Language, DMQL: Language
Primitives
 Cube Definition (Fact Table)
define cube <cube_name> [<dimension_list>]:
<measure_list>
 Dimension Definition ( Dimension Table )
define dimension <dimension_name> as
(<attribute_or_subdimension_list>)
 Special Case (Shared Dimension Tables)
 First time as “cube definition”

 define dimension <dimension_name> as

<dimension_name_first_time> in cube
<cube_name_first_time>

28
 Defining a Star Schema in
DMQL

define cube sales_star [time, item, branch,

location]:
dollars_sold = sum(sales_in_dollars),
avg_sales = avg(sales_in_dollars), units_sold
= count(*)
define dimension time as (time_key, day,
day_of_week, month, quarter, year)
define dimension item as (item_key, item_name,
brand, type, supplier_type)
define dimension branch as (branch_key,
branch_name, branch_type)
define dimension location as (location_key, street,
city, province_or_state, country) 29
 Defining a Snowflake Schema in
DMQL

define cube sales_snowflake [time, item, branch,

location]:
dollars_sold = sum(sales_in_dollars), avg_sales =
avg(sales_in_dollars), units_sold = count(*)
define dimension time as (time_key, day, day_of_week,
month, quarter, year)
define dimension item as (item_key, item_name,
brand, type, supplier(supplier_key, supplier_type))
define dimension branch as (branch_key,
branch_name, branch_type)
define dimension location as (location_key, street,
30
 Defining a Fact Constellation in
DMQL

define cube sales [time, item, branch, location]:

dollars_sold = sum(sales_in_dollars), avg_sales =
avg(sales_in_dollars), units_sold = count(*)
define dimension time as (time_key, day, day_of_week, month,
quarter, year)
define dimension item as (item_key, item_name, brand, type,
supplier_type)
define dimension branch as (branch_key, branch_name, branch_type)
define dimension location as (location_key, street, city,
province_or_state, country)
define cube shipping [time, item, shipper, from_location, to_location]:
dollar_cost = sum(cost_in_dollars), unit_shipped = count(*)
define dimension time as time in cube sales
define dimension item as item in cube sales
define dimension shipper as (shipper_key, shipper_name, location as
location in cube sales, shipper_type)
define dimension from_location as location in cube sales
define dimension to_location as location in cube sales 31
 Measures: Three
Categories
 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.
 E.g., count(), sum(), min(), max().
 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. E.g., avg(), min_N(),
standard_deviation().
 holistic: if there is no constant bound on the
storage size needed to describe a subaggregate.
i.e. there doesn't exit an algebraic function with M
32
 A Concept Hierarchy

 A concept hierarchy defines a sequence of

mapping from a set of low-level concepts to
higher-level, more general concepts.

33
 A Concept Hierarchy: Dimension
(location)

all all

region Europe ... North_America

country Germany ... Spain Canada ... Mexico

city Frankfurt ... Vancouver ... Toronto

office L. Chan ... M. Wind

34
 A Concept Hierarchy

year

country
quarter

Province_or_sta
te month week
city

Street
day

Partial order,
lattice
35
View of Warehouses and
Hierarchies

Specification of
hierarchies
 Schema
hierarchy
day <
{month <
quarter;
week} <
year
 Set_grouping
hierarchy
{1..10} <
inexpensi
ve
36
 Multidimensional Data
 Sales volume as a function of product, month,
and region
Dimensions: Product, Location, Time
Hierarchical summarization paths
o n
gi

Industry Region Year

Re

Category Country Quarter

Product

Product City Month Week

Office Day

Month
37
 A Sample Data Cube
Total annual sales
Date of TV in U.S.A.
1Qtr 2Qtr 3Qtr 4Qtr sum
c t

TV
du

PC U.S.A
o
Pr

VCR

Country
sum
Canada

Mexico

sum

38
 Cuboids Corresponding to the
Cube

all
0-D(apex) cuboid
product date country
1-D cuboids

product,date product,country date, country

2-D cuboids

3-D(base) cuboid
product, date, country

39
 Typical OLAP Operations

 Roll up (drill-up): summarize data

 by climbing up hierarchy or by dimension reduction
 Street<city<state<country
 Drill down (roll down): reverse of roll-up
 from higher level summary to lower level summary or
detailed data, or introducing new dimensions
 Day<month<quarter<year
 Slice and dice: project and select
 Slice operation performs a selection on 1-D of the cube,
resulting in a subcube
 Dice operation defines a subcube by performing a
selection on 2D or more dimensions.

40
 Typical OLAP Operations

 Pivot (rotate):
 reorient the cube, visualization, 3D to series
of 2D planes.
 Other operations
 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)

41
A Star-Net Model

location
customer
Country
State group
City category
street name

day item
month Name brand category
quarte type
y r
ear Each line consists of footprints
time (circles) representing abstraction
levels of dimension
42
Data warehouse architecture

43
 Design of a Data Warehouse: A
Business Analysis Framework
 Four views regarding the design of a data
warehouse
 Top-down view

allows selection of the relevant information necessary
for the data warehouse
 Data source view

exposes the information being captured, stored, and
managed by operational systems
 Data warehouse view

consists of fact tables and dimension tables
 Business query view

sees the perspectives of data in the warehouse from
44
 Data Warehouse Design
Process

 Top-down, bottom-up approaches or a combination of both

 Top-down: Starts with overall design and planning

(mature)
 Bottom-up: Starts with experiments and prototypes

(rapid)
 From software engineering point of view
 Waterfall: structured and systematic analysis at each

step before proceeding to the next

 Spiral: rapid generation of increasingly functional

systems, short turn around time, quick turn around

 Typical data warehouse design process
 Choose a business process to model, e.g., orders,

invoices, etc.
 Choose the grain (atomic level of data) of the business

process 45
 Multi-Tiered Architecture

Monitor
& OLAP Server
other Metadata
source Integrator
s Analysis
Operational Extract Query
Transform Data Serve Reports
DBs Load
Refresh
Warehouse Data mining

Data Marts

Data Sources Data Storage OLAP Engine Front-End Tools

46
 Three Data Warehouse
Models
 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
 Independent vs. dependent (directly from warehouse)
data mart
 Virtual warehouse
 A set of views over operational databases

 Only some of the possible summary views may 47

Data Warehouse
Development: A
Recommended Approach
Multi-Tier Data
Warehouse
Distributed
Data Marts

Enterprise
Data Data
Data
Mart Mart
Warehouse

Model refinement Model refinement

Define a high-level corporate data model

48
 OLAP Server Architectures
 Relational OLAP (ROLAP)
 Use relational or extended-relational DBMS to store and

manage warehouse data and OLAP middle ware to

support missing pieces
 Include optimization of DBMS backend, implementation of

aggregation navigation logic, and additional tools and

services
 greater scalability

 Multidimensional OLAP (MOLAP)

 Array-based multidimensional storage engine (sparse

matrix techniques)
 fast indexing to pre-computed summarized data

 Hybrid OLAP (HOLAP)

 User flexibility, e.g., low level: relational, high-level: array

 Specialized SQL servers 49

Data warehouse implementation

50
 Efficient Data Cube Computation
 Data cube can be viewed as a lattice of cuboids
 The bottom-most cuboid is the base cuboid
 The top-most cuboid (apex) contains only one
cell
 How many cuboids
n
T = ∏ ( Li +1)
in an n-dimensional cube
with L levels?
i =1

 Materialization of data cube

 Materialize every (cuboid) (full materialization),
none (no materialization), or some (partial
materialization)
51
 Cube Operation
 Cube definition and computation in DMQL
define cube sales[item, city, year]: sum(sales_in_dollars)
compute cube sales
 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)
CUBE BY item, city, year
 Need compute the following Group-Bys
(date, product, customer),
(city, item) (city, year) (item, year)
(date,product),(date, customer), (product, customer),
(date), (product), (customer)
() (city, item, year)
52
 Cube Computation: ROLAP-Based
Method
 Efficient cube computation methods
 ROLAP-based cubing algorithms (Agarwal et al’96)
 Array-based cubing algorithm (Zhao et al’97)
 Bottom-up computation method (Bayer &
Ramarkrishnan’99)
 ROLAP-based cubing algorithms
 Sorting, hashing, and grouping operations are applied
to the dimension attributes in order to reorder and
cluster related tuples
 Grouping is performed on some subaggregates as a
“partial grouping step”
 Aggregates may be computed from previously
computed aggregates, rather than from the base fact
53
 Multi-way Array Aggregation for
Cube Computation
 Partition arrays into chunks (a small subcube which fits in
memory).
 Compressed sparse array addressing: (chunk_id, offset)
 Compute aggregates in “multiway” by visiting cube cells in
the order which minimizes the # of times to visit each cell,
and reduces memory63 access and storage cost.
C c3 61
c2 45
62 64
46 47 48
c1 29 30 31 32 What is the best
c0
b3 B13 14 15 16 60 traversing order
44
9
28 56 to do multi-way
b2
B 40
24 52 aggregation?
b1 5 36
20
b0 1 2 3 4
a0 a1 a2 a3
A 54
Multi-way Array Aggregation
for Cube Computation

C c3 61
c2 45
62 63 64
46 47 48
c1 29 30 31 32
c0
B13 14 15 16 60
b3 44
B 28 56
b2 9
40
24 52
b1 5
36
20
b0 1 2 3 4
a0 a1 a2 a3
A

55
Multi-way Array Aggregation
for Cube Computation

C c3 61
c2 45
62 63 64
46 47 48
c1 29 30 31 32
c0
B13 14 15 16 60
b3 44
B 28 56
b2 9
40
24 52
b1 5
36
20
b0 1 2 3 4
a0 a1 a2 a3
A

56
 Multi-Way Array Aggregation for
Cube Computation (Cont.)

 Method: the planes should be sorted and

computed according to their size in ascending
order.
 See the details of Example 2.12 (pp. 75-78)

 Idea: keep the smallest plane in the main

memory, fetch and compute only one chunk

at a time for the largest plane
 Limitation of the method: computing well only
for a small number of dimensions
 If there are a large number of dimensions,

“bottom-up computation” and iceberg cube

computation methods can be explored
57
 Indexing OLAP Data: Bitmap
Index
 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

Base table Index on Region Index on Type

Cust Region Type RecIDAsia Europe America RecID Retail Dealer
C1 Asia Retail 1 1 0 0 1 1 0
C2 Europe Dealer 2 0 1 0 2 0 1
C3 Asia Dealer 3 1 0 0 3 0 1
C4 America Retail 4 0 0 1 4 1 0
C5 Europe Dealer 5 0 1 0 5 0 1
58
 Indexing OLAP Data: Join Indices
 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 — a rather

costly operation
 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 59
 Efficient Processing OLAP
Queries

 Determine which operations should be performed

on the available cuboids:
 transform drill, roll, etc. into corresponding SQL
and/or OLAP operations, e.g, dice = selection +
projection
 Determine to which materialized cuboid(s) the
relevant operations should be applied.
 Exploring indexing structures and compressed vs.
dense array structures in MOLAP
60
 Metadata Repository
 Meta data is the data defining warehouse objects. It has the
following kinds
 Description of the structure of the warehouse

 schema, view, dimensions, hierarchies, derived data defn,

data mart locations and contents
 Operational meta-data

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)
 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 61
 Data Warehouse Back-End Tools and
Utilities
 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
62
Further development of data cube

technology

63
 Discovery-Driven Exploration of
Data Cubes

 Hypothesis-driven: exploration by user, huge search space

 Discovery-driven
 pre-compute measures indicating exceptions, guide user
in the data analysis, at all levels of aggregation
 Exception: significantly different from the value
anticipated, based on a statistical model
 Visual cues such as background color are used to reflect
the degree of exception of each cell
 Computation of exception indicator (modeling fitting and
computing SelfExp, InExp, and PathExp values) can be
overlapped with cube construction
64
Examples: Discovery-Driven Data
Cubes

65
 Complex Aggregation at Multiple
Granularities: Multi-Feature Cubes

 Multi-feature cubes (Ross, et al. 1998): Compute complex

queries involving multiple dependent aggregates at multiple
granularities
 Ex. Grouping by all subsets of {item, region, month}, find
the maximum price in 1997 for each group, and the total
sales among all maximum price tuples
select item, region, month, max(price), sum(R.sales)
from purchases
where year = 1997
cube by item, region, month: R
such that R.price = max(price)
 Continuing the last example, among the max price tuples,
find the min and max shelf life, and find the fraction of the
total sales due to tuple that have min shelf life within the set 66
From data warehousing to data

mining

67
 Data Warehouse Usage
 Three kinds of data warehouse applications
 Information processing

supports querying, basic statistical analysis, and
reporting using crosstabs, tables, charts and graphs
 Analytical processing
 multidimensional analysis of data warehouse data

supports basic OLAP operations, slice-dice, drilling,
pivoting
 Data mining
 knowledge discovery from hidden patterns
 supports associations, constructing analytical
models, performing classification and prediction,
and presenting the mining results using
68
 From On-Line Analytical
Processing to On Line
Analytical Mining (OLAM)

 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.
 Architecture of OLAM
69
 An OLAM Architecture
Mining query Mining result Layer4
User Interface
User GUI API
Layer3
OLAM OLAP
Engine Engine OLAP/OLAM

Data Cube API

Layer2
MDDB
MDDB
Meta
Data
Filtering&Integration Database API Filtering
Layer1
Data cleaning Data
Databases Data
Data integration Warehouse Repository
70