Recent questions tagged b-tree

0 votes

1 answer

1

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

asked Jun 24 in Databases by vijju532 (369 points) | 34 views

0 votes

1 answer

2

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 Active (4.5k points) | 105 views

0 votes

1 answer

3

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 Active (4.5k points) | 69 views

0 votes

1 answer

4

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 Active (4.5k points) | 69 views

0 votes

1 answer

5

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

0 votes

1 answer

6

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

0 votes

0 answers

7

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

asked Jan 30 in Databases by hacker16 Active (2.7k points) | 76 views

0 votes

0 answers

8

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

+2 votes

0 answers

9

B+ Tree Madeesy
How to solve this?

asked Jan 18 in Databases by Shubham Kumar Gupta Junior (547 points) | 94 views

+3 votes

0 answers

10

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

asked Jan 16 in Databases by vishal chugh Active (1.7k points) | 39 views

+2 votes

1 answer

11

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

+1 vote

1 answer

12

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

+1 vote

0 answers

13

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

0 votes

1 answer

14

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

0 votes

1 answer

15

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

+1 vote

1 answer

16

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 (91.8k points) | 119 views

0 votes

0 answers

17

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 (7.9k points) | 169 views

0 votes

0 answers

18

#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 (7.9k points) | 29 views

0 votes

0 answers

19

#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 (7.9k points) | 53 views

0 votes

0 answers

20

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

0 votes

1 answer

21

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 (14.4k points) | 104 views

0 votes

0 answers

22

B TREE

asked Dec 8, 2017 in Databases by Abhijeet_Kumar Junior (815 points) | 60 views

0 votes

0 answers

23

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.5k points) | 57 views

+1 vote

1 answer

24

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.5k points) | 88 views

+1 vote

1 answer

25

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.9k points) | 180 views

+1 vote

1 answer

26

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

0 votes

0 answers

27

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

0 votes

0 answers

28

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

0 votes

0 answers

29

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

0 votes

1 answer

30

data base 2

asked Nov 22, 2017 in Databases by nikkey123 Active (1.5k points) | 67 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