search
Log In

Recent questions tagged bplustrees

0 votes
3 answers
1
asked Feb 2, 2019 in Databases Na462 538 views
0 votes
0 answers
2
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 Swapnil Naik 55 views
2 votes
1 answer
3
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 skywalker_19 234 views
1 vote
2 answers
4
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 syncronizing 329 views
1 vote
1 answer
5
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 Na462 615 views
3 votes
1 answer
6
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 of index ... cost of $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 Na462 977 views
2 votes
0 answers
7
a) 1631 b)1635 c)716 d)713
asked Jan 18, 2018 in Databases gari 97 views
0 votes
1 answer
8
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
asked Dec 15, 2017 in Databases iarnav 788 views
0 votes
0 answers
9
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 iarnav 71 views
0 votes
0 answers
10
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 iarnav 101 views
2 votes
1 answer
11
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 VS 1.2k views
2 votes
2 answers
12
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 VS 870 views
1 vote
1 answer
13
$\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 Pawan Kumar 2 361 views
4 votes
3 answers
14
pls explain
asked Nov 14, 2017 in Databases Nils 234 views
1 vote
1 answer
15
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 Arnabi 332 views
1 vote
0 answers
16
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 Manu Thakur 403 views
20 votes
1 answer
17
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 reena_kandari 2.9k views
2 votes
2 answers
18
asked Oct 25, 2017 in Databases Arnabi 253 views
2 votes
0 answers
19
2 votes
1 answer
20
asked Oct 17, 2017 in Databases Upasana singh 209 views
1 vote
2 answers
21
asked Oct 16, 2017 in Databases shivangi5 340 views
0 votes
1 answer
22
answer on virtual gate ia given 2, while my answer is 1.
asked Sep 17, 2017 in Databases Manu Thakur 169 views
0 votes
1 answer
23
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 pranjalgennext 95 views
0 votes
1 answer
24
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 pranjalgennext 101 views
0 votes
2 answers
25
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 pranjalgennext 340 views
1 vote
1 answer
26
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 on average, ... (D) 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 GateAspirant999 293 views
To see more, click for the full list of questions or popular tags.
...