We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

                          Assignment No. 03
                        Semester: Fall 2019

CS614: Data Warehousing

Total Marks: 15

 

Due Date: 27-Jan-2020

 

Objective:

The objective of this assignment is to enhance the learning capabilities of the students about:

·         Join Techniques

·         Hash based join

·         Sort-Merge join

 

Instructions:

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)

 

Assignment 

 

 

Question

 

HyperMart is an online shopping store currently acquiring a large number of customers.

 

Normalized table structures for the shopping store are given below:

 

Order Table

 

Order_ID

Order_Date

100

2-Feb-2019

201

2-Feb-2019

300

4-Feb-2019

1

 

….

 

M

 

Order details Table

 

Detail_ID

Order_ID

Product_ID

Product_Quantity

Sale_Amount

100

100

2

1

100

101

100

3

2

200

200

201

5

1

50

201

201

7

1

90

300

300

15

1

600

301

300

56

1

800

302

300

57

1

850

….

….

 

Table Information

 

·         Assume 1:12 record count ratio between Order and Order detail for online store’s database

·         Assume 10,000 orders

 

 

Task

 

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!

 

 

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 908

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link 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)

Replies to This Discussion

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.

plz koi idea solution da dain

This is just a idea solution. Make your OWN :)

Attachments:

Thanks for sharing ... 

CS614 Assignment No 02 Solution Fall 2019

Below link

CS614_Assignmnet_03_Solution_Fall_2019_vustudents.ning.com.pdf

RSS

Latest Activity

© 2020   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.