1. Which of the following is NOT true of Hash Indexes ? A. The hashed value give
ID: 3554201 • Letter: 1
Question
1. Which of the following is NOT true of Hash Indexes ?
A. The hashed value gives the ID or location of the bucket.
B. The hashed value gives the ID or location of the overflow bucket.
C. Each bucket store the data entries which have the same hash value.
D. Assuming a good hashing function, a constant number of pages need to be retrieved to obtain the data entry for a key value k.
2. Which of the following is NOT true of B+ Tree Indexes ?
A. Non-leaf nodes are called index entries.
B. Leaf nodes store the data entries and are doubly-linked.
C. The tree is balanced.
D. Non-leaf nodes also store RIDs.
3. Why are overflow buckets required in hash indexes?
A. There may be a large number of data entries hashing to the same bucket and one bucket may not be able to hold all of them.
B. Overflow buckets are needed as temporary storage for insertions.
C. Overflow buckets are where the deleted tuples are stored.
D. Overflow buckets are NOT needed.
Explanation / Answer
1
b
The hashed value stores the starting location of a bucket.
2
c
Unlike other self balancing trees, the b+ tree can have more than two child nodes.
3
a
Overflow buckets usually store the the data that does not have enough pre defined space.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.