Question
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?
More IT DBMS Questions
- Under READ COMMITTED isolation, Transaction T1 executes a query 'SELECT * FROM Accounts WHERE balance > 50000' and gets 5 rows. Before T1 re-executes the i...
- In an Object-Oriented program, which control flow construct is primarily used to handle unexpected events or errors that occur during program execution, su...
- Which of the following is a weak entity in a database?
- What is the purpose of 'indexing' in a database?
- A transaction T1 updates a row and then waits for a lock held by T2. T2 is waiting for a lock held by T1. What condition has occurred?
- You have a Python list of fruits and want to extract a specific sub-list using slicing. Complete the missing part of the code to obtain the sub-list `['b...
- Which join should be used when you want to list all customers and any orders they may have placed, including customers who haven’t placed any orders?
- In a relational schema, which normal form eliminates transitive dependencies (i.e., non-prime attribute depends on another non-prime attribute)?
- Which of the following is a type of database index?
- MVCC (Multi-Version Concurrency Control) ensures:
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)