1 Exercise Sheet 3 Exercise 7.: ROLAP Algebra Assume that a fact table SalesCube has 3 hierarchies with attributes  ear , Month M, Productgroup P and.

Slides:

Advertisements

Similar presentations

Chapter 13: Query Processing

Advertisements

Vorlesung Datawarehousing Table of Contents Prof. Rudolf Bayer, Ph.D. Institut für Informatik, TUM SS 2002.

1. Find the cost of each of the following using the Nearest Neighbor Algorithm. a)Start at Vertex M.

An Array-Based Algorithm for Simultaneous Multidimensional Aggregates By Yihong Zhao, Prasad M. Desphande and Jeffrey F. Naughton Presented by Kia Hall.

Computational Learning An intuitive approach. Human Learning Objects in world –Learning by exploration and who knows? Language –informal training, inputs.

Digital Circuits.

Cluster Analysis: Basic Concepts and Algorithms

Hierarchical Clustering, DBSCAN The EM Algorithm

OLAP Tuning. Outline OLAP 101 – Data warehouse architecture – ROLAP, MOLAP and HOLAP Data Cube – Star Schema and operations – The CUBE operator – Tuning.

Networks Prim’s Algorithm

Copyright © 2004 Pearson Education, Inc.. Chapter 15 Algorithms for Query Processing and Optimization.

Databases and Information Systems 1 Prof. Dr. Stefan Böttcher Fakultät EIM, Institut für Informatik Universität Paderborn WS 2009 / 2010 Contents: selectivity.

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.

Outline What is a data warehouse? A multi-dimensional data model Data warehouse architecture Data warehouse implementation Further development of data.

Data Mining Cluster Analysis: Basic Concepts and Algorithms

Chapter 4 The Greedy Approach. Minimum Spanning Tree A tree is an acyclic, connected, undirected graph. A spanning tree for a given graph G=, where E.

Indian Statistical Institute Kolkata

Query Evaluation. An SQL query and its RA equiv. Employees (sin INT, ename VARCHAR(20), rating INT, age REAL) Maintenances (sin INT, planeId INT, day.

Query Evaluation. SQL to ERA SQL queries are translated into extended relational algebra. Query evaluation plans are represented as trees of relational.

Medical Imaging Mohammad Dawood Department of Computer Science University of Münster Germany.

Medical Imaging Mohammad Dawood Department of Computer Science University of Münster Germany.

Unsupervised Learning: Clustering Rong Jin Outline  Unsupervised learning  K means for clustering  Expectation Maximization algorithm for clustering.

Cluster analysis. Partition Methods Divide data into disjoint clusters Hierarchical Methods Build a hierarchy of the observations and deduce the clusters.

4. Ad-hoc I: Hierarchical clustering

Bayesian Networks Clique tree algorithm Presented by Sergey Vichik.

Cluster Analysis: Basic Concepts and Algorithms

K-means Clustering. What is clustering? Why would we want to cluster? How would you determine clusters? How can you do this efficiently?

Using a straightedge, draw any triangle ABC a)Label the intersection of the perpendicular bisectors as the circumcenter. b)Measure & label the distance.

Introduction to Management Science

Ch 5 Practical Point Pattern Analysis Spatial Stats & Data Analysis by Magdaléna Dohnalová.

7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.

1 Revision and Exam Briefing M. Akhtar Ali School of CEIS.

Chapter 13 Genetic Algorithms. 2 Data Mining Techniques So Far… Chapter 5 – Statistics Chapter 6 – Decision Trees Chapter 7 – Neural Networks Chapter.

CS609 Introduction. Databases Current state? Future?

Query Optimization (CB Chapter ) CPSC 356 Database Ellen Walker Hiram College (Includes figures from Database Systems: An Application Oriented.

Clustering Methods K- means. K-means Algorithm Assume that K=3 and initially the points are assigned to clusters as follows. C 1 ={x 1,x 2,x 3 }, C 2.

CSCI 115 Chapter 7 Trees. CSCI 115 §7.1 Trees §7.1 – Trees TREE –Let T be a relation on a set A. T is a tree if there exists a vertex v 0 in A s.t. there.

Fundamental Data Structures and Algorithms (Spring ’05) Recitation Notes: Graphs Slides prepared by Uri Dekel, Based on recitation.

CS654: Digital Image Analysis

1 Exercise Sheet 3 Exercise 7.: ROLAP Algebra Assume that a fact table SalesCube has 3 hierarchies with attributes  ear , Month M, Productgroup P and.

© 1999 FORWISS General Research Report Implementation and Optimization Issues of the ROLAP Algebra F. Ramsak, M.S. (UIUC) Dr. V. Markl Prof. R. Bayer,

Prepared by: Mahmoud Rafeek Al-Farra

Clustering Instructor: Max Welling ICS 178 Machine Learning & Data Mining.

Definition Finding groups of objects such that the objects in a group will be similar (or related) to one another and different from (or unrelated to)

CSCI Query Processing1 QUERY PROCESSING & OPTIMIZATION Dr. Awad Khalil Computer Science Department AUC.

Substituting into expressions.

Data Mining By Farzana Forhad CS 157B. Agenda Decision Tree and ID3 Rough Set Theory Clustering.

Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!

Clustering Approaches Ka-Lok Ng Department of Bioinformatics Asia University.

Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.

Data Mining Cluster Analysis: Basic Concepts and Algorithms Lecture Notes Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach, Kumar Introduction.

CHAPTER 1 SECTION 5.

Data Mining: Basic Cluster Analysis

Data Transformation: Normalization

Query Optimization Heuristic Optimization

Semi-Supervised Clustering

CSE 4705 Artificial Intelligence

Prepared by : Ankit Patel (226)

Lecture 13 review Explain how distance vector algorithm works.

Overview of Query Optimization

Chapter 15 QUERY EXECUTION.

Query Processing B.Ramamurthy Chapter 12 11/27/2018 B.Ramamurthy.

CSE572, CBS598: Data Mining by H. Liu

GPX: Interactive Exploration of Time-series Microarray Data

CSE572, CBS572: Data Mining by H. Liu

Networks Prim’s Algorithm

Clustering The process of grouping samples so that the samples are similar within each group.

CSE572: Data Mining by H. Liu

Analysis of engineering system by means of graph representation

Presentation transcript:

1 Exercise Sheet 3 Exercise 7.: ROLAP Algebra Assume that a fact table SalesCube has 3 hierarchies with attributes  ear , Month M, Productgroup P and City C and the measure sales. Assume that the attributes have the following cardinalities:  = 3 M = 12 P = 500 C = 80 Exercise 7.1: Draw the aggregation network

2 Exercise 7.2.: Construct the ROLAP expression to compute the average and maximal sales for the groups { ,P}, { , C} and {P} Exercise 7.3: Translate the ROLAP expression of Exercise 7.2 into a single SQL statement and estimate its cost = total number of tuples read + total number of tuples written if you assume that there is no optimization of this SQL statement. Exercise 7.4: Translate the SQL statement of Exercise 7.3 into several SQL statements employing auxiliary tables for intermediate results. Try to minimize the cost.

3 Exercise 8: Clustering Exercise 8.1: Compute the NN distances for the following set of points and label the corresponding edges. A * D * BC * Exercise 8.2: Compute the natural nearest neighbor distances for the points of Exercise 8.1

4 Exercise 8.3: Draw the minimal spanning tree for the following set of points EF G CD B A H I J Exercise 8.4: Which clusters result, if we want to have 2 clusters, 4 clusters, 5 clusters?

5 Exercise 8.5: Which clusters result from the k-means algorithm if we use the small circles as starting centroids for the clusters? EF G CoDo B A H I o oJ