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
- What does the ‘’ element in HTML5 allow you to do?
- A relation Employee(EmpID, Skill, Language) records that an employee can have multiple independent skills and can speak multiple independent languages, wit...
- A relation R(A,B,C,D) has functional dependencies A→B and B→C. Which statement follows?
- Which normal form ensures a table has no transitive dependency between its non-key attributes?
- Which of the following illustrates an advantage of DBMS over traditional file systems?
- A transaction either executes all of its operations completely, or none of its operations take effect at all, leaving the database unchanged if any part of...
- Which key, selected from among the candidate keys of a table, is used to uniquely identify each record and is automatically enforced by the DBMS to disallo...
- A company needs to schedule a maximum number of meetings in a single conference room. Each meeting `i` has a start time `s_i` and an finish time `f_i`. Onc...
- A B-tree index has an order of 100 (up to 100 children per node) and stores 1,000,000 records. Approximately what is the height of this B-tree?
- Which type of relationship exists when a record in one table can relate to multiple records in another table, and vice versa?
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)