Computer Science · Database Management Systems
From a performance perspective, why are hash indexes typically avoided on columns that frequently undergo range-based filtering?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1They consume excessive memory overhead compared to B-trees.
- 2They do not maintain data keys in a sorted order.✓
- 3They significantly increase write transaction conflicts.
- 4They always force the optimizer to perform full table scans.
Correct answer
They do not maintain data keys in a sorted order.
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Database Management Systems MCQs →Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems