lOMoARcPSD|54516663
Week 10 - DBMS
dbms (Anna University)
Scan to open on Studocu
Studocu is not sponsored or endorsed by any college or university
Downloaded by Bubu Maity (
[email protected])
lOMoARcPSD|54516663
Answer Submitted.
X
(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)
[email protected]
NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Introduction to Database
Systems (course)
Course
outline Week 10: Assignment 10
Introduction
(Non Graded)
to Assignment not submitted
Database
Note : This assignment is only for practice purpose and it will not be
Systems ()
counted towards the Final score
Week 0 () 1) Consider a B+ tree in which the maximum number of keys in an internal 1 point
node is 5. What is the minimum number of keys in any non-root internal node?
Week 1 ()
1
Week 2 () 2
3
Week 3 () 4
No, the answer is incorrect.
Week 4 () Score: 0
Accepted Answers:
Week 5 () 2
Week 6 () 2) The number of block accesses during merge phase is 1 point
Week 7 () 228
8192
Week 8 ()
12288
16384
Week 9 ()
lOMoARcPSD|54516663
Yes, the answer is correct.
Week 10 () Score: 1
Accepted Answers:
B+ trees on 12288
Disks (unit?
unit=84&lesson=85) 3) Consider two data files R and S with b1 and b2 blocks stored on two 1 point
disks with half blocks on each disk to support parallel access.
Performance
To perform Nested loop join on the two files using the algorithm given below,
and
m memory buffers are available (assume that m is
Reliability
of Multiple
an odd number). Two buffers are used for the inner file (one block from each
Disks (unit? disk), one for the result and the rest of the buffers are
unit=84&lesson=86) equally divided for the outer file from both the disks. Let the time taken to
access a block be t .
Relational
for each record x,y in R do // x is from disk 1 and y is from disk 2
Query
for each record u,v in S do // u is from disk 1 and v is from disk 2
Evaluation
(unit?
check if x, u join .. .
unit=84&lesson=87) check if x, v join .. .
check if y, u join .. .
Lecture
check if y, v join .. .
Slides (unit?
unit=84&lesson=88)
The number of times all the blocks of the inner file are accessed is
Practice:
Week 10: ceil( b1 / (m - 3) )
Assignment ceil( b1 / (2 * (m - 3)) )
10 (Non
ceil( b1 / (4 * (m - 3)) )
Graded)
(assessment? ceil( b1 / (2 * (m - 2)) )
name=122)
No, the answer is incorrect.
Score: 0
Quiz: Week
10: Accepted Answers:
Assignment ceil( b1 / (m - 3) )
10
(assessment? Check Answers and Submit
name=140)
Your score is: 1/3
Week 10
Feedback
form :
Introduction
to
Database
Systems
(unit?
unit=84&lesson=90)
Week 11 ()
Week 12 ()
Download
Videos ()
lOMoARcPSD|54516663
Lecture
Notes ()
Live
Sessions
()
Problem
Solving
Session ()
