Assignment No. 03
CS614: Data Warehousing
Total Marks: 15
Due Date: 27-Jan-2020
The objective of this assignment is to enhance the learning capabilities of the students about:
· Join Techniques
· Hash based join
· Sort-Merge join
Please read the following instructions carefully before submitting assignment:
You need to use MS word document to prepare and submit the assignment on VU-LMS.
It should be clear that your assignment will not get any credit if:
§ The assignment is submitted after due date.
§ The assignment is not in the required format (.doc or docx)
§ The submitted assignment does not open or file is corrupt.
§ Assignment is copied(partial or full) from any source (websites, forums, students, etc)
HyperMart is an online shopping store currently acquiring a large number of customers.
Normalized table structures for the shopping store are given below:
Order details Table
· Assume 1:12 record count ratio between Order and Order detail for online store’s database
· Assume 10,000 orders
For the given relations you are required to calculate the following costs in terms of I/O operations and find out which joining technique is better for given scenario. Tasks you are required to perform are as under;
1. Cost of Sort-Merge Join
2. Cost of Hash-Join
3. On the basis of your calculations, suggest better joining technique between sort-merge and hash join for the given scenario
Best of Luck!
Please Discuss here about this assignment.Thanks
Our main purpose here discussion not just Solution
Students having same subject can start discussion here to solve assignment, GDB & Quiz and can clear their concepts until solution is provided.
P.S: Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”
Then copy Questions from assignment file and paste in Discussion.
+ http://bit.ly/vucodes (For Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (For Past Papers, Solved MCQs, Short Notes & More)
+ Click Here to Search (Looking For something at vustudents.ning.com?)
+ Click Here to Join (Our facebook study Group)
aisy kaisay solve krna guide krdain koi
I suggest Hash-Join
Using the hash function on the hash keys guarantees that any two joining records must be in the same pair of files. Therefore, the task of joining two large inputs has been reduced to multiple, but smaller, instances of the same tasks. The hash join is then applied to each pair of partitioned files.
This is just a idea solution. Make your OWN :)
Thanks for sharing ...
CS614 Assignment No 02 Solution Fall 2019