144k views
0 votes
The system will support range queries, when stored on disk, working on a static database (no inserts or deletes).

a. Binary Search Tree (assume that it is balanced)
b. Closed Hash Table
c. Linear Index
d. B+ Tree

1 Answer

4 votes

Final answer:

The B+ Tree is the best system for supporting range queries on a static database stored on disk.

Step-by-step explanation:

The system that will work best for supporting range queries on a static database stored on disk is the B+ Tree.

A B+ Tree is a type of self-balancing search tree that maintains sorted data and allows efficient range queries. It is commonly used in database systems because it minimizes disk access and performs well for large databases.

Unlike other options like Binary Search Tree or Closed Hash Table, a B+ Tree is specifically designed for disk storage and can handle a large number of records efficiently.

\

User Yolie
by
8.7k points