engineering computer science MCQ #842

Which indexing technique is suitable for queries with range conditions?

engineering computer science MCQ #842

  1. Question 1

    Q1. Which indexing technique is suitable for queries with range conditions?

    • A) B-tree indexing
    • B) Hash indexing
    • C) Full-text indexing
    • D) Bitmap indexing

    Answer: B-tree indexing

    Explanation: B-tree indexing is suitable for range queries as it allows for efficient retrieval of data within a range.