Suppose that a data warehouse for Big-University consists of the following four dimensions: student, course, semester, and instructor, and two measures count and avg_grade. When at the lowest conceptual level (e.g., for a given student, course, semester, and instructor combination), the avg_grade measure stores the actual course grade of the student. At higher conceptual levels, avg_grade stores the average grade for the given combination. a) Draw a snowflake schema diagram for the data warehouse. b) Starting with the base cuboid [student, course, semester, instructor], what specific OLAP operations (e.g., roll-up from semester to year) should one perform in order to list the average grade of CS courses for each BigUniversity student. c) If each dimension has five levels (including all), such as “student < major < status < university < all”, how many cuboids will this cube contain (including the base and apex cuboids)?

-

a) A Snowflake Shema is shown in figure below:


b) The specific OLAP operations to be performed:

1. Roll-up on course from course_id to department.

2. Roll-up on a student from student_id to university.

3. Dice on course, student with department ="CS" and university = "biguniversity"

4. Drill-down on a student from the university to student_name.

c) N = 4 dimensions

The cube will contain 54 = 625 cuboids.

Comments

Post a Comment

Popular posts from this blog

Explain Parallel Efficiency of MapReduce.

-
Image
 PARALLEL EFFICIENCY OF MAP-REDUCE It is worth trying to figure out what is the parallel efficiency of MapReduce. Now let us assume that the data produced after the map phase is σ times the original data size D (σD), further, we assume that there are P processors which in turn perform map and reduce operations depending on which phase they are used in, so we do not have any wastage of processors. Also, the algorithm itself is assumed to do wD useful work, w is not necessarily a constant it could be D^2 or something like that, but the point is that there is some amount of useful work being done even if you have a single processor and that's wD. Now let us look at the overheads of doing the computation wD using MapReduce. After the map operation, instead of D data items, we have σD data items in P pieces, so each mapper writes data to their local disk. So, P there is some overhead associated with writing this data. Next, this data has to be read by each reducer before it can begin &#
Read more

Explain Enterprise Batch Processing Using Map-Reduce.

-
Image
 ENTERPRISE BATCH PROCESSING USING MAP-REDUCE Data is the new money in the 'contemporary world. The data generated by today's enterprises has been increasing at exponential rates in size over the most recent couple of years. Data-intensive calculations ate widespread in many application areas. Computational science is one of the most well-known. People who conduct scientific simulations and experiments are often eager to generate, review, and analyze large volumes of data. Telescopes scanning the sky create hundreds of terabytes of data each second; the collection of sky images often reaches petabytes over a year. Bioinformatics applications mine databases containing terabytes of data. Earthquake simulators manage massive volumes of data generated by detecting the Earth's earthquakes all across the planet. Other IT business fields, in addition to scientific computing, also require help from data-intensive computation. The transaction data of an eCommerce site may exceed mil
Read more