Recent questions tagged bplustrees

0 votes

3 answers

1

B+ Tree Records

asked Feb 2, 2019 in Databases by Na462 Loyal (7k points) | 196 views

0 votes

0 answers

2

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

asked Nov 7, 2018 in Databases by Swapnil Naik Active (3.2k points) | 31 views

+1 vote

1 answer

3

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 (77 points) | 113 views

+1 vote

2 answers

4

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

asked Aug 19, 2018 in Databases by syncronizing Junior (835 points) | 149 views

+1 vote

1 answer

5

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)

asked May 26, 2018 in Databases by Na462 Loyal (7k points) | 176 views

+3 votes

1 answer

6

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, 2018 in Databases by Na462 Loyal (7k points) | 490 views

+2 votes

0 answers

7

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

asked Jan 18, 2018 in Databases by gari Active (3.5k points) | 76 views

0 votes

1 answer

8

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 (8.4k points) | 390 views

0 votes

0 answers

9

#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 (8.4k points) | 45 views

0 votes

0 answers

10

#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 (8.4k points) | 72 views

+2 votes

1 answer

11

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?

asked Dec 10, 2017 in Databases by VS Boss (10.8k points) | 413 views

+2 votes

2 answers

12

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

asked Dec 10, 2017 in Databases by VS Boss (10.8k points) | 490 views

+1 vote

1 answer

13

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.2k points) | 167 views

+3 votes

3 answers

14

B+ tree
pls explain

asked Nov 14, 2017 in Databases by Nils Junior (593 points) | 125 views

+1 vote

1 answer

15

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.

asked Oct 28, 2017 in Databases by Arnabi Loyal (8k points) | 198 views

+1 vote

0 answers

16

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,

asked Oct 27, 2017 in Databases by Manu Thakur Boss (44.1k points) | 293 views

+20 votes

1 answer

17

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

asked Oct 27, 2017 in Databases by reena_kandari Loyal (8.4k points) | 1.9k views

+2 votes

1 answer

18

indexing doubt

asked Oct 25, 2017 in Databases by Arnabi Loyal (8k points) | 177 views

+2 votes

0 answers

19

indexing-Testbook

asked Oct 21, 2017 in Databases by set2018 Loyal (7.8k points) | 60 views

+2 votes

1 answer

20

B+ tree

asked Oct 17, 2017 in Databases by Upasana singh Junior (543 points) | 86 views

+1 vote

2 answers

21

Indexing

asked Oct 16, 2017 in Databases by shivangi5 Active (1.2k points) | 193 views

0 votes

1 answer

22

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

asked Sep 17, 2017 in Databases by Manu Thakur Boss (44.1k points) | 96 views

0 votes

1 answer

23

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?

asked Jan 14, 2017 in Databases by pranjalgennext Active (1.3k points) | 71 views

0 votes

1 answer

24

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

asked Dec 27, 2016 in Databases by pranjalgennext Active (1.3k points) | 75 views

0 votes

2 answers

25

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?

asked Dec 27, 2016 in Databases by pranjalgennext Active (1.3k points) | 191 views

+1 vote

1 answer

26

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.

asked Sep 15, 2016 in Databases by GateAspirant999 Active (2.5k points) | 226 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 bplustrees

Recent Posts

Recent Blog Comments