Question:
Which among the following is a multilevel indexing technique?
Which among the following is a multilevel indexing technique?
Show Hint
B-Tree and B+ Tree are classical multilevel indexing structures used in DBMS.
Updated On: Jun 25, 2026
- B+ tree
- Linear probing
- Linear hashing
- Extendible hashing
Show Solution
Verified By Collegedunia
The Correct Option is A
Solution and Explanation
Concept:
Multilevel indexing reduces the number of disk accesses required to locate records in large databases.
The most common multilevel indexing structure is the B+ Tree.
Step 1: Understand B+ Trees.
A B+ Tree stores index entries in multiple levels. The root points to internal nodes. Internal nodes point to lower-level nodes. Leaf nodes contain search keys and record pointers.
Step 2: Advantages of B+ Trees.
• Balanced structure
• Efficient search
• Efficient insertion and deletion
• Reduced disk I/O
Step 3: Analyze other options.
Linear probing, linear hashing and extendible hashing are hashing techniques rather than multilevel indexing techniques.
Step 4: Select the answer.
\[ \boxed{\text{B+ Tree}} \] is the multilevel indexing technique.
Step 1: Understand B+ Trees.
A B+ Tree stores index entries in multiple levels. The root points to internal nodes. Internal nodes point to lower-level nodes. Leaf nodes contain search keys and record pointers.
Step 2: Advantages of B+ Trees.
• Balanced structure
• Efficient search
• Efficient insertion and deletion
• Reduced disk I/O
Step 3: Analyze other options.
Linear probing, linear hashing and extendible hashing are hashing techniques rather than multilevel indexing techniques.
Step 4: Select the answer.
\[ \boxed{\text{B+ Tree}} \] is the multilevel indexing technique.
Was this answer helpful?
0
0
Top TS PGECET Computer Science & Information Technology Questions
- The transition a pushdown automation made by is additionally dependent upon
- Moore machine is an example of
- For a machine to surpass all the letters of alphabets excluding vowels, how many states in DFA would be required?
- A language $L$ is said to be Turing machine (TM) decidable if
- A Turing machine that is able to simulate other Turing machines is known as
View More Questions
Top TS PGECET Database Management Systems Questions
- What is normalization in database design?
- What is a primary key in a relational database?
- Which DBMS component handles disk space allocation?
- What is the notation for class hierarchies in ER diagrams?
- Which normal form is based on the concept of multivalued dependency?
View More Questions
Top TS PGECET Questions
- If \( P = \begin{pmatrix} 1 & 1 & 1 \\ 0 & 1 & 2 \\ 0 & 0 & 1 \end{pmatrix} \) is the modal matrix of \( A = \begin{pmatrix} 1 & 1 & 0 \\ 0 & 2 & 2 \\ 0 & 0 & 3 \end{pmatrix} \) then the sum of all the elements of \( P^{-1}AP \) is
- If the system of equations \( kx + y + z = k - 1 \), \( x + ky + z = k - 1 \), and \( x + y + kz = k - 1 \) has infinite solutions, then \( k \) is
- The value of the integral \( \int_C (2xy - x^2) \, dx + (x^2 + y^2) \, dy \) where \( C \) is the boundary of the region enclosed by \( y = x^2 \) and \( y^2 = x \), described in the positive sense, is
- Let \( f(x) = \log x \). The number \( C \) strictly between \( e^2 \) and \( e^3 \) such that its reciprocal is equal to \( \frac{f(e^3) - f(e^2)}{e^3 - e^2} \) is
- The solution of the differential equation \( (D^2 + 2)y = x^2 \) is
View More Questions