Data Warehousing and OLAP Technology An Overview n

Data Warehousing and OLAP Technology: An Overview n What is a data warehouse? n A multi-dimensional data model n Data warehouse architecture n Data warehouse implementation n From data warehousing to data mining

What is Data Warehouse? n Defined in many different ways, but not rigorously. n A decision support database that is maintained separately from the organization’s operational database n Support information processing by providing a solid platform of consolidated, historical data for analysis. n “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 n Data warehousing: n The process of constructing and using data warehouses

Data Warehouse—Subject-Oriented n Organized around major subjects, such as customer, product, sales n Focusing on the modeling and analysis of data for decision makers, not on daily operations or transaction processing n Provide a simple and concise view around particular subject issues by excluding data that are not useful in the decision support process

Data Warehouse—Integrated n n Constructed by integrating multiple, heterogeneous data sources n relational databases, flat files, on-line transaction records Data cleaning and data integration techniques are applied. n Ensure consistency in naming conventions, encoding structures, attribute measures, etc. among different data sources n n E. g. , Hotel price: currency, tax, breakfast covered, etc. When data is moved to the warehouse, it is converted.

Data Warehouse—Time Variant n The time horizon for the data warehouse is significantly longer than that of operational systems n n n 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 n n Contains an element of time, explicitly or implicitly But the key of operational data may or may not contain “time element”

Data Warehouse—Nonvolatile n A physically separate store of data transformed from the operational environment n Operational update of data does not occur in the data warehouse environment n Does not require transaction processing, recovery, and concurrency control mechanisms n Requires only two operations in data accessing: n initial loading of data and access of data

Data Warehouse vs. Heterogeneous DBMS n Traditional heterogeneous DB integration: A query driven approach n Build wrappers/mediators on top of heterogeneous databases n 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 n n Complex information filtering, compete for resources Data warehouse: update-driven, high performance n Information from heterogeneous sources is integrated in advance and stored in warehouses for direct query and analysis

Data Warehouse vs. Operational DBMS n OLTP (on-line transaction processing) n n Major task of traditional relational DBMS Day-to-day operations: purchasing, inventory, banking, manufacturing, payroll, registration, accounting, etc. OLAP (on-line analytical processing) n Major task of data warehouse system n Data analysis and decision making Distinct features (OLTP vs. OLAP): n User and system orientation: customer vs. market n Data contents: current, detailed vs. historical, consolidated n Database design: ER + application vs. star + subject n View: current, local vs. evolutionary, integrated n Access patterns: update vs. read-only but complex queries

OLTP vs. OLAP

Why Separate Data Warehouse? n High performance for both systems n n n Warehouse—tuned for OLAP: complex OLAP queries, multidimensional view, consolidation Different functions and different data: n n DBMS— tuned for OLTP: access methods, indexing, concurrency control, recovery missing data: Decision support requires historical data which operational DBs do not typically maintain data consolidation: DS requires consolidation (aggregation, summarization) of data from heterogeneous sources data quality: different sources typically use inconsistent data representations, codes and formats which have to be reconciled Note: There are more and more systems which perform OLAP analysis directly on relational databases

Chapter 3: Data Warehousing and OLAP Technology: An Overview n What is a data warehouse? n A multi-dimensional data model n Data warehouse architecture n Data warehouse implementation n From data warehousing to data mining

From Tables and Spreadsheets to Data Cubes n A data warehouse is based on a multidimensional data model which views data in the form of a data cube n A data cube, such as sales, allows data to be modeled and viewed in multiple dimensions n Dimension tables, such as item (item_name, brand, type), or time(day, week, month, quarter, year) n Fact table contains measures (such as dollars_sold) and keys to each of the related dimension tables n 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.

Cube: A Lattice of Cuboids all time 0 -D(apex) cuboid item time, location time, item location item, location time, supplier location, supplier item, supplier time, location, supplier time, item, location time, item, supplier 1 -D cuboids 2 -D cuboids 3 -D cuboids item, location, supplier 4 -D(base) cuboid time, item, location, supplier

Conceptual Modeling of Data Warehouses n Modeling data warehouses: dimensions & measures n Star schema: A fact table in the middle connected to a set of dimension tables n 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 n Fact constellations: Multiple fact tables share dimension tables, viewed as a collection of stars, therefore called galaxy schema or fact constellation

Example of Star Schema time item time_key day_of_the_week month quarter year Sales Fact Table time_key item_key branch_key branch_name branch_type location_key units_sold dollars_sold avg_sales Measures item_key item_name brand type supplier_type location_key street city state_or_province country

Example of Snowflake Schema time_key day_of_the_week month quarter year item Sales Fact Table time_key item_key branch location_key branch_name branch_type units_sold dollars_sold avg_sales Measures item_key item_name brand type supplier_key supplier_type location_key street city_key city state_or_province country

Example of Fact Constellation time_key day_of_the_week month quarter year item Sales Fact Table time_key item_key item_name brand type supplier_type location_key branch_name branch_type units_sold dollars_sold avg_sales Measures time_key item_key shipper_key from_location branch_key branch Shipping Fact Table location to_location_key street city province_or_state country dollars_cost units_shipped shipper_key shipper_name location_key shipper_type

Cube Definition Syntax (BNF) in DMQL n n n 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) n First time as “cube definition” n define dimension <dimension_name> as <dimension_name_first_time> in cube <cube_name_first_time>

Defining 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_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)

Defining 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_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))

Defining 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_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

Measures of Data Cube: Three Categories n 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 n n 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 n n 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. n E. g. , median(), mode(), rank()

A Concept Hierarchy: Dimension (location) all Europe region country city office Germany Frankfurt . . Spain North_America Canada Vancouver. . . L. Chan . . . Mexico Toronto M. Wind

View of Warehouses and Hierarchies Specification of hierarchies n Schema hierarchy day < {month < quarter; week} < year n Set_grouping hierarchy {1. . 10} < inexpensive

Multidimensional Data Sales volume as a function of product, month, and region gi on Dimensions: Product, Location, Time Hierarchical summarization paths Re Industry Region Year Category Country Quarter Product n Product City Office Month Day Week

Pr od TV PC VCR sum 1 Qtr 2 Qtr Date 3 Qtr 4 Qtr sum Total annual sales of TV in U. S. A Canada Mexico sum Country uc t A Sample Data Cube

Cuboids Corresponding to the Cube all 0 -D(apex) cuboid product, date country product, country 1 -D cuboids date, country 2 -D cuboids product, date, country 3 -D(base) cuboid

Browsing a Data Cube n n n Visualization OLAP capabilities Interactive manipulation

Typical OLAP Operations n Roll up (drill-up): summarize data n by climbing up hierarchy or by dimension reduction n Drill down (roll down): reverse of roll-up n from higher level summary to lower level summary or detailed data, or introducing new dimensions Slice and dice: project and select n Pivot (rotate): n n n reorient the cube, visualization, 3 D to series of 2 D planes Other operations n n 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)

Fig. 3. 10 Typical OLAP Operations

A Star-Net Query Model Customer Orders Shipping Method Customer CONTRACTS AIR-EXPRESS ORDER TRUCK Time PRODUCT LINE ANNUALY QTRLY DAILY CITY Product PRODUCT ITEM PRODUCT GROUP SALES PERSON COUNTRY DISTRICT REGION Location Each circle is called a footprint DIVISION Promotion Organization

Chapter 3: Data Warehousing and OLAP Technology: An Overview n What is a data warehouse? n A multi-dimensional data model n Data warehouse architecture n Data warehouse implementation n From data warehousing to data mining

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

Data Warehouse Design Process n n Top-down, bottom-up approaches or a combination of both n Top-down: Starts with overall design and planning (mature) n Bottom-up: Starts with experiments and prototypes (rapid) From software engineering point of view n n n 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 n Choose a business process to model, e. g. , orders, invoices, etc. n Choose the grain (atomic level of data) of the business process n Choose the dimensions that will apply to each fact table record n Choose the measure that will populate each fact table record

Data Warehouse: A Multi-Tiered Architecture Other sources Operational DBs Metadata Extract Transform Load Refresh Monitor & Integrator Data Warehouse OLAP Server Serve Analysis Query Reports Data mining Data Marts Data Sources Data Storage OLAP Engine Front-End Tools

Three Data Warehouse Models n n Enterprise warehouse n collects all of the information about subjects spanning the entire organization Data Mart n 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 n n Independent vs. dependent (directly from warehouse) data mart Virtual warehouse n A set of views over operational databases n Only some of the possible summary views may be materialized

Data Warehouse Development: A Recommended Approach Multi-Tier Data Warehouse Distributed Data Marts Data Mart Model refinement Enterprise Data Warehouse Model refinement Define a high-level corporate data model

Data Warehouse Back-End Tools and Utilities n n n Data extraction n get data from multiple, heterogeneous, and external sources Data cleaning n detect errors in the data and rectify them when possible Data transformation n convert data from legacy or host format to warehouse format Load n sort, summarize, consolidate, compute views, check integrity, and build indicies and partitions Refresh n propagate the updates from the data sources to the warehouse

Metadata Repository n Meta data is the data defining warehouse objects. It stores: n Description of the structure of the data warehouse n n schema, view, dimensions, hierarchies, derived data defn, data mart locations and contents Operational meta-data n 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) n The algorithms used for summarization n The mapping from operational environment to the data warehouse n n Data related to system performance n warehouse schema, view and derived data definitions Business data n business terms and definitions, ownership of data, charging policies

OLAP Server Architectures n Relational OLAP (ROLAP) n n n Use relational or extended-relational DBMS to store and manage warehouse data and OLAP middle ware Include optimization of DBMS backend, implementation of aggregation navigation logic, and additional tools and services Greater scalability

Relational OLAP (ROLAP)

OLAP Server Architectures n Multidimensional OLAP (MOLAP) n Sparse array-based multidimensional storage engine n Fast indexing to pre-computed summarized data

Multidimensional OLAP (MOLAP)

OLAP Server Architectures n Hybrid OLAP (HOLAP) (e. g. , Microsoft SQLServer) n n Flexibility, e. g. , low level: relational, high-level: array Specialized SQL servers (e. g. , Redbricks) n Specialized support for SQL queries over star/snowflake schemas

Hybrid OLAP (HOLAP)

Chapter 3: Data Warehousing and OLAP Technology: An Overview n What is a data warehouse? n A multi-dimensional data model n Data warehouse architecture n Data warehouse implementation n From data warehousing to data mining

Efficient Data Cube Computation Efficient Computation of Data Cubes n At the core of multidimensional data analysis is the efficient computation of aggregations across many sets of dimensions. n In SQL terms, these aggregations are referred to as group-by’s. Each group-by can be represented by a cuboid, where the set of groupby’s forms a lattice of cuboids defining a data cube. The compute cube Operator and the Curse of Dimensionality n One approach to cube computation extends SQL so as to include a compute cube operator. n The compute cube operator computes aggregates over all subsets of the dimensions specified in the operation. n This can require excessive storage space, especially for large numbers of dimensions.

Efficient Data Cube Computation n Data cube can be viewed as a lattice of cuboids n The bottom-most cuboid is the base cuboid n The top-most cuboid (apex) contains only one cell n n How many cuboids in an n-dimensional cube with L levels? Materialization of data cube n n Materialize every (cuboid) (full materialization), none (no materialization), or some (partial materialization) Selection of which cuboids to materialize n Based on size, sharing, access frequency, etc.

Efficient Data Cube Computation n Data cube can be viewed as a lattice of cuboids n The bottom-most cuboid is the base cuboid n The top-most cuboid (apex) contains only one cell n n How many cuboids in an n-dimensional cube with L levels? Materialization of data cube n n Materialize every (cuboid) (full materialization), none (no materialization), or some (partial materialization) Selection of which cuboids to materialize n Based on size, sharing, access frequency, etc.

Efficient Data Cube Computation n (1) (2) (3) The partial materialization of cuboids or subcubes should consider three factors: identify the subset of cuboids or subcubes to materialize; Exploit the materialized cuboids or subcubes during query processing; and Efficiently update the materialized cuboids or subcubes during load and refresh.

Cube Operation n Cube definition and computation in DMQL define cube sales[item, city, year]: sum(sales_in_dollars) compute cube sales n 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 n CUBE BY item, city, year Need compute the following Group-Bys (city) (city, item) (city, year) (date, product, customer), (date, product), (date, customer), (product, customer), (city, item, year) (date), (product), (customer) () (year) (item, year)

Iceberg Cube n Computing only the cuboid cells whose count or other aggregates satisfying the condition like HAVING COUNT(*) >= minsup n Motivation n Only a small portion of cube cells may be “above the water’’ in a sparse cube n Only calculate “interesting” cells—data above certain threshold n Avoid explosive growth of the cube n Suppose 100 dimensions, only 1 base cell. How many aggregate cells if count >= 1? What about count >= 2?

Indexing OLAP Data n 1. 2. index OLAP data by Bitmap indexing and Join indexing

Bitmap Index n The bitmap indexing method is popular in OLAP products because it allows quick searching in data cubes. n The bitmap index is an alternative representation of the record ID (RID) list. In the bitmap index for a given attribute, there is a distinct bit vector, Bv, for each value v in the domain of the attribute. n If the domain of a given attribute consists of n values, then n bits are needed for each entry in the bitmap index (i. e. , there are n bit vectors). n If the attribute has the value v for a given row in the data table, then the bit representing that value is set to 1 in the corresponding row of the bitmap index. All other bits for that row are set to 0.

Indexing OLAP Data: Bitmap Index n n n 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

Indexing OLAP Data: Bitmap Index n Bitmap indexing is advantageous compared to hash and tree indices. n It is especially useful for low-cardinality domains because comparison, join, and aggregation operations are then reduced to bit arithmetic, which substantially reduces the processing time. n Bitmap indexing leads to significant reductions in space and I/O since a string of characters can be represented by a single bit. For highercardinality domains, the method can be adapted using compression techniques.

Join Indices n n n The join indexing method gained popularity from its use in relational database query processing. Traditional indexing maps the value in a given column to a list of rows having that value. In contrast, join indexing registers the joinable rows of two relations from a relational database. For example, if two relations R(RID, A) and S(B, SID) join on the attributes A and B, then the join index record contains the pair (RID, SID), where RID and SID are record identifiers from the R and S relations, respectively. Hence, the join index records can identify joinable tuples without performing costly join operations. Join indexing is especially useful for maintaining the relationship between a foreign key 3 and its matching primary keys, from the joinable relation.

Join Indices n The star schema model of data warehouses makes join indexing attractive for cross table search, because the linkage between a fact table and its corresponding dimension tables comprises the foreign key of the fact table and the primary key of the dimension table. n Join indexing maintains relationships between attribute values of a dimension (e. g. , within a dimension table) and the corresponding rows in the fact table. n Join indices may span multiple dimensions to form composite join indices. We can use join indices to identify sub cubes that are of interest.

Indexing OLAP Data: Join Indices n n n 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 n It materializes relational join in JI file and speeds up relational join In data warehouses, join index relates the values of the dimensions of a start schema to rows in the fact table. n E. g. fact table: Sales and two dimensions city and product n A join index on city maintains for each distinct city a list of R-IDs of the tuples recording the Sales in the city n Join indices can span multiple dimensions

Efficient Processing OLAP Queries Determine which operations should be performed on the available cuboids n 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 Let the query to be processed be on {brand, province_or_state} with the condition “year = 2004”, and there are 4 materialized cuboids available: 1) {year, item_name, city} 2) {year, brand, country} 3) {year, brand, province_or_state} 4) {item_name, province_or_state} where year = 2004 Which should be selected to process the query? n Explore indexing structures and compressed vs. dense array structs in MOLAP

n OLAP query processing. Suppose that we define a data cube for All Electronics of the form “sales cube [time, item, location]: sum(sales in dollars)”. The dimension hierarchies used are “day < month < quarter < year” for time, “item name < brand < type” for item, and “street < city < province or state < country” for location. n Suppose that the query to be processed is on {brand, province or state}, with the n selection constant “year = 2004”. Also, suppose that there are four materialized cuboids available, as follows: n cuboid 1: {year, item name, city} n cuboid 2: {year, brand, country} n cuboid 3: {year, brand, province or state} n cuboid 4: {item name, province or state} where year = 2004

n “Which of the above four cuboids should be selected to process the query? ” Finer granularity data cannot be generated from coarser-granularity data. Therefore, cuboid 2 cannot be used because country is a more general concept than province or state. n Cuboids 1, 3, and 4 can be used to process the query because (1) they have the same set or a superset of the dimensions in the query, (2) the selection clause in the query can imply the selection in the cuboid, and (3) the abstraction levels for the item and location dimensions in these cuboids are at a finer level than brand province or state, respectively.

Ø “How would the costs of each cuboid compare if used to process the query? ” Ø It is likely that using cuboid 1 would cost the most because both item name and city are at a lower level than the brand province or state concepts specified in the query. Ø If there are not many year values associated with items in the cube, but there are several item names for each brand, then cuboid 3 will be smaller than cuboid 4, and thus cuboid 3 should be chosen to process the query. Ø However, if efficient indices are available for cuboid 4, then cuboid 4 may be a better choice. Therefore, some cost-based estimation is required in order to decide which set of cuboids should be selected for query processing.

n Because the storage model of a MOLAP server is an n-dimensional array, the frontend multidimensional queries are mapped directly to server storage structures, which provide direct addressing capabilities. n The straightforward array representation of the data cube has good indexing properties, but has poor storage utilization when the data are sparse. For efficient storage and processing, sparse matrix and data compression techniques should therefore be applied. n n The storage structures used by dense and sparse arrays may differ, making it advantageous to adopt a two-level approach to MOLAP query processing: use array structures for dense arrays, and sparse matrix structures for sparse arrays. The twodimensional dense arrays can be indexed by B-trees. To process a query in MOLAP, the dense one- and two-dimensional arrays must first be identified. Indices are then built to these arrays using traditional indexing structures. The two-level approach increases storage utilization without sacrificing direct addressing capabilities.

n Because the storage model of a MOLAP server is an n-dimensional array, the frontend multidimensional queries are mapped directly to server storage structures, which provide direct addressing capabilities. n The straightforward array representation of the data cube has good indexing properties, but has poor storage utilization when the data are sparse. For efficient storage and processing, sparse matrix and data compression techniques should therefore be applied. n n The storage structures used by dense and sparse arrays may differ, making it advantageous to adopt a two-level approach to MOLAP query processing: use array structures for dense arrays, and sparse matrix structures for sparse arrays. The twodimensional dense arrays can be indexed by B-trees. To process a query in MOLAP, the dense one- and two-dimensional arrays must first be identified. Indices are then built to these arrays using traditional indexing structures. The two-level approach increases storage utilization without sacrificing direct addressing capabilities.

Chapter 3: Data Warehousing and OLAP Technology: An Overview n What is a data warehouse? n A multi-dimensional data model n Data warehouse architecture n Data warehouse implementation n From data warehousing to data mining

Data Warehouse Usage n Three kinds of data warehouse applications n Information processing n n n supports querying, basic statistical analysis, and reporting using crosstabs, tables, charts and graphs Analytical processing n multidimensional analysis of data warehouse data n supports basic OLAP operations, slice-dice, drilling, pivoting Data mining n n knowledge discovery from hidden patterns supports associations, constructing analytical models, performing classification and prediction, and presenting the mining results using visualization tools

From On-Line Analytical Processing (OLAP) to On Line Analytical Mining (OLAM) n Why online analytical mining? n High quality of data in data warehouses n DW contains integrated, consistent, cleaned data n Available information processing structure surrounding data warehouses n ODBC, OLEDB, Web accessing, service facilities, reporting and OLAP tools n OLAP-based exploratory data analysis n Mining with drilling, dicing, pivoting, etc. n On-line selection of data mining functions n Integration and swapping of multiple mining functions, algorithms, and tasks

An OLAM System Architecture Mining query Mining result Layer 4 User Interface User GUI API OLAM Engine OLAP Engine Layer 3 OLAP/OLAM Data Cube API Layer 2 MDDB Meta Data Filtering&Integration Database API Filtering Layer 1 Databases Data cleaning Data integration Warehouse Data Repository

Chapter 3: Data Warehousing and OLAP Technology: An Overview n What is a data warehouse? n A multi-dimensional data model n Data warehouse architecture n Data warehouse implementation n From data warehousing to data mining n Summary

Summary: Data Warehouse and OLAP Technology n Why data warehousing? n A multi-dimensional model of a data warehouse n Star schema, snowflake schema, fact constellations n A data cube consists of dimensions & measures n OLAP operations: drilling, rolling, slicing, dicing and pivoting n Data warehouse architecture n OLAP servers: ROLAP, MOLAP, HOLAP n Efficient computation of data cubes n n Partial vs. full vs. no materialization n Indexing OALP data: Bitmap index and join index n OLAP query processing From OLAP to OLAM (on-line analytical mining)

References (I) n n n n n 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 S. Chaudhuri and U. Dayal. An overview of data warehousing and OLAP technology. ACM SIGMOD Record, 26: 65 -74, 1997 E. F. Codd, S. B. Codd, and C. T. Salley. Beyond decision support. Computer World, 27, July 1993. J. Gray, et al. Data cube: A relational aggregation operator generalizing group-by, cross -tab and sub-totals. Data Mining and Knowledge Discovery, 1: 29 -54, 1997. A. Gupta and I. S. Mumick. Materialized Views: Techniques, Implementations, and Applications. MIT Press, 1999. J. Han. Towards on-line analytical mining in large databases. ACM SIGMOD Record, 27: 97 -107, 1998. V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. SIGMOD’ 96

References (II) n n n n n C. Imhoff, N. Galemmo, and J. G. Geiger. Mastering Data Warehouse Design: Relational and Dimensional Techniques. John Wiley, 2003 W. H. Inmon. Building the Data Warehouse. John Wiley, 1996 R. Kimball and M. Ross. The Data Warehouse Toolkit: The Complete Guide to Dimensional Modeling. 2 ed. John Wiley, 2002 P. O'Neil and D. Quass. Improved query performance with variant indexes. SIGMOD'97 Microsoft. OLEDB for OLAP programmer's reference version 1. 0. In http: //www. microsoft. com/data/oledb/olap, 1998 A. Shoshani. OLAP and statistical databases: Similarities and differences. PODS’ 00. S. Sarawagi and M. Stonebraker. Efficient organization of large multidimensional arrays. ICDE'94 OLAP council. MDAPI specification version 2. 0. In http: //www. olapcouncil. org/research/apily. htm, 1998 E. Thomsen. OLAP Solutions: Building Multidimensional Information Systems. John Wiley, 1997 n P. Valduriez. Join indices. ACM Trans. Database Systems, 12: 218 -246, 1987. n J. Widom. Research problems in data warehousing. CIKM’ 95.