Question
A relational database management system needs to store millions of employee records on disk and support fast search, insertion, deletion, and range queries. Which data structure is most suitable as the underlying index structure?
More IT DBMS Questions
- Which of the following is NOT a common type of error encountered during software development?
- In indexing, which tree is most commonly used for disk-based indexing because it minimizes disk seeks and keeps nodes dense?
- Transaction T1 holds a lock on Row A and requests a lock on Row B. Transaction T2 holds a lock on Row B and requests a lock on Row A. Both use strict Two-P...
- Which of the following is true about ACID properties in DBMS?
- Which B+ tree characteristic is particularly useful for a range query such as salary BETWEEN 50000 AND 70000?
- Given a table Orders(OrderID, CustomerID, Amount), which SQL statement correctly returns the CustomerID of every customer who has placed more than 3 orders...
- Consider a scenario in an OOP application where a `NullPointerException` (or equivalent) occurs when trying to access a member of an object. What is the mo...
- Indexing in DBMS improves:
- During transaction before commit which of the following statements is done automatically in case of shutdown?
- Which of the following is a property of a relational database?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)