Recent questions tagged b-tree

0 votes

0 answers

1

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

asked Apr 1 in Databases by akash.dinkar12 Boss (39k points) | 10 views

+1 vote

1 answer

2

GATE2019-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

asked Feb 7 in Databases by Arjun Veteran (395k points) | 1.6k views

0 votes

1 answer

3

B+ Tree Records

asked Feb 2 in Databases by Na462 Loyal (8.7k points) | 102 views

0 votes

1 answer

4

GATEBOOK-2019 Mock Test1-56
A B-tree of order $m$ is a tree which satisfies the following properties: Every node has at most $m$ children. Every node (except root) has at least $ \lceil m/2 \rceil$ children The maximum number of internal nodes an order $4$ B-tree can have with $20$ keys is _____

asked Jan 19 in Databases by GATEBOOK Boss (17.2k points) | 515 views

0 votes

0 answers

5

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.

asked Jan 15 in Databases by Shubham Aggarwal Active (1.9k points) | 42 views

0 votes

0 answers

6

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

asked Jan 9 in Databases by bts1jimin (273 points) | 39 views

0 votes

0 answers

7

GATEBOOK-2019 Grand Test DBMS-18
An order $\text{3 B-tree}$ is an index tree where every node other than root has at most $\text{2 keys}$ and at least one key. Starting with an empty tree if following keys are inserted into the tree $1,2,3,4,5,6,7,8,9,10$ (not necessarily in the ... and maximum number of node splits possible, if node splitting algorithm is used? $2 , 3$ $3 , 4$ $3 , 5$ $2 , 5$

asked Jan 6 in Databases by GATEBOOK Boss (17.2k points) | 105 views

0 votes

0 answers

8

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

asked Jan 2 in Databases by newdreamz a1-z0 Active (1.7k points) | 20 views

0 votes

0 answers

9

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.

asked Dec 28, 2018 in Databases by Harsh Kumar Active (1.3k points) | 71 views

0 votes

0 answers

10

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?

asked Dec 18, 2018 in Databases by Markzuck Junior (643 points) | 72 views

0 votes

1 answer

11

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

asked Dec 15, 2018 in Databases by Subham Nagar Active (1.2k points) | 68 views

0 votes

2 answers

12

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

asked Dec 8, 2018 in Databases by MRINMOY_HALDER Junior (919 points) | 34 views

0 votes

0 answers

13

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 ___

asked Nov 25, 2018 in Databases by jatin khachane 1 Loyal (7.1k points) | 68 views

0 votes

2 answers

14

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?

asked Nov 23, 2018 in Databases by aditi19 Active (2.9k points) | 132 views

0 votes

0 answers

15

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

asked Nov 16, 2018 in Databases by Shamim Ahmed Active (2.5k points) | 37 views

0 votes

0 answers

16

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

asked Nov 16, 2018 in Databases by Shamim Ahmed Active (2.5k points) | 31 views

0 votes

0 answers

17

Gateforum Test Series: Databases - B Tree

asked Nov 3, 2018 in Databases by Gupta731 Active (4.8k points) | 43 views

0 votes

1 answer

18

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?

asked Oct 30, 2018 in Databases by jatin khachane 1 Loyal (7.1k points) | 46 views

0 votes

1 answer

19

DBMS basic test1

asked Oct 27, 2018 in Databases by Shivani gaikawad Junior (779 points) | 62 views

0 votes

1 answer

20

MadeEasy Test Series: Databases - B Tree
The following key values are inserted into B+ tree in which the order of internal nodes is 4 and that of the leaf node is 5 in the sequence given below. The order of internal node is maximum number of keys in each node and the order of leaf node is ... 5 pointer then till 5 element we can insert in one leaf. So answer should be 5+ 19+23 = 47. AM i Right?

asked Oct 22, 2018 in Databases by sardendu (257 points) | 77 views

+1 vote

1 answer

21

Indexing
How to prove that if same size blocks are allocated to B trees and B+ trees then:- No. of index nodes in B tree >= No. Of index nodes in B+ tree

asked Oct 8, 2018 in Databases by skywalker_19 (67 points) | 84 views

0 votes

0 answers

22

# Binomial tree # Binomial Heap
What is Binomial tree please explain in easy words. Construct the Binomial heap for the following sequence of numbers 7,2,4,17,1,11,6,8,15,10,20. Also apply the operation of extracting the minimum key in the resulting binomial Heap.

asked Sep 10, 2018 in Algorithms by LavTheRawkstar Active (5.2k points) | 75 views

0 votes

0 answers

23

# B Tree
Please Derive the Relation in between degree and the height of n keys B Tree. Insert the following information into an Empty B Tree with Degree t=3. F,S,Q,K,C,L,H,T,V,W,M,R,N,P,A,B,X,Y,D,Z,E

asked Sep 10, 2018 in Algorithms by LavTheRawkstar Active (5.2k points) | 30 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged b-tree

Recent Posts

Recent Blog Comments