Q1hard
Why do modern RDBMS (like MySQL and SQL Server) utilize B+ Trees instead of standard B-Trees for disk-based indexing?
Back to Database Management Systems
15 Questions Total
Indexing & File Organization MCQs
Topic-wise practice questions for Database Management Systems. Test your knowledge, check solutions on demand, and pace your preparation.
Zero-leak answer engine • Rate-limited explanations
Practice in Timed ModeQ2easy
What is the primary disadvantage of Static Hashing in a growing database?
Q3medium
If a B+ Tree index has a height of 3 (Root, 1 Intermediate level, 1 Leaf level) and the table is NOT clustered, how many I/O operations are required to retrieve a single row using this index?
Q4medium
(Debugging/Analysis) A developer notices that their index on hire_date is not being used in the following query. What is the cause?
Q5easy
What is the main difference between a Dense Index and a Sparse Index?
Q6medium
A "User Analytics" table has a membership_type column with only 3 possible values: 'Free', 'Silver', 'Gold'. Most queries aggregate data based on this column. Which index type is specifically designed for such "Low-Cardinality" data?
Q7hard
A database block is 4KB (4096 bytes). An index entry consists of a 4-byte integer key and an 8-byte child pointer. Ignoring header overhead, what is the maximum fan-out (number of children) of an internal node in this B+ Tree?
Q8hard
An e-commerce platform's "Product Search" is slow when users filter by "Category" and "Price". The DBA creates a single index on (category, price). Now, searches for WHERE category = 'Toys' are fast, but searches for WHERE price = 50.00 are still slow. Why?
Q9easy
In indexing theory, what does "Index Selective" refer to?
Q10hard
Why is it often recommended to use a Surrogate Key (like an Auto-
incrementing Integer) as a Clustered Index rather than a natural key (like a UUID or Name)?
sql-shell - optimization
CREATE INDEX idx_report
ON sales(sale_date, region)
INCLUDE (total_amount);