Practice mode DBMS and SQL

A column has a hash index and a B-tree index available. Which query condition can use the B-tree index but not the hash index?

Correct answer B. WHERE salary BETWEEN 3000 AND 5000

Explanation

A hash index scatters keys by their hash values, so it can only answer equality lookups. A B-tree keeps keys in sorted order, so it also supports range conditions such as , <= and BETWEEN, as well as ORDER BY. The three equality conditions could use either index; the BETWEEN range needs ordered keys, which only the B-tree provides.

Report a problem

Answer checked 12 October 2026 How we write and check questions

Tip: press A, B, C or D to answer, and N for the next question.

A column has a hash index and a B-tree index available. Which query condition can use the B-tree index but not the hash index?

Discussion

Have a question about this answer? Cancel reply

A column has a hash index and a B-tree index available. Which query condition can use the B-tree index but not the hash index?

More DBMS and SQL questions

In table OrderItem(order_id, product_id, quantity), neither order_id nor product_id is unique alone, so the primary key is declared as (order_id, product_id). What is such a key called?

Table Student(roll_no, cnic, email, name) has roll_no, cnic and email each unique and never NULL. If roll_no is chosen as the primary key, what are cnic and email called?

In a B+ tree index, where are the pointers to actual data records (or the records themselves) stored?

Which integrity rule states that no attribute of a primary key may contain NULL?

Discussion

Have a question about this answer? Cancel reply