Recent questions tagged b-tree

Recent questions tagged b-tree

1 vote

1 answer

1

Applied Mock Test
The smallest number of keys that will force a B-Tree of order 3 to have a height of 3 are _______ Consider that the root node is at height 0.

LRU asked in Databases Dec 22, 2021

by LRU

288 views

1 vote

1 answer

2

Ace BITS&BYTES, #Trees #B-Tree
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560 127 & 2186 6561 & 255 255 & 2186

casberg asked in DS Nov 23, 2021

143 views

3 votes

5 answers

3

GATE CSE 1994 | Question: 14b
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.

gatecse asked in Databases May 3, 2021

1.2k views

2 votes

1 answer

4

NIELIT 2017 DEC Scientific Assistant A - Section B: 21
The $2-3-4$ tree is a self-balancing data structure, which is also called : $2-4$ tree $B+$ tree $B-$ tree None of the options

Lakshman Patel RJIT asked in Databases Mar 31, 2020

by Lakshman Patel RJIT

594 views

0 votes

1 answer

5

NIELIT 2017 July Scientist B (CS) - Section B: 43
Which one of the following is a key factor for preferring $B$-trees to binary search trees for indexing database relations? Database relations have a large number of records Database relations are sorted on the primary key $B$-trees require less memory than binary search trees Data transfer from disks is in blocks

Lakshman Patel RJIT asked in Databases Mar 30, 2020

by Lakshman Patel RJIT

510 views

25 votes

3 answers

6

GATE CSE 2020 | Question: 54
Consider a database implemented using $\text{B+}$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{12 bytes}$ ... that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is _______

Arjun asked in Databases Feb 12, 2020

by Arjun

13.6k views

1 vote

0 answers

7

KPGCET-CSE-2019-43
The distinction between B tree and B+ tree is that В tree contains data at all memory locations whereas B+ tree contains data at leaf level nodes B+ tree contains data at all levels and B tree contains data only at the leaf nodes. Both contain data at all levels Both contains data only at leaf nodes.

gatecse asked in Databases Aug 4, 2019

128 views

1 vote

1 answer

8

B TRees DBMS Self doubt
In case of B Trees we split a node on insertion in case of overflow, is there any possible case in which this may lead to underflow also? as a key is promoted to parent the children formed may have subtrees, which may be broken such that we get underflow somewhere? just a thought

manisha11 asked in Databases Jun 7, 2019

312 views

1 vote

1 answer

9

DBMS Korth Edition 4 Exercise 12 Question 5 (Page No. 490)
Construct a $B^+$-tree for the following set of key values: $(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)$ Assume that the tree is initially empty and values are added in ascending order. Construct B+-trees for the cases where the number of pointers that will fit in one node is as follows: a. Four b. Six c. Eight

akash.dinkar12 asked in Databases Apr 1, 2019

by akash.dinkar12

626 views

14 votes

3 answers

10

GATE CSE 2019 | Question: 14
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table? B+ Tree is a height-balanced tree Non-leaf nodes have pointers to data records Key values in each node are kept in sorted order Each leaf node has a pointer to the next leaf node

Arjun asked in Databases Feb 7, 2019

by Arjun

7.8k views

0 votes

3 answers

11

B+ Tree Records

Na462 asked in Databases Feb 2, 2019

by Na462

1.2k views

2 votes

1 answer

12

Applied Course | Mock GATE | Test 1 | Question: 27
Which of the following statements is/are true? B tree is faster for range search and B+ tree is faster for equality search. B tree is faster for equality search and B+ tree is faster for range search. Both B tree is and B+ tree are equally fast for equality and range search. Both B tree is and B+ tree are slow for equality and range search.

Applied Course asked in Databases Jan 16, 2019

by Applied Course

246 views

0 votes

0 answers

13

self doubt
Identify the B-Tree from the following after inserting R,Y,F,X,A,M,C,D,E,T,H,V,L,G (in the order) with Branching factor of 3. If any insertion of element causes split, first split that node without element insertion and after balanced then insert that element.

Shubham Aggarwal asked in Databases Jan 15, 2019

by Shubham Aggarwal

412 views

0 votes

0 answers

14

B+ tree
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?

bts1jimin asked in Databases Jan 9, 2019

270 views

1 vote

0 answers

15

self doubt
For range queries every B+ tree index requires less I/O than a full table scan. can anyone explain?

newdreamz a1-z0 asked in Databases Jan 2, 2019

by newdreamz a1-z0

342 views

0 votes

0 answers

16

MadeEasy Test Series: Databases - B Tree
According to me, since the B trees have a data pointer for each of the key values in their internal nodes, the I/O access for them should take less time since we do not need to traverse down all of the tree.

Harsh Kumar asked in Databases Dec 28, 2018

428 views

1 vote

1 answer

17

GATE Overflow | Mock GATE | Test 1 | Question: 27
Which of the following statements is incorrect with respect to B-tree and B+ trees? Deletion operation is easier in B-tree but complex in case of B+ trees. In B+ trees, data records are stored only in the leaf nodes but in B trees data ... repeated in case of B+ trees but not in case of B trees. Searching is faster in B+ trees compared to B trees

Ruturaj Mohanty asked in Databases Dec 27, 2018

by Ruturaj Mohanty

3.2k views

0 votes

0 answers

18

MadeEasy Subject Test 2019: Databases - B Tree
By default take ROOT at level 1 or 0? and if asked for B tree then take all the levels but for B+ records only at leaf so only leaf level keys right?

Markzuck asked in Databases Dec 18, 2018

304 views

0 votes

1 answer

19

B+ tree doubt
Consider a B+ -tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a non-root node? What will be the same in a B-Tree Please also refer the source from where clear-cut formulae are given

Subham Nagar asked in Databases Dec 15, 2018

by Subham Nagar

267 views

0 votes

2 answers

20

doubt
Why B-tree & B+ tree is used in database indexing instead of other tree like BST, Binary tree etc??

mrinmoyh asked in Databases Dec 8, 2018

270 views

0 votes

0 answers

21

MadeEasy Test Series: Databases - B Tree
The Following key values are inserted into B+ tree in which order of internal node is 4, and that of leaf node is 3, in the sequence given below.The Order of internal node is the maximum number of tree pointers in each node and the order of ... ,30,40,35,20,8,10,5 are inserted.The Maximum number of times nodes get spilt up as a result of these insertion ___

jatin khachane 1 asked in Databases Nov 25, 2018

by jatin khachane 1

403 views

1 vote

2 answers

22

B+ Tree Self Doubt
what is the minimum and maximum number of keys for non-leaf nodes and leaf nodes for B+ Tree of order p?

aditi19 asked in Databases Nov 23, 2018

979 views

0 votes

0 answers

23

B tree Doubt
https://gateoverflow.in/3723/gate2004-it-79 In the above question why record pointer is considered in internal node size calculation?

Shamim Ahmed asked in Databases Nov 16, 2018

by Shamim Ahmed

157 views

0 votes

0 answers

24

B+ Tree Doubt
Why internal node split isn't counted in this question? Only leaf node split is counted. https://gateoverflow.in/1330/gate2009-44

Shamim Ahmed asked in Databases Nov 16, 2018

by Shamim Ahmed

174 views

0 votes

1 answer

25

Gateforum Test Series: Databases - B Tree

Gupta731 asked in Databases Nov 3, 2018

462 views

0 votes

3 answers

26

Self doubt
Consider a B+ tree in which the maximum number of keys in a Internal node is 5 and maximum number of keys in a leaf node is 4. What is the minimum number of keys in any non-root node?

jatin khachane 1 asked in Databases Oct 30, 2018

by jatin khachane 1

508 views

Page:

1
2
3
4
5
6
7
next »

Follow @gateoverflow

Recent questions tagged b-tree

Search GATE Overflow for GATE CSE