Periodic reorganization of a file as it becomes too full is necessary for both static hashing and Btree file structures.

Name: Periodic reorganization of a file as it becomes too full is necessary for both static hashing and Btree file structures.
Brand: Quizplus
Rating: 4.8 (39 reviews)

Question

Quizplus · Accepted Answer

In static hashing, the hash table size is fixed and reorganization is needed when it becomes too full, but B-tree file structures automatically adjust their shape and size as entries are added or removed, eliminating the need for periodic reorganization.

Periodic Reorganization of a File as It Becomes Too Full