• Keine Ergebnisse gefunden

Exercises for DW & DM Sheet 4 (until 03.12.2010)

N/A
N/A
Protected

Academic year: 2021

Aktie "Exercises for DW & DM Sheet 4 (until 03.12.2010)"

Copied!
3
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Exercises for DW & DM

Technische Universität Braunschweig Institut für Informationssysteme http://www.ifis.cs.tu-bs.de Wolf-Tilo Balke, Silviu Homoceanu

Exercises for DW & DM Sheet 4 (until 03.12.2010)

You may hand in your solutions into the mailbox at the IFIS floor (Mühlenpfordtstraße 23, 2nd floor). For the ITIS students only, please send your solutions to silviu@ifis.cs.tu-bs.de.

The deadline is Friday, after the next lecture (date is also mentioned above). You may an- swer in either German or English. You are encouraged to work in teams of 2 stu- dents (not more than 2), and send your solution as a team. Please mention the name of both students together with the corresponding inmatriculation numbers.

Exercise 1 (2P)

Only for non-ITIS students: Please log in to our Homework Management System (HMS) at https://www.ifis.cs.tu-bs.de:8443/hms/ using your y-number and password and sign in for this lecture. This will make grading and managing your homework easier for both of us. (Some of you have already been added to the lecture, so please check the accuracy of the information).

Exercise 2 (5P)

1. What kind of a schema is presented in Annex 1? (1P)

2. In which case should we consider migrating from a snowflake schema to a star sche-

ma? (1P)

3. Considering that the product dimension is subject to often change, how would you transform (draw) the schema in Annex 1, into a Starflake one? (3P)

Exercise 3 (3P)

1. What does linearization mean, in the case of multidimensional storage? (1P) 2. Explain why dimension order is important when storing multidimensional data in a li-

nearized array. (2P) Exercise 4 (18P)

1. Considering the R-Tree graphically represented through the MBR with a maximal node size of 3, in Annex 2, perform the following tasks:

a. Insert, in this order the following data (each of them will be represented as the small red squares): (“08 Qtr2”, “b”), (“08 Qtr2”, “c”), (“09 Qtr1”, “c”).

Represent each step graphically, evidenciating the produced split. As split me-

(2)

thod use the linear terion. (12

b. Draw the R-Tree according to the obtained graphical representation of the MBR, after performing exercise

c. Graphically represent (as in the lecture) the following search Qtr

3

], [a,c]) on both the MBR representation obtained

well as on the R-Tree representation obtained from

Exercise 5 (12P)

1. Consider data presented in Annex

Product dimensions, which should serve queries as sell in Q1 and Q2?’ For the UB

Present the following:

a. The Z-curve and the corresponding b. A mapping between th

c. How many blocks do we need to access in order to answer UB Index and how

Annex 1:

Exercises for DW & DM

Technische Universität Braunschweig Institut für Informationssysteme

http://www.ifis.cs Wolf-Tilo Balke,

linear cost algorithm and as heuristics, the least enlargement cr 2P)

Tree according to the obtained graphical representation of the MBR, after performing exercise 4.a. (3P)

Graphically represent (as in the lecture) the following search

on both the MBR representation obtained from exercise 4 Tree representation obtained from 4.b.

presented in Annex 3. Construct an UB-Tree index on the Time and uct dimensions, which should serve queries as ‘How many cell phones did we

For the UB-Tree, consider a size of 5 records for curve and the corresponding Z-regions; (6P) mapping between the sale ids and the UB index ids; (2P)

How many blocks do we need to access in order to answer the query on the UB Index and how many would we need without it? (4P)

Technische Universität Braunschweig Institut für Informationssysteme http://www.ifis.cs.tu-bs.de Tilo Balke, Silviu Homoceanu

cost algorithm and as heuristics, the least enlargement cri- Tree according to the obtained graphical representation of the Graphically represent (as in the lecture) the following search ([08 Qtr

2

, 08 from exercise 4.a, as

(3P)

on the Time and cell phones did we 5 records for a HDD block.

the query on the

(3)

Annex 2:

Annex 3:

ID Qtr Year

1 Q1 2010

2 Q2 2010

3 Q3 2010

4 Q4 2010

ID Qty ID_Prod

1 … 5

2 2

3 3

4 2

5 1

6 3

7 8

8 7

9 5

10 6

11 5

12 3

13 2

14 8

15 6

16 7

17 5

18 3

19 4

20 2

21 1

Exercises for DW & DM

Technische Universität Braunschweig Institut für Informationssysteme

http://www.ifis.cs Wolf-Tilo Balke,

ID_Prod ID_Day

1 1 1 2 3 2 1 1 2 1 3 3 3 4 2 2 4 4 1 4 4

ID Product Group Category

1 Nokia N8 Cell Phones Electronics 2 BlackBerry Bold Cell Phones Electronics 3 BlackBerry Storm Cell Phones Electronics 4 Apple Iphone Cell Phones Electronics

5 Samsung UE46 TV Electronics

6 Panasonic TX50 TV Electronics 7 Philips 46PFL TV Electronics 8 Panasonic TX46 TV Electronics

Technische Universität Braunschweig Institut für Informationssysteme http://www.ifis.cs.tu-bs.de Tilo Balke, Silviu Homoceanu

Category Electronics Electronics Electronics Electronics Electronics Electronics Electronics Electronics

Referenzen

ÄHNLICHE DOKUMENTE

Imagine a conceptual model, and represent it in mE/R for the Lufthansa sales de- partment, knowing that the department wants to be able to investigate ticket sales.

Consider a star schema with a fact table for sales, and 3 dimensions, the Geo, Time and Product dimension.. (Express all the intermediate results in MB, GB, or TB

Technische Universität Braunschweig Institut für Informationssysteme http://www.ifis.cs.tu-bs.de Wolf-Tilo Balke, Silviu Homoceanu.. Exercises for DW & DM Sheet 8

a. Build a decision tree based on the training set data, using the algorithm pro- vided in the lecture, considering all attributes as possible classification attrib- utes, and

Technische Universität Braunschweig Institut für Informationssysteme http://www.ifis.cs.tu-bs.de Wolf-Tilo Balke, Silviu Homoceanu!. Exercises for DW & DM Sheet 1

Technische Universität Braunschweig Institut für Informationssysteme http://www.ifis.cs.tu-bs.de Wolf-Tilo Balke, Silviu Homoceanu!. Exercises for DW & DM Sheet 2

The Exchange Rates cube can be de- fined as follows: Exchange Rates((Day, Bank, Country),(Buy$_Opening, Buy$_Closing, Buy$_Average, Sell$_Opening, Sell$_Closing,

Technische Universität Braunschweig Institut für Informationssysteme http://www.ifis.cs.tu-bs.de Wolf-Tilo Balke, Silviu Homoceanu!. Exercises for DW & DM Sheet 4