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 true about the primary key in a relational database?
- A table Orders(order_id, customer_id, order_date, amount) needs a query that returns each order alongside a running cumulative total of that customer's ord...
- What is 'query optimization' in DBMS?
- In DBMS, what is the term for a logical, virtual table based on the result of a stored SQL query?
- A B+ tree index is built on an attribute used mainly for range queries. Why is a B+ tree generally preferable to a hash index for this workload?
- In a program that manages a collection of `Employee` objects, each with a `salary` attribute, which control flow mechanism would be most efficient to find ...
- A relation R(A, B, C, D, E) has the composite candidate key {A, B}, and the functional dependencies AB→C, AB→D, and AB→E hold. No other functional dependen...
- Which of the following is an example of a NoSQL database?
- A relation Student_Course(StudentID, CourseID, StudentName, CourseName) stores StudentName redundantly in every row for each course a given student takes. ...
- Which normal form ensures a table has no transitive dependency between its non-key attributes?
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)