17 - Tutorial-2 Fri, March 05, 2010 DLPD, BITS-Pilani....

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Tutorial-2 Fri, March 05, 2010 1 DLPD, BITS-Pilani. Prepared by Dr.R. Gururaj, Asst.Professor of CS
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Thu, Feb 04, 2010 DLPD, BITS-Pilani. Prepared by Dr.R. Gururaj, Asst.Professor of CS 2 17 5 14 19 17 40 3 4 10 Record pointer Leaf level Root EX: B+ Tree (order 3) P = 3 min pointer in node = 3 2       B+ Tree
Background image of page 2
Fri, March 05, 2010 DLPD, BITS-Pilani. Prepared by Dr.R. Gururaj, Asst.Professor of CS 3 Problem-1 You are to build a B+ tree for a database, on dept_name attribute of Dept relation. The attribute dept_name is of 8 Bytes length. The Disk block size is 512 Bytes. Now, for the above situation, what is the best possible number of pointers per node(internal) of the above B+ tree. Each internal node is a disk block which contains search key values and pointers to subtrees. Each tree-pointer takes 2 Bytes.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Fri, March 05, 2010 DLPD, BITS-Pilani. Prepared by Dr.R. Gururaj, Asst.Professor of CS 4 Solution: Size of B+ tree node= size of disk block Each tree pointer points to disk block and takes 2 Bytes. Each key (dept_name) takes 8 Bytes
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/14/2010 for the course CSE IS ZC332 taught by Professor Shailendrasshekhawat during the Summer '10 term at Birla Institute of Technology & Science.

Page1 / 10

17 - Tutorial-2 Fri, March 05, 2010 DLPD, BITS-Pilani....

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online