Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Data Warehouse MIT-652 Data Mining Applications Thimaporn Phetkaew School of Informatics, Walailak University MIT-652: DM 2: Data Warehouse 1 Chapter 2: Data Warehousing and OLAP Technology for Data Mining What is a data warehouse? A multi-dimensional data model Data warehouse architecture Data warehouse implementation Further development of data cube technology From data warehousing to data mining MIT-652: DM 2: Data Warehouse 2 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 warehouses MIT-652: DM 2: Data Warehouse 3 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. MIT-652: DM 2: Data Warehouse 4 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 MIT-652: DM E.g., Hotel price: currency, tax, breakfast covered, etc. When data is moved to the warehouse, it is converted. 2: Data Warehouse 5 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 MIT-652: DM Contains an element of time, explicitly or implicitly But the key of operational data may or may not contain “time element”. 2: Data Warehouse 6 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: MIT-652: DM initial loading of data and access of data. 2: Data Warehouse 7 Data Warehouse vs. Heterogeneous DBMS Traditional heterogeneous DB integration: Build wrappers/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 and integration process Data warehouse: update-driven MIT-652: DM Information from heterogeneous sources is integrated in advance and stored in warehouses for direct query and analysis 2: Data Warehouse 8 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 + application vs. star + subject View: current, local vs. evolutionary, integrated Access patterns: update vs. read-only but complex queries MIT-652: DM 2: Data Warehouse 9 OLTP vs. OLAP OLTP OLAP Characteristic operational processing Information processing users clerk, DB professional manager, executive, analyst function day to day operations decision support DB design ER based, application-oriented subject-oriented data usage current, up-to-date detailed, flat relational isolated repetitive historical, summarized, multidimensional integrated, consolidated ad-hoc access read/write mostly read, lots of scans focus data in information out 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 MIT-652: DM 2: Data Warehouse 10 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 formats which have to be reconciled MIT-652: DM 2: Data Warehouse 11 Chapter 2: Data Warehousing and OLAP Technology for Data Mining What is a data warehouse? A multi-dimensional data model Data warehouse architecture Data warehouse implementation Further development of data cube technology From data warehousing to data mining MIT-652: DM 2: Data Warehouse 12 From Tables and Spreadsheets to Data Cubes A data 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 MIT-652: DM 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 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. 2: Data Warehouse 13 Cube: A Lattice of Cuboids all time 0-D(apex) cuboid item time,location time,item location item,location time,supplier time,item,location supplier location,supplier item,supplier time,location,supplier time,item,supplier 1-D cuboids 2-D cuboids 3-D cuboids item,location,supplier 4-D(base) cuboid time, item, location, supplier MIT-652: DM 2: Data Warehouse 14 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 stars, therefore called galaxy schema or fact constellation MIT-652: DM 2: Data Warehouse 15 Example of Star Schema time item time_key day day_of_the_week month quarter year Sales Fact Table time_key item_key branch_key branch branch_key branch_name branch_type location_key units_sold dollars_sold avg_sales location location_key street city province_or_street country (…,Phayathai,BKK,Thailand) (…,Ratchatavee,BKK,Thailand) Measures MIT-652: DM item_key item_name brand type supplier_type 2: Data Warehouse 16 Example of Snowflake Schema time time_key day day_of_the_week month quarter year item Sales Fact Table time_key item_key branch_key branch location_key branch_key branch_name branch_type units_sold dollars_sold avg_sales Measures MIT-652: DM 2: Data Warehouse item_key item_name brand type supplier_key supplier supplier_key supplier_type location location_key street city_key city city_key city province_or_street country 17 Example of Fact Constellation time time_key day day_of_the_week month quarter year item Sales Fact Table time_key item_key item_key item_name brand type supplier_type location_key branch_key branch_name branch_type units_sold dollars_sold avg_sales item_key shipper_key location to_location location_key street city province_or_street country dollars_cost Measures MIT-652: DM time_key from_location branch_key branch Shipping Fact Table 2: Data Warehouse units_shipped shipper shipper_key shipper_name location_key shipper_type 18 A Data Mining Query Language, DMQL: Language Primitives MIT-652: DM 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> 2: Data Warehouse 19 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) MIT-652: DM 2: Data Warehouse 20 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, city(city_key, province_or_state, country)) MIT-652: DM 2: Data Warehouse 21 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 MIT-652: DM 2: Data Warehouse 22 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. 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 avg() = sum()/count() function. E.g., count(), sum(), min(), max(). E.g., avg(), min_N(), standard_deviation(). holistic: if there is no constant bound on the storage size needed to describe a subaggregate. MIT-652: DM E.g., median(), mode(), rank(). 2: Data Warehouse 23 A Concept Hierarchy: Dimension (location) all all Europe region country city office MIT-652: DM Germany Frankfurt ... ... ... Spain North_America Canada Vancouver ... L. Chan 2: Data Warehouse ... ... Mexico Toronto M. Wind 24 Multidimensional Data Sales volume as a function of product, month, and region Dimensions: Product, Location, Time Hierarchical summarization paths Re g io n Industry Region Year Product Category Country Quarter Product Office Month MIT-652: DM City total order 2: Data Warehouse Month Week Day partial order 25 1Qtr 2Qtr 3Qtr 4Qtr sum Total annual sales of TV in U.S.A. U.S.A Pr TV PC VCR sum Quarter Canada Mexico Country od uc t A Sample Data Cube sum MIT-652: DM 2: Data Warehouse 26 Cuboids Corresponding to the Cube all 0-D(apex) cuboid product product,date country date product,country 1-D cuboids date, country 2-D cuboids product, date, country MIT-652: DM 2: Data Warehouse 3-D(base) cuboid 27 Browsing a Data Cube MIT-652: DM 2: Data Warehouse Visualization OLAP capabilities Interactive manipulation 28 Typical OLAP Operations Roll up (drill-up): summarize data Drill down (roll down): reverse of roll-up project and select Pivot (rotate): from higher level summary to lower level summary or detailed data, or introducing new dimensions Slice and dice: by climbing up hierarchy or by dimension reduction reorient the cube, visualization, 3D to series of 2D planes. Other operations MIT-652: DM drill across: involving (across) more than one fact table drill through: through the bottom level of the cube to its backend relational tables (using SQL) 2: Data Warehouse 29 Typical OLAP Operations rool-up on location (from cities to countries) location (cities) Chicago 440 New York 1560 Toronto 395 location (countries) USA Canada Vancouver 605 825 14 400 Q1 time (quarters) time (quarters) Q1 Q2 Q3 Q4 2000 1000 Q2 Q3 Q4 Security Phone Computer Home Ent. Security Phone Computer Home Ent. item (types) item (types) MIT-652: DM 2: Data Warehouse 30 Typical OLAP Operations drill-down on time (from quarters to months) location (cities) Chicago 440 New York 1560 Toronto 395 location (cities) Vancouver 605 825 14 400 New York Toronto Vancouver Q2 time (months) time (quarters) Q1 Q3 Q4 JAN 150 FEB 100 ... 150 item (types) Security Phone 2: Data Warehouse Computer Home Ent. Security Phone Computer Home Ent. DEC item (types) MIT-652: DM Chicago 31 Typical OLAP Operations dice for location (cities) (location = “Toronto” or “Vancouver”) and (time = “Q1” or “Q2”) and (item = “Home Ent.” or “Computer”) Chicago 440 New York 1560 Toronto 395 Vancouver 605 825 14 400 location (cities) Toronto Q3 Q4 Q1 605 Q2 Computer Home Ent. Security Phone Computer Home Ent. item (types) MIT-652: DM 395 Vancouver Q2 time (quarters) time (quarters) Q1 item (types) 2: Data Warehouse 32 Typical OLAP Operations slice for time = “Q1” location (cities) Chicago 440 New York 1560 Toronto 395 Vancouver 605 825 14 400 Q2 New York Toronto Home Ent. Q4 Security Phone Computer Home Ent. 825 14 400 Security 605 Phone Vancouver Q3 Computer time (quarters) Q1 location (cities) Chicaco item (types) item (types) MIT-652: DM 2: Data Warehouse 33 Typical OLAP Operations pivot item (types) location (cities) Chicaco New York Toronto 825 Phone 14 Security 400 Vancouver Toronto item (types) MIT-652: DM Computer New York 400 605 Chicaco 14 Security Home Ent. 825 Phone 605 Computer Vancouver Home Ent. location (cities) 2: Data Warehouse 34 Chapter 2: Data Warehousing and OLAP Technology for Data Mining What is a data warehouse? A multi-dimensional data model Data warehouse architecture Data warehouse implementation Further development of data cube technology From data warehousing to data mining MIT-652: DM 2: Data Warehouse 35 Data Warehouse Design Process 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 Choose the dimensions that will apply to each fact table record Choose the measure that will populate each fact table record MIT-652: DM 2: Data Warehouse 36 Multi-Tier Data Warehouse Architecture other Metadata sources Operational DBs Extract Transform Load Refresh Monitor & Integrator OLAP Server Serve Data Warehouse Client Analysis Query Reports Data mining Data Marts Data Sources MIT-652: DM Data Storage OLAP Engine Front-End Tools 2: Data Warehouse 37 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 be materialized MIT-652: DM 2: Data Warehouse 38 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 MIT-652: DM 2: Data Warehouse 39 Chapter 2: Data Warehousing and OLAP Technology for Data Mining What is a data warehouse? A multi-dimensional data model Data warehouse architecture Data warehouse implementation Further development of data cube technology From data warehousing to data mining MIT-652: DM 2: Data Warehouse 40 Efficient Data Cube Computation Data cube can be viewed as a lattice of cuboids How many cuboids in an n-dimensional cube with L levels? ( 2n if no hierarchies associated with each dimension) all n T = ∏ ( Li + 1) i =1 product date country product,date product,country date, country ( Li = #levels of hierarchy associated with dimension ith) Materialization of data cube Materialize every (cuboid) (full materialization), none (no materialization), or some (partial materialization) Selection of which cuboids to materialize MIT-652: DM product, date, country Based on size, workload, frequency, access cost, etc. 2: Data Warehouse 41 Cube Computation: ROLAP-Based Method ROLAP-based cubing algorithms MIT-652: DM 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 table 2: Data Warehouse 42 Multi-way Array Aggregation for Cube Computation (MOLAP-Based Method) 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 memory access and storage cost. C c3 61 62 63 64 c2 45 46 47 48 c1 30 31 32 c 0 29 B b3 B13 b2 9 b1 5 b0 1 2 3 4 a0 a1 a2 a3 MIT-652: DM 14 A 15 16 60 44 28 56 40 24 52 36 20 cuboid ABC What is the best traversing order to do multi-way aggregation? 2: Data Warehouse 43 Multi-way Array Aggregation for Cube Computation C 62 63 64 c3 61 c2 45 46 47 48 c1 29 30 31 32 c0 b3 B13 14 15 16 28 B b2 9 b1 5 b0 1 2 3 4 a0 a1 a2 a3 24 20 44 40 36 60 56 cuboid ABC 52 A How to compute chunk b0c0 of cuboid BC ? MIT-652: DM 2: Data Warehouse 44 Multi-way Array Aggregation for Cube Computation AC a0c0 C c2 c345 61 BC c1 29 c0 B b3 13 b0c0 30 46 14 62 31 15 47 63 32 48 64 16 28 B b2 9 b1 5 b0 1 2 3 4 a0 a1 a2 a3 24 20 44 40 36 60 ABC 56 52 A AB MIT-652: DM a0b0 2: Data Warehouse 45 Multi-Way Array Aggregation for Cube Computation (Cont.) Method: the planes should be sorted and computed according to their size in ascending order. 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, “bottomup computation” and iceberg cube computation methods can be explored MIT-652: DM 2: Data Warehouse 46 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 Cust C1 C2 C3 C4 C5 Region Asia Europe Asia America Europe MIT-652: DM 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 3 0 1 1 0 0 Retail 4 1 0 4 0 0 1 5 0 1 0 1 0 Dealer 5 2: Data Warehouse 47 Indexing OLAP Data: Join Index Traditional indices map the values in a given column to a list of rows having that value. In data warehouses, join index relates the values of the dimensions of a star schema to rows in the fact table. E.g. fact table: Sales and two dimensions location and item A join index on item maintains for each distinct item A list of the tuples recording the Sales for that items Join indices can span multiple dimensions MIT-652: DM 2: Data Warehouse 48 Indexing OLAP Data: Join Index sales location T57 Main Street T238 item Sony-TV T459 T884 MIT-652: DM 2: Data Warehouse 49 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 MIT-652: DM 2: Data Warehouse 50 OLAP Queries: An Example location item country type province city street brand item_name the query will be processed on {brand,province_or_state} the selection constraint “year = 2000” Materialized cuboids cuboid1: {item_name,city,year} cuboid2: {brand,country,year} cuboid3: {brand,province_or_state,year} cuboid4: {item_name,province_or_state} where year = 2000 MIT-652: DM 2: Data Warehouse 51 Data Warehouse Back-End Tools and Utilities Data extraction: Data cleaning: convert data from legacy or host format to warehouse format Load: detect errors in the data and rectify them when possible Data transformation: get data from multiple, heterogeneous, and external sources sort, summarize, consolidate, compute views, check integrity, and build indicies and partitions Refresh MIT-652: DM propagate the updates from the data sources to the warehouse 2: Data Warehouse 52 Chapter 2: Data Warehousing and OLAP Technology for Data Mining What is a data warehouse? A multi-dimensional data model Data warehouse architecture Data warehouse implementation Further development of data cube technology From data warehousing to data mining MIT-652: DM 2: Data Warehouse 53 Discovery-Driven Exploration of Data Cubes Hypothesis-driven: exploration by user, huge search space Discovery-driven (Sarawagi et al.’98) 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 MIT-652: DM 2: Data Warehouse 54 Examples: Discovery-Driven Data Cubes MIT-652: DM 2: Data Warehouse 55 Chapter 2: Data Warehousing and OLAP Technology for Data Mining What is a data warehouse? A multi-dimensional data model Data warehouse architecture Data warehouse implementation Further development of data cube technology From data warehousing to data mining MIT-652: DM 2: Data Warehouse 56 Data Warehouse Usage Three kinds of data warehouse applications Information processing Analytical processing multidimensional analysis of data warehouse data supports basic OLAP operations, slice-dice, drilling, pivoting Data mining supports querying, basic statistical analysis, and reporting using crosstabs, tables, charts and graphs knowledge discovery from hidden patterns supports associations, constructing analytical models, performing classification and prediction, and presenting the mining results using visualization tools. Differences among the three tasks MIT-652: DM 2: Data Warehouse 57 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 MIT-652: DM 2: Data Warehouse 58 An OLAM Architecture Mining query Mining result Layer4 User Interface User GUI API OLAM Engine OLAP Engine Layer3 OLAP/OLAM Data Cube API Layer2 MDDB Meta Data Filtering&Integration Database API Multidimensional DB Filtering Layer1 Databases MIT-652: DM Data cleaning Data Data integration Warehouse 2: Data Warehouse Data Repository 59 Summary Data warehouse: A subject-oriented, integrated, time-variant, and nonvolatile collection of data in support of management’s decisionmaking process A multi-dimensional model of a data warehouse Star schema, snowflake schema, fact constellations A data cube consists of dimensions & measures Concept Hierarchies: organize the value of attributes or dimensions into gradual levels of abstraction OLAP operations: drilling, rolling, slicing, dicing and pivoting MIT-652: DM 2: Data Warehouse 60 Summary OLAP servers: ROLAP, MOLAP, HOLAP Efficient computation of data cubes MIT-652: DM Partial vs. full vs. no materialization Multiway array aggregation Bitmap index and join index implementations 2: Data Warehouse 61