Computer Science · Database Management Systems
रिलेशनल डेटाबेस में रेंज-आधारित प्रश्नों (range-based queries) को संभालने के लिए कौन सी इंडेक्सिंग संरचना सबसे कुशल और व्यापक रूप से उपयोग की जाती है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1लीनियर इंडेक्स (Linear index)
- 2बी-ट्री / बी+ ट्री इंडेक्स (B-tree / B+ tree index)✓
- 3बिटमैप इंडेक्स (Bitmap index)
- 4हैश इंडेक्स (Hash index)
सही उत्तर देखें
बी-ट्री / बी+ ट्री इंडेक्स (B-tree / B+ tree index)
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