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
课程网站 http://admis.fudan.edu.cn/member/sgzhou/co urses/data-mining-2007s/2007dm.htm 2007-4-1 Data Mining: Tech. and Appl. 1 Lecture 3 Data Warehousing and OLAP Technology for Data Mining Zhou Shuigeng March 25, 2007 2007-4-1 Data Mining: Tech. and Appl. 2 Outline 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 2007-4-1 Data Mining: Tech. and Appl. 3 Outline 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 2007-4-1 Data Mining: Tech. and Appl. 4 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, timevariant, and nonvolatile collection of data in support of management’s decision-making process.”—W. H. Inmon Building the Data Warehouse. New York: John Wiley & Sons, 1996 Data warehousing: The process of constructing and using data warehouses 2007-4-1 Data Mining: Tech. and Appl. 5 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. 2007-4-1 Data Mining: Tech. and Appl. 6 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. 2007-4-1 Data Mining: Tech. and Appl. 7 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 contain “time element”. 2007-4-1 Data Mining: Tech. and Appl. 8 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: initial loading of data and access of data. 2007-4-1 Data Mining: Tech. and Appl. 9 Data Warehouse vs. Heterogeneous DBMS Traditional heterogeneous DB integration: Build wrappers/mediators on top of heterogeneous databases IBM Data Joiner; Informix Datablade 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 Complex information filtering, compete for local resources Data warehouse: update-driven, high performance Information from heterogeneous sources is integrated in advance and stored in warehouses for direct query and analysis Operationally independent from local processing 2007-4-1 Data Mining: Tech. and Appl. 10 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 2007-4-1 Data Mining: Tech. and Appl. 11 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 detailed, flat relational isolated repetitive historical, summarized, multidimensional integrated, consolidated ad-hoc usage access unit of work # records accessed #users read/write lots of scans index/hash on prim. key short, simple complex query transaction tens millions thousands hundreds DB size 100MB-GB 100GB-TB metric transaction throughput query throughput, response 2007-4-1 Data Mining: Tech. and Appl. 12 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 2007-4-1 data quality: different sources typically use inconsistent data representations, codes and formats which have to be reconciled Data Mining: Tech. and Appl. 13 Outline 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 2007-4-1 Data Mining: Tech. and Appl. 14 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 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. 2007-4-1 Data Mining: Tech. and Appl. 15 Cube: A Lattice of Cuboids all time time,item item time,location 0-D(apex) cuboid location supplier item,location time,supplier time,item,location 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 2007-4-1 Data Mining: Tech. and Appl. 16 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 2007-4-1 Data Mining: Tech. and Appl. 17 Example of Star Schema time item time_key day day_of_the_week month quarter year Sales Fact Table time_key item_key item_key item_name brand type supplier_type branch_key location branch location_key branch_key branch_name branch_type units_sold dollars_sold avg_sales location_key street city state_or_province country Measures 2007-4-1 Data Mining: Tech. and Appl. 18 Example of Snowflake Schema 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_key supplier supplier_key supplier_type branch_key location branch location_key branch_key branch_name branch_type units_sold dollars_sold avg_sales Measures 2007-4-1 Data Mining: Tech. and Appl. location_key street city_key city city_key city state_or_province country 19 Example of Fact Constellation time time_key day day_of_the_week month quarter year item Sales Fact Table time_key item_key item_name brand type supplier_type item_key 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_state country dollars_cost Measures 2007-4-1 time_key from_location branch_key branch Shipping Fact Table Data Mining: Tech. and Appl. units_shipped shipper shipper_key shipper_name location_key shipper_type 20 A Data Mining Query Language: DMQL 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> 2007-4-1 Data Mining: Tech. and Appl. 21 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) 2007-4-1 Data Mining: Tech. and Appl. 22 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)) 2007-4-1 Data Mining: Tech. and Appl. 23 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 2007-4-1 Data Mining: Tech. and Appl. 24 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. E.g., median(), mode()=mostfrequent(), rank(). 2007-4-1 Data Mining: Tech. and Appl. 25 A Concept Hierarchy: Dimension (location) all all Europe region country city office 2007-4-1 Germany Frankfurt ... ... ... Spain North_America Canada Vancouver ... L. Chan ... Data Mining: Tech. and Appl. ... Mexico Toronto M. Wind 26 View of Warehouses and Hierarchies Specification of hierarchies Schema hierarchy day < {month < quarter; week} < year Set_grouping hierarchy {1..10} < inexpensive 2007-4-1 Data Mining: Tech. and Appl. 27 Multidimensional Data Sales volume as a function of product, month, and region Re gi on Dimensions: Product, Location, Time Hierarchical summarization paths Industry Region Year Product Category Country Quarter Product City Office Month Week Day Month 2007-4-1 Data Mining: Tech. and Appl. 28 TV PC VCR sum 1Qtr 2Qtr Date 3Qtr 4Qtr sum Total annual sales of TV in U.S.A. U.S.A Canada Mexico Country Pr od uc t A Sample Data Cube sum 2007-4-1 Data Mining: Tech. and Appl. 29 Cuboids Corresponding to the Cube all product product,date date 0-D(apex) cuboid country product,country 1-D cuboids date, country 2-D cuboids product, date, country 2007-4-1 Data Mining: Tech. and Appl. 3-D(base) cuboid 30 Browsing a Data Cube Visualization OLAP capabilities Interactive manipulation 2007-4-1 Data Mining: Tech. and Appl. 31 Typical OLAP Operations Roll up (drill-up): summarize data by climbing up hierarchy or by dimension reduction Drill down (roll down): reverse of roll-up 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. 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) 2007-4-1 Data Mining: Tech. and Appl. 32 A Star-Net Query Model Customer Orders Shipping Method Customer CONTRACTS AIR-EXPRESS ORDER TRUCK PRODUCT LINE Time Product ANNUALY QTRLY DAILY PRODUCT ITEM PRODUCT GROUP CITY SALES PERSON COUNTRY DISTRICT REGION Location 2007-4-1 Each circle is called a footprint DIVISION Promotion Data Mining: Tech. and Appl. Organization 33 Outline 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 2007-4-1 Data Mining: Tech. and Appl. 34 What Can DW Provide for Business? Present relevant information to measure performance and make adjustments Quickly and efficiently gather information of an organization Facilitate customer relationship management by providing a consistent view of customers and products across all markets, departments and lines of business Bring cost reduction by tracking trends, patterns and exceptions over long time periods of time 2007-4-1 Data Mining: Tech. and Appl. 35 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 Choose the dimensions that will apply to each fact table record Choose the measure that will populate each fact table record 2007-4-1 Data Mining: Tech. and Appl. 36 Design of a Data Warehouse: A Business Analysis Framework Four views regarding the design of a data warehouse Top-down view (global view) allows selection of the relevant information necessary for the data warehouse Data source view (local view) exposes the information being captured, stored, and managed by operational systems Data warehouse view (middle view) consists of fact tables and dimension tables Business query view (end-user view) sees the perspective of data in the warehouse from the view of end-user 2007-4-1 Data Mining: Tech. and Appl. 37 Skills for Data Warehouse Building Business skills Understanding how systems store/manage their data; how to transfer data from data sources to data warehouse, etc. Technology skills Discovery trends and patterns; support decision making Program management skills Interface with many technologies, vendors, and end users to deliver results timely 2007-4-1 Data Mining: Tech. and Appl. 38 Multi-Tiered Architecture other Metadata sources Operational DBs Extract Transform Load Refresh Monitor & Integrator Data Warehouse OLAP Server Serve Analysis Query Reports Data mining Data Marts Data Sources 2007-4-1 Data Storage OLAP Engine Front-End Tools Data Mining: Tech. and Appl. 39 ETL Process 2007-4-1 Data Mining: Tech. and Appl. 40 Three Data Warehouse Models From the architecture point of view, three DW modes exist 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 2007-4-1 Data Mining: Tech. and Appl. 41 DW Models and Development Process Enterprise warehouse: top down development A systematic solution: minimizing integration problem, but expensive and time-consuming Data mart: bottom up development Flexibility, low cost, and rapid return of investment; integration is difficult Incremental and evolutional development of data warehouse: a recommended approach 2007-4-1 Data Mining: Tech. and Appl. 42 Data Warehouse Development: A Recommended Approach Multi-Tier Data Warehouse Distributed Data Marts Data Mart Data Mart Model refinement Enterprise Data Warehouse Model refinement Define a high-level corporate data model 2007-4-1 Data Mining: Tech. and Appl. 43 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 than MOLAP Multidimensional OLAP (MOLAP) Array-based multidimensional storage engine (sparse matrix techniques) fast indexing to pre-computed summarized data Usually, a two-level storage is used to handle dense and sparse data: dense->array structure; sparse-> compress technology Hybrid OLAP (HOLAP): Combing the merits of ROLAP and MOLAP User flexibility, e.g., low level: relational, high-level: array Specialized SQL servers specialized support for SQL queries over star/snowflake schemas 2007-4-1 Data Mining: Tech. and Appl. 44 Outline 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 2007-4-1 Data Mining: Tech. and Appl. 45 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 in an n-dimensional cube with L levels? n T = ∏ ( Li + 1) i =1 Materialization of data cube Materialize every (cuboid) (full materialization), none (no materialization), or some (partial materialization) Selection of which cuboids to materialize Based on size, sharing, access frequency, etc. 2007-4-1 Data Mining: Tech. and Appl. 46 Cube Operation Cube definition and computation in DMQL define cube sales[item, sum(sales_in_dollars) city, year]: 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) (city) FROM SALES CUBE BY item, city, year Need compute the following Group-Bys (city, item) (item) (city, year) (date, product, customer), (date,product),(date, customer), (product, customer), (date), (product), (customer) (city, item, year) () 2007-4-1 Data Mining: Tech. and Appl. (year) (item, year) 47 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 (Beyer & Ramarkrishnan’99) H-cubing technique (Han, Pei, Dong & Wang:SIGMOD’01) 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 sub-aggregates as a “partial grouping step” Aggregates may be computed from previously computed aggregates, rather than from the base fact table 2007-4-1 Data Mining: Tech. and Appl. 48 Cube Computation: ROLAP-Based Method (2) This is not in the textbook but in a research paper Hash/sort based methods (Agarwal et. al. VLDB’96) Smallest-parent: computing a cuboid from the smallest, previously computed cuboid Cache-results: caching results of a cuboid from which other cuboids are computed to reduce disk I/Os Amortize-scans: computing as many as possible cuboids at the same time to amortize disk reads Share-sorts: sharing sorting costs cross multiple cuboids when sort-based method is used Share-partitions: sharing the partitioning cost across multiple cuboids when hash-based algorithms are used 2007-4-1 Data Mining: Tech. and Appl. 49 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 memory access and storage cost. C c3 61 62 63 64 c2 45 46 47 48 c1 29 30 31 32 c0 B b3 B13 b2 9 b1 5 b0 2007-4-1 14 15 16 1 2 3 4 a0 a1 a2 a3 A 60 44 28 56 40 24 52 36 20 What is the best traversing order to do multi-way aggregation? Data Mining: Tech. and Appl. 50 Multi-way Array Aggregation for Cube Computation C c3 61 62 63 64 c2 45 46 47 48 c1 29 30 31 32 c0 b3 B b2 B13 14 15 60 16 44 28 9 24 b1 5 b0 1 2 3 4 a0 a1 a2 a3 56 40 36 52 20 A 2007-4-1 Data Mining: Tech. and Appl. 51 Multi-way Array Aggregation for Cube Computation C c3 61 62 63 64 c2 45 46 47 48 c1 29 30 31 32 c0 b3 B b2 B13 14 15 60 16 44 28 9 24 b1 5 b0 1 2 3 4 a0 a1 a2 a3 56 40 36 52 20 A 2007-4-1 Data Mining: Tech. and Appl. 52 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 2007-4-1 Data Mining: Tech. and Appl. 53 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 2007-4-1 Region Asia Europe Asia America Europe Index on Region Index on Type Type RecID Asia Europe Am erica 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 Data Mining: Tech. and Appl. 54 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 star 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 2007-4-1 Data Mining: Tech. and Appl. 55 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 2007-4-1 Data Mining: Tech. and Appl. 56 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 business terms and definitions, ownership of data, charging policies 2007-4-1 Data Mining: Tech. and Appl. 57 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 2007-4-1 Data Mining: Tech. and Appl. 58 Outline 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 2007-4-1 Data Mining: Tech. and Appl. 59 Iceberg Cube Computing only the cuboid cells whose count or other aggregates satisfying the condition: HAVING COUNT(*) >= minsup Motivation Only a small portion of cube cells may be “above the water’’ in a sparse cube Only calculate “interesting” data—data above certain threshold Suppose 100 dimensions, only 1 base cell. How many aggregate (non-base) cells if count >= 1? What about count >= 2? 2007-4-1 Data Mining: Tech. and Appl. 60 Bottom-Up Computation (BUC) BUC (Beyer & Ramakrishnan, SIGMOD’99) Bottom-up vs. top-down?— depending on how you view it! Apriori property: Aggregate the data, then move to the next level If minsup is not met, stop! If minsup = 1 Þ compute full CUBE! 2007-4-1 Data Mining: Tech. and Appl. 61 Partitioning Usually, entire data set can’t fit in main memory Sort distinct values, partition into blocks that fit Continue processing Optimizations Partitioning External Sorting, Hashing, Counting Sort Ordering dimensions to encourage pruning Cardinality, Skew, Correlation Collapsing duplicates Can’t do holistic aggregates anymore! 2007-4-1 Data Mining: Tech. and Appl. 62 Drawbacks of BUC Requires a significant amount of memory On par with most other CUBE algorithms though Does not obtain good performance with dense CUBEs Overly skewed data or a bad choice of dimension ordering reduces performance Cannot compute iceberg cubes with complex measures CREATE CUBE Sales_Iceberg AS SELECT month, city, cust_grp, AVG(price), COUNT(*) FROM Sales_Infor CUBEBY month, city, cust_grp HAVING AVG(price) >= 800 AND COUNT(*) >= 50 2007-4-1 Data Mining: Tech. and Appl. 63 Non-Anti-Monotonic Measures The cubing query with avg is non-anti-monotonic! (Mar, *, *, 600, 1800) fails the HAVING clause (Mar, *, Bus, 1300, 360) passes the clause Month City Cust_grp Prod Cost Price Jan Tor Edu Printer 500 485 Jan Tor Hld TV 800 1200 Jan Tor Edu Camera 1160 1280 Feb Mon Bus Laptop 1500 2500 Mar Van Edu HD 540 520 … … … … … … 2007-4-1 CREATE CUBE Sales_Iceberg AS SELECT month, city, cust_grp, AVG(price), COUNT(*) FROM Sales_Infor CUBEBY month, city, cust_grp HAVING AVG(price) >= 800 AND COUNT(*) >= 50 Data Mining: Tech. and Appl. 64 Top-k Average Let (*, Van, *) cover 1,000 records Avg(price) is the average price of those 1000 sales Avg50(price) is the average price of the top-50 sales (top-50 according to the sales price Top-k average is anti-monotonic The top 50 sales in Van. is with avg(price) <= 800 the top 50 deals in Van. during Feb. must be with avg(price) <= 800 2007-4-1 Month City Cust_grp Prod Cost Price … … … … … … Data Mining: Tech. and Appl. 65 Binning for Top-k Average Computing top-k avg is costly with large k Binning idea Avg50(c) >= 800 Large value collapsing: use a sum and a count to summarize records with measure >= 800 If count>=800, no need to check “small” records Small value binning: a group of bins One bin covers a range, e.g., 600~800, 400~600, etc. Register a sum and a count for each bin 2007-4-1 Data Mining: Tech. and Appl. 66 Approximate top-k average Suppose for (*, Van, *), we have Range Sum Count Over 800 2800 0 20 600~800 1060 0 15 400~600 1520 0 30 … … … 2007-4-1 Approximate avg50()= (28000+10600+600*15)/50=952 Top 50 The cell may pass the HAVING clause Month City Cust_grp Prod Cost Price … … … … … … Data Mining: Tech. and Appl. 67 Quant-info for Top-k Average Binning Accumulate quant-info for cells to compute average iceberg cubes efficiently Three pieces: sum, count, top-k bins Use top-k bins to estimate/prune descendants Use sum and count to consolidate current cell weakest 2007-4-1 strongest Approximate avg50() real avg50() avg() Anti-monotonic, can be computed efficiently Anti-monotonic, but computationally costly Not antimonotonic Data Mining: Tech. and Appl. 68 An Efficient Iceberg Cubing Method: Top-k H-Cubing One can revise Apriori or BUC to compute a top-k avg iceberg cube. This leads to top-k-Apriori and top-k BUC. Can we compute iceberg cube more efficiently? Top-k H-cubing: an efficient method to compute iceberg cubes with average measure H-tree: a hyper-tree structure H-cubing: computing iceberg cubes using H-tree 2007-4-1 Data Mining: Tech. and Appl. 69 H-tree: A Prefix Hyper-tree Header table Attr. Val. Edu Hhd Bus … Jan Feb … Tor Van Mon … Quant-Info Sum:2285 … … … … … … … … … … … Side-link root Jan Month City Cust_grp Prod Cost Price Jan Tor Edu Printer 500 485 Jan Tor Hhd TV 800 1200 Jan Tor Edu Camera 1160 1280 Feb Mon Bus Laptop 1500 2500 Mar Van Edu HD 540 520 … … … … … … 2007-4-1 bus hhd edu Mar Jan Feb Tor Van Tor Mon Quant-Info Q.I. Q.I. Q.I. Sum: 1765 Cnt: 2 bins Data Mining: Tech. and Appl. 70 Properties of H-tree Construction cost: a single database scan Completeness: It contains the complete information needed for computing the iceberg cube Compactness: # of nodes ☯ n*m+1 n: # of tuples in the table m: # of attributes 2007-4-1 Data Mining: Tech. and Appl. 71 Computing Cells Involving Dimension City Header Table HTor Attr. Val. Edu Hhd Bus … Jan Feb … Tor Van Mon … Attr. Val. Edu Hhd Bus … Jan Feb … Quant-Info Sum:2285 … … … … … … … … … … … Q.I. … … … … … … … Side-link From (*, *, Tor) to (*, Jan, Tor) root Hhd. Edu. Jan. Side-link Tor. Quant-Info Mar. Jan. Bus. Feb. Van. Tor. Mon. Q.I. Q.I. Q.I. Sum: 1765 Cnt: 2 bins 2007-4-1 Data Mining: Tech. and Appl. 72 Computing Cells Involving Month But No City 1. Roll up quant-info 2. Compute cells involving month but no city Attr. Val. Edu. Hhd. Bus. … Jan. Feb. Mar. … Tor. Van. Mont. … 2007-4-1 Quant-Info Sum:2285 … … … … … … … … … … … … root Hhd. Edu. Bus. Side-link Jan. Q.I. Tor. Mar. Jan. Q.I. Q.I. Van. Tor. Feb. Q.I. Mont. Top-k OK mark: if Q.I. in a child passes top-k avg threshold, so does its parents. No binning is needed! Data Mining: Tech. and Appl. 73 Computing Cells Involving Only Cust_grp Check header table directly root hhd edu Attr. Val. Edu Hhd Bus … Jan Feb Mar … Tor Van Mon … 2007-4-1 Quant-Info Sum:2285 … … … … … … … … … … … … bus Side-link Jan Mar Jan Feb Q.I. Q.I. Q.I. Q.I. Van Tor Tor Data Mining: Tech. and Appl. Mon 74 Properties of H-Cubing Space cost an H-tree a stack of up to (m-1) header tables One database scan Main memory-based tree traversal & sidelinks updates Top-k_OK marking 2007-4-1 Data Mining: Tech. and Appl. 75 Scalability w.r.t. Count Threshold (No min_avg Setting) Runtime (second) 300 top-k H-Cubing 250 top-k BUC 200 150 100 50 0 0.00% 0.05% 0.10% Count threshold 2007-4-1 Data Mining: Tech. and Appl. 76 Computing Iceberg Cubes with Other Complex Measures Computing other complex measures Key point: find a function which is weaker but ensures certain anti-monotonicity Examples Avg() ≤ v: avgk(c) ≤ v (bottom-k avg) Avg() ≥ v only (no count): max(price) ≥ v Sum(profit) (profit can be negative): p_sum(c) ≥ v if p_count(c) ≥ k; or otherwise, sumk(c) ≥ v Others: conjunctions of multiple conditions 2007-4-1 Data Mining: Tech. and Appl. 77 Discussion: Other Issues Computing iceberg cubes with more complex measures? No general answer for holistic measures, e.g., median, mode, rank A research theme even for complex algebraic functions, e.g., standard_dev, variance Dynamic vs . static computation of iceberg cubes v and k are only available at query time Setting reasonably low parameters for most nontrivial cases Memory-hog? what if the cubing is too big to fit in memory?—projection and then cubing 2007-4-1 Data Mining: Tech. and Appl. 78 Condensed Cube W. Wang, H. Lu, J. Feng, J. X. Yu, Condensed Cube: An Effective Approach to Reducing Data Cube Size. ICDE’02. Icerberg cube cannot solve all the problems Suppose 100 dimensions, only 1 base cell with count = 10. How many aggregate (non-base) cells if count >= 10? Condensed cube Only need to store one cell (a1, a2, …, a100, 10), which represents all the corresponding aggregate cells Adv. Fully precomputed cube without compression Efficient computation of the minimal condensed cube 2007-4-1 Data Mining: Tech. and Appl. 79 Outline 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 2007-4-1 Data Mining: Tech. and Appl. 80 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 visualization tools. Differences among the three tasks 2007-4-1 Data Mining: Tech. and Appl. 81 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 infrastructure 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 2007-4-1 Data Mining: Tech. and Appl. 82 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 MDDB Meta Data Filtering&Integration Database API Filtering Layer1 Data cleaning Databases 2007-4-1 Data Data integration Warehouse Data Mining: Tech. and Appl. Data Repository 83 Discovery-Driven Exploration of Data Cubes Hypothesis-driven exploration by user, huge search space Discovery-driven (Sarawagi, et al.’98) Effective navigation of large OLAP data cubes 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 2007-4-1 Data Mining: Tech. and Appl. 84 Kinds of Exceptions and their Computation Parameters SelfExp: surprise of cell relative to other cells at same level of aggregation InExp: surprise beneath the cell PathExp: surprise beneath cell for each drill-down path Computation of exception indicator (modeling fitting and computing SelfExp, InExp, and PathExp values) can be overlapped with cube construction Exception themselves can be stored, indexed and retrieved like precomputed aggregates 2007-4-1 Data Mining: Tech. and Appl. 85 Examples: Discovery-Driven Data Cubes 2007-4-1 Data Mining: Tech. and Appl. 86 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 live, and find the fraction of the total sales due to tuple that have min shelf life within the set of all max price tuples 2007-4-1 Data Mining: Tech. and Appl. 87 Cube-Gradient (Cubegrade) Analysis of changes of sophisticated measures in multi-dimensional spaces Query: changes of average house price in Vancouver in ‘00 comparing against ’99 Answer: Apts in West went down 20%, houses in Metrotown went up 10% Cubegrade problem by Imielinski et al. Changes in dimensions changes in measures Drill-down, roll-up, and mutation 2007-4-1 Data Mining: Tech. and Appl. 88 From Cubegrade to Multi-dimensional Constrained Gradients in Data Cubes Significantly more expressive than association rules Capture trends in user-specified measures Serious challenges Many trivial cells in a cube “significance constraint” to prune trivial cells Numerate pairs of cells “probe constraint” to select a subset of cells to examine Only interesting changes wanted “gradient constraint” to capture significant changes 2007-4-1 Data Mining: Tech. and Appl. 89 MD Constrained Gradient Mining Significance constraint Csig: (cnt≥100) Probe constraint Cprb: (city=“Van”, cust_grp=“busi”, prod_grp=“*”) Gradient constraint Cgrad(cg, cp): (avg_price(cg)/avg_price(cp)≥1.3) Probe cell: satisfied Cprb Base cell Aggregated cell Siblings Ancestor 2007-4-1 (c4, c2) satisfies Cgrad! Dimensions Measures cid Yr City Cst_grp Prd_grp Cnt Avg_price c1 00 Van Busi PC 300 2100 c2 * Van Busi PC 2800 1800 c3 * Tor Busi PC 7900 2350 c4 * * busi PC 58600 2250 Data Mining: Tech. and Appl. 90 A LiveSet-Driven Algorithm Compute probe cells using Csig and Cprb The set of probe cells P is often very small Use probe P and constraints to find gradients Pushing selection deeply Set-oriented processing for probe cells Iceberg growing from low to high dimensionalities Dynamic pruning probe cells during growth Incorporating efficient iceberg cubing method 2007-4-1 Data Mining: Tech. and Appl. 91 Summary Data warehouse concepts A multi-dimensional model of a data warehouse Star schema, snowflake schema, fact constellations A data cube consists of dimensions & measures OLAP operations: drilling, rolling, slicing, dicing and pivoting OLAP servers: ROLAP, MOLAP, HOLAP Efficient computation of data cubes Partial vs. full vs. no materialization Multiway array aggregation Bitmap index and join index implementations Further development of data cube technology Discovery-drive and multi-feature cubes From OLAP to OLAM (on-line analytical mining) 2007-4-1 Data Mining: Tech. and Appl. 92 References (I) S. Agarwal, R. Agrawal, P. M. Deshpande, A. Gupta, J. F. Naughton, R. Ramakrishnan, and S. Sarawagi. On the computation of multidimensional aggregates. VLDB’96 D. Agrawal, A. E. Abbadi, A. Singh, and T. Yurek. Efficient view maintenance in data warehouses. SIGMOD’97. R. Agrawal, A. Gupta, and S. Sarawagi. Modeling multidimensional databases. ICDE’97 K. Beyer and R. Ramakrishnan. Bottom-Up Computation of Sparse and Iceberg CUBEs.. SIGMOD’99. S. Chaudhuri and U. Dayal. An overview of data warehousing and OLAP technology. ACM SIGMOD Record, 26:65-74, 1997. OLAP council. MDAPI specification version 2.0. In http://www.olapcouncil.org/research/apily.htm, 1998. G. Dong, J. Han, J. Lam, J. Pei, K. Wang. Mining Multi-dimensional Constrained Gradients in Data Cubes. VLDB’2001 J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab and sub-totals. Data Mining and Knowledge Discovery, 1:29-54, 1997. 2007-4-1 Data Mining: Tech. and Appl. 93 References (II) J. Han, J. Pei, G. Dong, K. Wang. Efficient Computation of Iceberg Cubes With Complex Measures. SIGMOD’01 V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. SIGMOD’96 Microsoft. OLEDB for OLAP programmer's reference version 1.0. In http://www.microsoft.com/data/oledb/olap, 1998. K. Ross and D. Srivastava. Fast computation of sparse datacubes. VLDB’97. K. A. Ross, D. Srivastava, and D. Chatziantoniou. Complex aggregation at multiple granularities. EDBT'98. S. Sarawagi, R. Agrawal, and N. Megiddo. Discovery-driven exploration of OLAP data cubes. EDBT'98. E. Thomsen. OLAP Solutions: Building Multidimensional Information Systems. John Wiley & Sons, 1997. W. Wang, H. Lu, J. Feng, J. X. Yu, Condensed Cube: An Effective Approach to Reducing Data Cube Size. ICDE’02. Y. Zhao, P. M. Deshpande, and J. F. Naughton. An array-based algorithm for simultaneous multidimensional aggregates. SIGMOD’97. 2007-4-1 Data Mining: Tech. and Appl. 94 Homework Read Chapter 2 Finish exercise 2.5 2007-4-1 Data Mining: Tech. and Appl. 95