GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2026 · session-8
Database Management and WarehousingIndexingmediumNAT1 mark
In a relational database, a B+ Tree Index is to be constructed for a relation on a key field. In a B+ Tree, a Node Pointer points to a sub-tree and a Data Record Pointer points to a block of database records. Let, Node size = 4096 bytes, Node Pointer size = 10 bytes, Search Key Field size = 11 bytes and Data Record Pointer size = 12 bytes. The maximum number of Node Pointers that can be present in a non-leaf node of the B+ Tree is __________. (Answer in integer)
Save your progress

Related Database Management and Warehousing PYQs

GATE 2026 · session-8

Let \(R(A,B,C,D,E)\) be a relational schema with functional dependency set \(F = \{A \rightarrow BC,\ CD \rightarrow E,\ E \righta…

GATE 2026 · session-8

Consider that the visualization of a 3-dimensional data cube is showing Sales Quantity for each combination of the attributes Prod…

GATE 2026 · session-8

Consider two relations \(r\) and \(s\) defined on the relational schemas \(R(A,B)\) and \(S(E,C)\), respectively. \(A\) is the pri…

GATE 2026 · session-8

Consider a B+ Tree where the maximum number of key values in each leaf node is 2 and the maximum number of pointers in each non-le…

GATE 2026 · session-8

Consider the given relations \(X\), \(Y\) and \(Z\). The relation \(X\) has three columns P, Q and R. The relation \(Y\) has three…

GATE 2026 · session-8

Consider the concept hierarchies as shown in the figure. Which of the following options denotes the total number of possible data…