Recent questions tagged b-tree

0 votes

1 answer

1

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) | 32 views

0 votes

1 answer

2

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 (13 points) | 56 views

0 votes

0 answers

3

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

asked Jan 30 in Databases by hacker16 Active (2.6k points) | 52 views

0 votes

0 answers

4

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) | 96 views

+2 votes

0 answers

5

B+ Tree Madeesy
How to solve this?

asked Jan 18 in Databases by Shubham Kumar Gupta Junior (513 points) | 71 views

+3 votes

0 answers

6

B+ Trees
Can anybody explain what is meant by "Minimum Space Utilization"?

asked Jan 16 in Databases by vishal chugh Active (1.6k points) | 31 views

+2 votes

1 answer

7

Made Easy Mock Test 1:
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is ________. I am getting 63 as the answer, but in the solution, it's saying 64. Can anyone check?

asked Jan 16 in Databases by souravsaha (241 points) | 303 views

+1 vote

1 answer

8

Self doubt B tree B+tree
To insert key into level L B/B+ tree maximum new nodes require to create?? And how?

asked Jan 6 in Databases by Anshul Shankar Active (1.1k points) | 52 views

+1 vote

0 answers

9

B/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 index ... C) Both B tree B+ tree best for sequential access of records. (D) B tree index nodes more than B+ tree for large number of keys.

asked Jan 2 in Databases by rajoramanoj Active (4.3k points) | 41 views

0 votes

1 answer

10

Made easy test series, Database
" B+ tree index has more levels than B tree index for large number of keys. " How the above statement is true ??

asked Dec 26, 2017 in Databases by ashish pal Active (1.1k points) | 70 views

0 votes

0 answers

11

B+ Trees
Going with the definition, that order of a B+ tree is the maximum number of children a node can have. What is exactly meant by the order of a leaf node? As per my understanding order of a leaf node is the number of <key,pr> pairs it can hold. But in ... the upper limit on keys should be 5 and not 4. Could someone explain why its taken to be n-1 in every B+ tree insertion tutorial.

asked Dec 19, 2017 in Databases by Shiwam1994 (35 points) | 118 views

+1 vote

1 answer

12

B tree
In B+ tree of order p,each leaf node should have (A) atmost $\left \lceil \frac{p}{2} \right \rceil$ values (B) atleast $\left \lceil \frac{p}{2} \right \rceil$ values (C) atmost $\left \lfloor \frac{p}{2} \right \rfloor$ values (D) atleast $\left \lfloor \frac{p}{2} \right \rfloor$ values

asked Dec 16, 2017 in Databases by srestha Veteran (81.7k points) | 92 views

0 votes

0 answers

13

B+ Tree Question
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?

asked Dec 15, 2017 in Databases by iarnav Loyal (6.5k points) | 112 views

0 votes

0 answers

14

#dbms b+tree
can anyone please explain the standard/universal procedure on how to perform deletion in b+ tree with the help of an example.

asked Dec 15, 2017 in Databases by iarnav Loyal (6.5k points) | 24 views

0 votes

0 answers

15

#dbms b+tree
can anyone please explain the standard/universal procedure on how to perform insertion in b+ tree with the help of an example.

asked Dec 15, 2017 in Databases by iarnav Loyal (6.5k points) | 36 views

0 votes

0 answers

16

madeeasy booklet
while(1) { flag[i]=true; while(flag[j]); <cs> flag[i]=false; } someone please tell bounded wait is satisfying or not???

asked Dec 12, 2017 in Operating System by aaru14 Junior (809 points) | 39 views

0 votes

1 answer

17

Doubt in gate 2009 B+-tree question
https://gateoverflow.in/1330/gate2009-44 Can anybody provide me the diagrams of the insertion operations. In both the cases, left biasing and right biasing. Do we split every time a node is full? Even when its siblings have space? Thank You.

asked Dec 9, 2017 in Databases by Rishabh Gupta 2 Boss (13.6k points) | 78 views

0 votes

0 answers

18

B TREE

asked Dec 8, 2017 in Databases by Abhijeet_Kumar Junior (785 points) | 53 views

0 votes

0 answers

19

B+ trees
Given a B+ tree, How can we find out their sequence of insertion?

asked Dec 7, 2017 in Databases by Pawan Kumar 2 Active (4.4k points) | 43 views

+1 vote

1 answer

20

B+ tree
$\text{Insertion Sequence}$ : $8,5,1,7,3,12,9,6$ Can someone plz show the Sequence of insertion in B+ tree step by step Thanks

asked Dec 7, 2017 in Databases by Pawan Kumar 2 Active (4.4k points) | 53 views

+1 vote

1 answer

21

B+ tree
Assume a system has following parameters to construct a B+ tree. The specification of the tree are: • Size of search key is 15 B • Size of block is 512 B • Size of record pointer is 9 B • Size of block pointer is 8 B The maximum number of keys that can be accommodated in each non-leaf node of the tree is ________.

asked Nov 30, 2017 in Databases by Tuhin Dutta Loyal (7.6k points) | 141 views

+1 vote

1 answer

22

B Trees
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. B tree index has more levels than B+ tree index for large number of keys. B+ tree index has more levels than B tree index for ... keys. Both B tree B+ tree best for sequential access of records. B+ tree index nodes more than B+ tree for large number of keys.

asked Nov 24, 2017 in Databases by sunaina rawat (203 points) | 126 views

0 votes

0 answers

23

nptel
Consider a B-tree with the following specifications: Page size c = 2 kB; Size of key γ = 32 bytes; Size of pointer η = 8 bytes. What is the order m of the B+-tree? How many records can a tree of height 3 store? doubt: x->pointer to block 8*x +(8+32)*(x-1)<=2048 x<=43.5 but given solution is 2*1024>=32*m+8(m+1)+8*m=42.2=42 please guide where i am wrong

asked Nov 23, 2017 in Databases by Learner_jai Active (2k points) | 53 views

0 votes

0 answers

24

self doubt dbms
Deletion in B+ tree, unable to get the underflow condition when we deal with http://home.iitj.ac.in/~ramana/ch10-st How grouping is done during underflow in B+, IN B we see the most populous sibling and do grouping and merge it.

asked Nov 23, 2017 in Databases by Learner_jai Active (2k points) | 27 views

0 votes

0 answers

25

data base 3
The difference between the minimum levels of B tree index required for 7000 keys and order of B tree node (P) is 12 (assume order P is max possible child pointers per B-tree node) and the minimum levels of B+ tree index required for 7000 keys and order of B+ tree node (P) is 12 (Assume P is max pointer possible to stage in B+ tree node) _________.

asked Nov 22, 2017 in Databases by nikkey123 Active (1.5k points) | 61 views

0 votes

1 answer

26

data base 2

asked Nov 22, 2017 in Databases by nikkey123 Active (1.5k points) | 57 views

0 votes

0 answers

27

data base 1

asked Nov 22, 2017 in Databases by nikkey123 Active (1.5k points) | 43 views

0 votes

0 answers

28

B-tree
please check this

asked Nov 22, 2017 in Databases by Anjan Active (1.7k points) | 48 views

0 votes

1 answer

29

virtual gate
Given key values 8,9,5,12,15,16,18,1,2 and using left biasing, which of the following btree is correct with order 3.

asked Nov 18, 2017 in DS by Manoja Rajalakshmi A Active (2.5k points) | 45 views

0 votes

1 answer

30

B tree
A B tree has order 10. Suppose it's leaf node already has 9 elements and one more element is inserted in it and split occurs. Now my question is is it always necessary that the split is of size 4 and 5 ie left child contain 4 values and right child node contain 5 values? Or it could also be 5 and 4? Thanks.

asked Nov 6, 2017 in Algorithms by Mahendra Singh Kanya (397 points) | 117 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