Multiple Choice
Which of the following is true regarding indexed sequential files and B+-trees?
A) A B+-tree indexed file is an indexed sequential file.
B) A B+-tree indexed file can never be an indexed sequential file.
C) Only a file with a simple linear index can be an indexed sequential file.
D) All indexed files are indexed-sequential files.
E) An indexed sequential file requires a hashing algorithm.
Correct Answer:
Verified
Correct Answer:
Verified
Q77: Every record insertion in a B+-tree indexed
Q78: The dispersal of data on a disk
Q79: The cylinder concept exists because access arm
Q80: The average rotational delay is one-half of
Q81: A hashed file cannot also have indexes
Q83: Transfer time is the time it takes
Q84: In terms of time, rotational delay in
Q85: All of the following are factors affecting
Q86: A new primary key attribute can be
Q87: A fixed disk has 100 cylinders. The