Dark Mode

Recent questions tagged b-tree

26 votes

2 answers

211

GATE CSE 2004 | Question: 52
The order of an internal node in a $B+$ tree index is the maximum number of children it can have. Suppose that a child pointer takes $6$ bytes, the search field value takes $14$ bytes, and the block size is $512$ bytes. What is the order of the internal node? $24$ $25$ $26$ $27$

Kathleen asked in Databases Sep 18, 2014

11.3k views

30 votes

7 answers

212

GATE CSE 2003 | Question: 65
Consider the following $2-3-4$ tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in constructing the tree. What is the result of inserting $G$ in the above tree? None of the above

Kathleen asked in Databases Sep 17, 2014

10.0k views

33 votes

2 answers

213

GATE CSE 2002 | Question: 17
The following table refers to search items for a key in $B$-trees and $B^+$ ... $(2,11)$ and $(11,6)$ are now inserted into $R.$ What are the additional tuples that are inserted in $V$?

Kathleen asked in Databases Sep 15, 2014

5.7k views

42 votes

6 answers

214

GATE CSE 2002 | Question: 2.23, UGCNET-June2012-II: 26
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512$ bytes, and index pointers are of size $4$ bytes. Given the scenario, what ... of the degree (i.e. number of pointers per node) of the $B^+$ - tree? $16$ $42$ $43$ $44$

Kathleen asked in Databases Sep 15, 2014

14.1k views

8 votes

3 answers

215

GATE CSE 2001 | Question: 22
We wish to construct a $B^+$ tree with fan-out (the number of pointers per node) equal to $3$ for the following set of key values: $80, 50, 10, 70, 30, 100, 90$ Assume that the tree is initially empty and the values are added in the order ... need not be shown. The key values $30$ and $10$ are now deleted from the tree in that order show the tree after each deletion.

Kathleen asked in Databases Sep 14, 2014

4.8k views

12 votes

2 answers

216

GATE CSE 2000 | Question: 21
(a) Suppose you are given an empty $B^+$ tree where each node (leaf and internal) can store up to $5$ key values. Suppose values $1, 2,\ldots 10$ are inserted, in order, into the tree. Show the tree pictorially after $6$ insertions, and ... what approximately is the average number of keys in each leaf level node. in the normal case, and with the insertion as in (b).

Kathleen asked in Databases Sep 14, 2014

3.9k views

45 votes

4 answers

217

GATE CSE 2000 | Question: 1.22, UGCNET-June2012-II: 11
B$^{+}$-trees are preferred to binary trees in databases because Disk capacities are greater than memory capacities Disk access is much slower than memory access Disk data transfer rates are much less than memory data transfer rates Disks are more reliable than memory

Kathleen asked in Databases Sep 14, 2014

15.5k views

50 votes

6 answers

218

GATE CSE 2008 | Question: 41
A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place? $3$ $4$ $5$ $6$

Kathleen asked in Databases Sep 12, 2014

21.5k views

1 vote

1 answer

219

Can anyone please help with B+ tree multi level index structure creation?

spandan asked in Databases Aug 24, 2014

730 views

Page:

« prev
1
...
3
4
5
6
7
8

Recent questions tagged b-tree