Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
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
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. Cons...
gateexplore
622
views
gateexplore
asked
Jun 30, 2023
Databases
databases
indexing
bplustrees
self-doubt
+
–
0
votes
3
answers
2
B+ Tree Records
Na462
2.1k
views
Na462
asked
Feb 2, 2019
Databases
databases
b-tree
bplustrees
+
–
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?
https://gateoverflow.in/91199/gate1989-12a34 should go up right? or we have choice to move either 34 or 50 up?
Swapnil Naik
131
views
Swapnil Naik
asked
Nov 7, 2018
Databases
bplustrees
+
–
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
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
689
views
skywalker_19
asked
Oct 8, 2018
Databases
indexing
databases
b-tree
bplustrees
+
–
1
votes
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 ________.
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 wi...
syncronizing
721
views
syncronizing
asked
Aug 19, 2018
Databases
bplustrees
+
–
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)
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 b...
Na462
1.7k
views
Na462
asked
May 26, 2018
Databases
bplustrees
data-structures
+
–
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.
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...
Na462
3.3k
views
Na462
asked
May 26, 2018
Databases
indexing
bplustrees
b-tree
data-structures
+
–
2
votes
0
answers
8
database difficult question
a) 1631 b)1635 c)716 d)713
a) 1631b)1635c)716d)713
gari
248
views
gari
asked
Jan 18, 2018
Databases
databases
bplustrees
+
–
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?
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
iarnav
1.4k
views
iarnav
asked
Dec 15, 2017
Databases
b-tree
bplustrees
databases
indexing
tree
+
–
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.
can anyone please explain the standard/universal procedure on how to perform deletion in b+ tree with the help of an example.
iarnav
200
views
iarnav
asked
Dec 15, 2017
Databases
databases
b-tree
bplustrees
+
–
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.
can anyone please explain the standard/universal procedure on how to perform insertion in b+ tree with the help of an example.
iarnav
305
views
iarnav
asked
Dec 15, 2017
Databases
databases
b-tree
bplustrees
+
–
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?
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
2.4k
views
VS
asked
Dec 10, 2017
Databases
databases
bplustrees
indexing
+
–
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 __________.
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...
VS
2.1k
views
VS
asked
Dec 10, 2017
Databases
databases
bplustrees
+
–
1
votes
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
$\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
1.0k
views
Pawan Kumar 2
asked
Dec 7, 2017
Databases
b-tree
tree
bplustrees
+
–
4
votes
2
answers
15
B+ tree
pls explain
pls explain
Nils
614
views
Nils
asked
Nov 14, 2017
Databases
databases
bplustrees
indexing
+
–
1
votes
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.
Given a data file with 100 records per page and 1000 pages and on indexpage capacity of 512 index entries, how deep should be the B+ tree toindex this file.please explain...
Arnabi
834
views
Arnabi
asked
Oct 28, 2017
Databases
indexing
databases
bplustrees
+
–
1
votes
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,
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 ins...
Manu Thakur
936
views
Manu Thakur
asked
Oct 27, 2017
Databases
databases
bplustrees
indexing
+
–
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$.
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 ...
reena_kandari
5.9k
views
reena_kandari
asked
Oct 26, 2017
Databases
databases
indexing
bplustrees
+
–
2
votes
2
answers
19
indexing doubt
Arnabi
673
views
Arnabi
asked
Oct 25, 2017
Databases
indexing
databases
bplustrees
+
–
2
votes
0
answers
20
indexing-Testbook
set2018
194
views
set2018
asked
Oct 21, 2017
Databases
databases
testbook-test-series
bplustrees
+
–
2
votes
1
answer
21
B+ tree
Upasana singh
580
views
Upasana singh
asked
Oct 17, 2017
Databases
databases
bplustrees
+
–
1
votes
2
answers
22
Indexing
shivangi5
1.0k
views
shivangi5
asked
Oct 16, 2017
Databases
indexing
databases
bplustrees
+
–
0
votes
1
answer
23
B+ Tree: Insert operation
answer on virtual gate ia given 2, while my answer is 1.
answer on virtual gate ia given 2, while my answer is 1.
Manu Thakur
334
views
Manu Thakur
asked
Sep 17, 2017
Databases
databases
bplustrees
+
–
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?
Assume a B-plus tree as:Size of search key=15BSize of block=512BSize of record pointer=9BSize of block pointer=8BWhat is the maximum number of nodes that can be accomodat...
pranjalgennext
322
views
pranjalgennext
asked
Jan 13, 2017
Databases
databases
bplustrees
+
–
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?
What is the maximum number of nodes if a B+ tree has order 4 and number of levels as 6?
pranjalgennext
276
views
pranjalgennext
asked
Dec 27, 2016
Databases
databases
bplustrees
+
–
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?
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
1.2k
views
pranjalgennext
asked
Dec 27, 2016
Databases
databases
bplustrees
+
–
1
votes
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.
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 ...
GateAspirant999
836
views
GateAspirant999
asked
Sep 14, 2016
Databases
indexing
bplustrees
hashing
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register