Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
|
Question 397
|
Which of the following is preferred to organize very large indexed sequential access disk files for both interactive random access and co-sequential batch processing of its records?
|
Hashing
|
|
|
B-Trees
|
|
|
Simple Index
|
|
|
B+ Trees
|
Question 397 Explanation:
B-tree and B+ Tree are suitable to organize very large indexed sequential access disk files for interactive random access but since in B+ tree each leaf node have a pointer to its next leaf node then it makes the access of co-sequential batch processing of its records easier.
Correct Answer: D
Question 397 Explanation:
B-tree and B+ Tree are suitable to organize very large indexed sequential access disk files for interactive random access but since in B+ tree each leaf node have a pointer to its next leaf node then it makes the access of co-sequential batch processing of its records easier.