Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for b-tree
70
votes
12
answers
1
GATE CSE 2009 | Question: 44
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the ... $1$ The maximum number of times leaf nodes would get split up as a result of these insertions is $2$ $3$ $4$ $5$
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The ...
Kathleen
36.8k
views
Kathleen
asked
Sep 22, 2014
Databases
gatecse-2009
databases
b-tree
normal
+
–
47
votes
3
answers
2
GATE CSE 2020 | Question: 54
Consider a database implemented using $\text{B+}$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{12 bytes}$ ... that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is _______
Consider a database implemented using $\text{B+}$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{...
Arjun
22.3k
views
Arjun
asked
Feb 12, 2020
Databases
gatecse-2020
numerical-answers
databases
b-tree
indexing
2-marks
+
–
56
votes
8
answers
3
GATE CSE 2010 | Question: 18
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node?$1$$2$$3$$4$
go_editor
32.7k
views
go_editor
asked
Sep 29, 2014
Databases
gatecse-2010
databases
b-tree
easy
+
–
53
votes
5
answers
4
GATE CSE 2005 | Question: 28
Which of the following is a key factor for preferring $B^+$-trees to binary search trees for indexing database relations? Database relations have a large number of records Database relations are sorted on the primary key $B^+$-trees require less memory than binary search trees Data transfer form disks is in blocks
Which of the following is a key factor for preferring $B^+$-trees to binary search trees for indexing database relations?Database relations have a large number of records...
Kathleen
24.9k
views
Kathleen
asked
Sep 22, 2014
Databases
gatecse-2005
databases
b-tree
normal
+
–
35
votes
3
answers
5
GATE CSE 1999 | Question: 1.25
Which of the following is correct? B-trees are for storing data on disk and B$^+$ trees are for main memory. Range queries are faster on B$^+$ trees. B-trees are for primary indexes and B$^+$ trees are for secondary indexes. The height of a B$^+$ tree is independent of the number of records.
Which of the following is correct?B-trees are for storing data on disk and B$^+$ trees are for main memory.Range queries are faster on B$^+$ trees.B-trees are for primary...
Kathleen
14.3k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
b-tree
normal
+
–
46
votes
5
answers
6
GATE IT 2007 | Question: 84
Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links. Keys $K15$ and then $K25$ are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions? $1$ $2$ $3$ $4$
Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links.Keys $K15$ and then $K25$ are inserted into this tree in that order....
Ishrat Jahan
16.0k
views
Ishrat Jahan
asked
Oct 30, 2014
Databases
gateit-2007
databases
b-tree
normal
+
–
44
votes
6
answers
7
GATE CSE 2007 | Question: 63, ISRO2016-59
The order of a leaf node in a $B^+$ - tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1K\;\text{bytes}$, data record pointer is $7\;\text{bytes}$ long, the value field is $9\;\text{bytes}$ long and a block pointer is $6 \;\text{bytes}$ long, what is the order of the leaf node? $63$ $64$ $67$ $68$
The order of a leaf node in a $B^+$ - tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1K\;\text{bytes}$, data ...
Kathleen
23.2k
views
Kathleen
asked
Sep 21, 2014
Databases
gatecse-2007
databases
b-tree
normal
isro2016
+
–
6
votes
3
answers
8
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 14
A B-Tree of order $m$ is an $m$-way search tree. What is the minimum number of keys that can be stored on the leaf level of a B-Tree of order 20 with 3 levels? (Note: the root of a tree counts as its first level)
A B-Tree of order $m$ is an $m$-way search tree. What is the minimum number of keys that can be stored on the leaf level of a B-Tree of order 20 with 3 levels? (Note: th...
GO Classes
610
views
GO Classes
asked
Feb 5
Databases
goclasses2024-mockgate-14
numerical-answers
databases
b-tree
1-mark
+
–
66
votes
8
answers
9
GATE IT 2005 | Question: 23, ISRO2017-67
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are $5$ $4$ $3$ $2$
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes tha...
Ishrat Jahan
18.5k
views
Ishrat Jahan
asked
Nov 3, 2014
Databases
gateit-2005
databases
b-tree
normal
isro2017
+
–
3
votes
1
answer
10
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 32
The order of a leaf node in a $\text{B tree}$ is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1 \mathrm{~K}$ bytes, data record pointer is $7$ bytes long, the value field is $9$ bytes long and a block pointer is $6$ bytes long, what is the order of the leaf node?
The order of a leaf node in a $\text{B tree}$ is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1 \mathrm{~K}$ bytes,...
GO Classes
414
views
GO Classes
asked
Jan 28
Databases
goclasses2024-mockgate-13
goclasses
numerical-answers
databases
b-tree
1-mark
+
–
0
votes
0
answers
11
Memory Based GATE DA 2024 | Question: 58
DBMS question: One SQL query is given. Based on the query which data structure can be used involving hashing, B+ tree, etc?
DBMS question: One SQL query is given. Based on the query which data structure can be used involving hashing, B+ tree, etc?
GO Classes
112
views
GO Classes
asked
Feb 4
Databases
gate2024-da-memory-based
goclasses
databases
sql
b-tree
+
–
0
votes
1
answer
12
Ace Test Series | DBMS | B+ Trees
Consider the following description: To construct the B+ tree use the following values. Consider the database block size as 512 bytes, block pointer as 6 bytes, record pointer as 7 bytes and search key value as 9 bytes. What will be the number of data entries possible in level 2 of the B+ tree, if fill factor of the node is 0.8? 17,954 16,954 18,954 19,954
Consider the following description:To construct the B+ tree use the following values. Consider the database block size as 512 bytes, block pointer as 6 bytes, record poin...
none30
362
views
none30
asked
Sep 6, 2023
Databases
ace-test-series
databases
b-tree
+
–
0
votes
1
answer
13
Database system concepts by abraham silberschatz #14th chapter
is it allowed in a B+ tree, while deletion to leave behind a key in internal nodes while deleting it from the leaf ?
is it allowed in a B+ tree, while deletion to leave behind a key in internal nodes while deleting it from the leaf ?
phaniphani
176
views
phaniphani
asked
Nov 16, 2023
Databases
self-doubt
b-tree
databases
+
–
42
votes
6
answers
14
GATE CSE 2002 | Question: 2.23, UGCNET-June2012-II: 26
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512$ bytes, and index pointers are of size $4$ bytes. Given the scenario, what ... of the degree (i.e. number of pointers per node) of the $B^+$ - tree? $16$ $42$ $43$ $44$
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512...
Kathleen
14.0k
views
Kathleen
asked
Sep 15, 2014
Databases
gatecse-2002
databases
b-tree
normal
ugcnetcse-june2012-paper2
+
–
42
votes
5
answers
15
GATE CSE 1997 | Question: 19
A $B^+$ - tree of order $d$ is a tree in which each internal node has between $d$ and $2 d$ key values. An internal node with $M$ key values has $M + 1$ children. The root (if it is an internal node) has between $1$ and $2d$ key values. The distance ... $4$ with $52$ leaves? What is the minimum number of leaves in a $B^+$-tree of order $d$ and height $h(h\geq 1)$?
A $B^+$ - tree of order $d$ is a tree in which each internal node has between $d$ and $2 d$ key values. An internal node with $M$ key values has $M + 1$ children. The roo...
Kathleen
14.8k
views
Kathleen
asked
Sep 29, 2014
Databases
gate1997
databases
b-tree
normal
descriptive
+
–
51
votes
4
answers
16
GATE CSE 2015 Set 3 | Question: 46
Consider a B+ tree in which the search key is $12$ $\text{bytes}$ long, block size is $1024$ $\text{bytes}$, record pointer is $10$ $\text{bytes}$ long and the block pointer is $8$ $\text{bytes}$ long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is ______.
Consider a B+ tree in which the search key is $12$ $\text{bytes}$ long, block size is $1024$ $\text{bytes}$, record pointer is $10$ $\text{bytes}$ long and the block poin...
go_editor
21.2k
views
go_editor
asked
Feb 15, 2015
Databases
gatecse-2015-set3
databases
b-tree
normal
numerical-answers
+
–
18
votes
3
answers
17
GATE CSE 2019 | Question: 14
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table? B+ Tree is a height-balanced tree Non-leaf nodes have pointers to data records Key values in each node are kept in sorted order Each leaf node has a pointer to the next leaf node
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?B+ Tree is a height-balanc...
Arjun
10.4k
views
Arjun
asked
Feb 7, 2019
Databases
gatecse-2019
databases
b-tree
1-mark
+
–
0
votes
0
answers
18
TestBook TestSeries question to find max child possible in B+ Tree
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes which can be used to store all the keys? A. 17 B. 19 C. 59 D. 57
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes whic...
Sahil_Lather
490
views
Sahil_Lather
asked
Jan 29, 2023
Databases
b-tree
testbook-test-series
databases
+
–
0
votes
0
answers
19
Unacademy AIMT -1
the answer is 28
the answer is 28
TusharKumar
592
views
TusharKumar
asked
Dec 23, 2022
Databases
databases
b-tree
unacademy-test-series
+
–
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