Dark Mode

Recent questions tagged bplustrees

0 votes

1 answer

1

data base
Construct the B+ tree for the following set of key values : {2,3,5,7,11,17,19,23,29,31}. Assume that tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that will fit in one node is as follows: (a) Four (b) Six (c) Eight

gateexplore asked in Databases Jun 30, 2023

558 views

0 votes

3 answers

2

B+ Tree Records

Na462 asked in Databases Feb 2, 2019

by Na462

2.1k views

0 votes

0 answers

3

previous
https://gateoverflow.in/91199/gate1989-12a 34 should go up right? or we have choice to move either 34 or 50 up?

Swapnil Naik asked in Databases Nov 7, 2018

by Swapnil Naik

129 views

2 votes

1 answer

4

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

skywalker_19 asked in Databases Oct 8, 2018

by skywalker_19

662 views

1 vote

2 answers

5

Test Series
Consider a block of a size such that it can hold: • either 5 records of a relation R, or • be used as a B+ tree internal node with degree 11, or • B+ tree leaf node with degree 10. If R has 1000 records, then the smallest number of blocks that could be used to store R and a sparse B+ tree index on key of R is ________.

syncronizing asked in Databases Aug 19, 2018

by syncronizing

689 views

2 votes

1 answer

6

B+ Tree
Consider the following $B^+$ tree with the order of internal and leaf nodes as $3$ and $2$ respectively: The minimum number of key insertions that causes a new level to be introduced in the above $B^+$ tree ________. (Assume key redistribution is not allowed)

Na462 asked in Databases May 26, 2018

by Na462

1.7k views

4 votes

1 answer

7

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.

Na462 asked in Databases May 26, 2018

by Na462

3.2k views

2 votes

0 answers

8

database difficult question
a) 1631 b)1635 c)716 d)713

gari asked in Databases Jan 18, 2018

by gari

239 views

0 votes

1 answer

9

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

iarnav asked in Databases Dec 15, 2017

by iarnav

1.4k views

0 votes

0 answers

10

#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.

iarnav asked in Databases Dec 15, 2017

by iarnav

190 views

0 votes

0 answers

11

#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.

iarnav asked in Databases Dec 15, 2017

by iarnav

294 views

2 votes

1 answer

12

B+ tree 2
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels?

VS asked in Databases Dec 10, 2017

by VS

2.3k views

2 votes

2 answers

13

B+ tree
The minimum number of elements (keys) that need to be inserted into a B+ tree with the order of internal node 3 [maximum child pointers per node] and leaf node 2 [maximum keys per node], to make it to reach 3-levels are __________.

VS asked in Databases Dec 10, 2017

by VS

2.0k views

1 vote

1 answer

14

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

Pawan Kumar 2 asked in Databases Dec 7, 2017

by Pawan Kumar 2

1.0k views

4 votes

2 answers

15

B+ tree
pls explain

Nils asked in Databases Nov 14, 2017

by Nils

590 views

1 vote

1 answer

16

indexing
Given a data file with 100 records per page and 1000 pages and on index page capacity of 512 index entries, how deep should be the B+ tree to index this file. please explain with a diagram.

Arnabi asked in Databases Oct 28, 2017

by Arnabi

793 views

1 vote

0 answers

17

Database: B+ Tree Insertion
Question: the below figure shows a B+ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value 34 is inserted into the B+-tree. Obtain the modified B-tree after insertion. My Solution Please validate the solution,

Manu Thakur asked in Databases Oct 27, 2017

898 views

23 votes

1 answer

18

B+tree with sparse/Dense indexing
Database file consists of $10,000$ records with record size of $100$ bytes, block size $512$ bytes. If sparse B+ tree index is built over given database file with search key size $22$ bytes and both block pointer and record pointer of size $12$ bytes each.Find out a)minimum index block required b)maximum index block required my answers a)$143$ b)$325$.

reena_kandari asked in Databases Oct 26, 2017

by reena_kandari

5.7k views

2 votes

2 answers

19

Arnabi asked in Databases Oct 25, 2017

by Arnabi

647 views

2 votes

0 answers

20

indexing-Testbook

set2018 asked in Databases Oct 21, 2017

186 views

2 votes

1 answer

21

Upasana singh asked in Databases Oct 17, 2017

by Upasana singh

557 views

1 vote

2 answers

22

shivangi5 asked in Databases Oct 16, 2017

990 views

0 votes

1 answer

23

B+ Tree: Insert operation
answer on virtual gate ia given 2, while my answer is 1.

Manu Thakur asked in Databases Sep 17, 2017

327 views

0 votes

1 answer

24

Made Easy Test Series
Assume a B-plus tree as: Size of search key=15B Size of block=512B Size of record pointer=9B Size of block pointer=8B What is the maximum number of nodes that can be accomodated in each leaf and non-leaf node of the tree?

pranjalgennext asked in Databases Jan 13, 2017

by pranjalgennext

307 views

0 votes

1 answer

25

MADE EASY TEST SERIES
What is the maximum number of nodes if a B+ tree has order 4 and number of levels as 6?

pranjalgennext asked in Databases Dec 27, 2016

by pranjalgennext

265 views

0 votes

2 answers

26

MADE EASY TEST SERIES
What is the maximum number of records that can be indexed for a B+ tree of 4 levels with order 10 and root at level 1?

pranjalgennext asked in Databases Dec 27, 2016

by pranjalgennext

1.2k views

1 vote

1 answer

27

Indexing problem
Consider the following relations. Emp(eid:integer,ename:varchar,sal:integer,age:integer,did:integer) Dept(did:integer,budget:integer,floor:integer,mgr_eid:integer) Salaries ranges from 10000 to 100000 ages vary from 20 to 80, each department has about five employees ... Clustered B+ tree index on the budge field of Dept I feel in first paragraph what all important is Dept table.

GateAspirant999 asked in Databases Sep 14, 2016

by GateAspirant999

786 views

To see more, click for the full list of questions or popular tags.

Recent questions tagged bplustrees