Question

The system will perform exact mach queries only, when stored on disk, working on a dynamic database (supports inserts and deletes).

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

Answer 1

The B+ Tree is the most suitable data structure for performing exact match queries on a dynamic database stored on disk.

Step-by-step explanation:

The B+ Tree is the most suitable data structure for performing exact match queries on a dynamic database stored on disk. Unlike a binary search tree and closed hash table, a B+ Tree can efficiently handle inserts and deletes without requiring major reorganizations of the data. This is because B+ Trees are designed to minimize disk I/O operations by maximizing the number of elements that can be stored in each disk block.