CS614 - Data Warehousing GDB 1 Solution 2021

 CS614 GDB Solution Spring 2021 

GDB’s Instructions 

1. You need to provide precise and to the point answer, avoid irrelevant details.
2. Copy from the internet or other student will get zero marks.
3. You should post your answer on the Graded Discussion Board (GDB), not on the Moderated Discussion Board (MDB). Both will run parallel to each other during the specified time. Therefore, due care will be needed.
4.   You need to use font style as “Times New Roman” and font size 12.
5.  You cannot participate in the discussion after the due date via email.
6.   The GDB will open and close on specified date and time. Please note that no grace day or extra time will be given for posting comments on GDB.

GDB Topic

A supermarket XYZ is a supermarket chain with 25 stores across the country. They do not have any facility to generate and analyze the reports for decision-making. They are planning to develop an OLAP system. The planned system helps the executive staff to take strategic decisions regarding their store, sales, personnel, products and central repository etc. Besides the development, they also want to speed up the data retrieval process for their OLAP system. Although indexes can be relatively useful for speeding data retrieval, however, they can slow the performance of database write operations. So, they are planning to use optimize indexing technique.

Following are some special Indexing Techniques:

1. Inverted index
2. Bit map index
3. Cluster index
4. Join index

You have to decide which indexing technique is most appropriate for the above scenario. Support your answer with solid arguments.

A concise, coherent and to-the-point comment is preferred over a lengthy comment having irrelevant details. Your comment must not be more than 4-5 lines.

SOLUTION : 

I will choose a Bitmap index technique for the above scenario. Because they work well with data that has a lower cardinality which means the data that take fewer distinct values. Bitmap indexes are useful in the data warehousing applications. Bitmap indexes have a significant space and performance advantage over other structures for such data. Tables that have less number of insert or update operations can be good candidates. They have a highly compressed structure, making them fast to read. Their structure makes it possible for the system to combine multiple indexes together so that they can access the underlying table faster.

NOTE: Do Not Copy Paste The Solution