Hello, dear friend, you can consult us at any time if you have any questions, add WeChat: THEend8_
COMP 418 Assignment 1
Part 1. Concepts and principles
Question 1
a. Briefly explain the three main alternatives for storing information in a data entry of an index.
b. Define clustered index, and discuss the relation between the three alternatives and clustered/unclustered indexes.
Question 2
Consider the following file organizations: sorted files, heap files with an unclustered tree index on the search key, and heap files with an unclustered hash index. Briefly discuss the suitability of each of these file organizations to perform the following operations: file scans, range selections, inserts, and deletes.
Question 3
a. Briefly describe the two internal organizations for heap files (using lists versus directory of pages).
b. Explain which organization you would choose if records are variable in length.
Question 4
Compare ISAM and B+ Tree indexes. Explain briefly their differences in handling Search, Insert and Delete, and discuss when you would use ISAM and when you would use B+ Tree index.
Question 5
Does the final structure of a B+ tree depend on the order in which the terms are added to it? Explain your answer using an illustration example.
Question 6
Explain how extendible hashing uses a directory of buckets, and discuss the global depth of the index and local depth of a bucket.
Part 2. Design considerations for application scenarios