Recent questions tagged b-tree

0 votes

0 answers

1

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 23 hours ago in Databases by Subham Nagar Junior (883 points) | 16 views

0 votes

2 answers

2

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

asked Dec 8 in Databases by MRINMOY_HALDER (299 points) | 20 views

0 votes

2 answers

3

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 in Databases by aditi19 Active (2.1k points) | 59 views

0 votes

0 answers

4

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 in Databases by Shamim Ahmed Active (1k points) | 21 views

0 votes

0 answers

5

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 in Databases by Shamim Ahmed Active (1k points) | 21 views

0 votes

0 answers

6

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 in Databases by jatin khachane 1 Active (3.3k points) | 31 views

0 votes

1 answer

7

DBMS basic test1

asked Oct 27 in Databases by Shivani gaikawad Junior (743 points) | 57 views

0 votes

1 answer

8

made easy test series
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 the maximum ... carry 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 in Databases by sardendu (259 points) | 39 views

+1 vote

1 answer

9

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 in Databases by skywalker_19 (51 points) | 47 views

0 votes

0 answers

10

# 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 in Algorithms by LavTheRawkstar Active (5.2k points) | 50 views

0 votes

0 answers

11

# 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 in Algorithms by LavTheRawkstar Active (5.2k points) | 24 views

0 votes

1 answer

12

B+ tree maximum and minimum height

asked Aug 24 in Databases by Vishnathan (343 points) | 261 views

0 votes

1 answer

13

random...

asked Aug 20 in Operating System by Smishra95 Active (1.3k points) | 38 views

0 votes

2 answers

14

ACE TEST SERIES

asked Aug 20 in Operating System by Smishra95 Active (1.3k points) | 56 views

+1 vote

1 answer

15

proof
how the b and b+ tree formulae computed can u explain with the proof

asked Jun 24 in Databases by vijju532 Junior (679 points) | 80 views

+2 votes

1 answer

16

B+ tree indexing
Which of the following statements true for $B$ tree and $B^+$ tree index? A. $B$ tree index faster for range queries compare to $B^+$ tree index. B. If disk block allocated for $B^+$ tree index and same size disk block allocated for $B$ tree index then number ... $B^+$ tree index less than equal to I/O cost of $B$ tree index for random access of same key from set of distinct keys.

asked May 26 in Databases by Na462 Loyal (7.5k points) | 233 views

0 votes

1 answer

17

B+ tree Index
Suppose size of disk block 1000 bytes and search key of 12 bytes, pointer size 8 bytes. How many minimum number of records in data file which leads 3 level dense B+ tree index? My Approach:- Say P is the Order. and we know In dense index the number of records in DB file = No. of keys in B+tree ... 1 2 1 2 2 2*25 2*24 3 50 --- 50*24 So total keys = 1 + 2*24 + 50*24 = 1249. Am i right?

asked May 18 in Databases by Na462 Loyal (7.5k points) | 99 views

0 votes

1 answer

18

B+ Tree
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node. A. B tree index has more levels than B+ tree index for large number of keys. B. B+ tree index has more levels than B ... tree best for sequential access of records. D. B+ tree index nodes more than B+ tree for large number of keys. Please Explain every Point.

asked May 12 in Databases by Na462 Loyal (7.5k points) | 147 views

0 votes

1 answer

19

B+ TREE
What does this sentence mean ? A B+ - tree of order d is a tree in which each internal node has between d and 2d key values.

asked Mar 9 in Databases by hsmart (59 points) | 68 views

0 votes

1 answer

20

Doubt regarding deletion from a B-tree
After deleting an element from a B-tree,I could rearrange the tree in several ways,that would still complies to the rules of B-trees.But,we are supposed to follow a certain set of rules for rearranging the tree after deleting an element. Why is that ?

asked Mar 1 in Algorithms by Mathews George (15 points) | 109 views

0 votes

0 answers

21

B-tree
B tree has minimum space utilization equals to 66.6%. explain?

asked Jan 30 in Databases by hacker16 Active (2.8k points) | 98 views

0 votes

1 answer

22

Maximum height of a B+ tree of order m with n key values is (With Derivation)

asked Jan 29 in Databases by Salazar Active (1.1k points) | 377 views

+2 votes

0 answers

23

B+ Tree Madeesy
How to solve this?

asked Jan 18 in Databases by Shubham Kumar Gupta Junior (617 points) | 108 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