hw2 Sols

C ARNEGIE M ELLON U NIVERSITY
C OMPUTER S CIENCE D EPARTMENT

15-445/645 – DATABASE S YSTEMS (FALL 2019)
P ROF. A NDY PAVLO
Homework #2 (by Amadou Ngom) – Solutions

Due: Monday Sept 30, 2019 @ 11:59pm
IMPORTANT:
• Upload this PDF with your answers to Gradescope by 11:59pm on Monday Sept 30,
2019.
• Plagiarism: Homework may be discussed with other students, but all homework is to be
completed individually.
• You have to use this PDF for all of your answers.
For your information:
• Graded out of 100 points; 4 questions total
• Rough time estimate: ≈1-4 hours (0.5-1 hours for each question)
Revision : 2019/10/10 13:09
Question Points Score

Cuckoo Hashing 20
B+Tree 45
Extendible Hashing 25
Suffix Trees 10
Total: 100
Number of Days this Assignment is Late:
Number of Late Day You Have Left:
1
15-445/645 (Fall 2019) Homework #2 Page 2 of 8
Question 1: Cuckoo Hashing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [20 points]

Graded by:
Consider the following cuckoo hashing schema:
1. Both tables have a size of 4.

2. The hashing function of the first table returns the lowest two bits: h1 (x) = x & 0b11.
3. The hashing function of the second table returns the next two bits: h2 (x) = (x >> 2) & 0b11
4. When replacement is necessary, first select an element in the second table.
5. The original content is shown in Figure 1.
Figure 1: Initial contents of the hash tables.
Use the following template to answer the questions: https://cmudb.io/fall2019-hw1.

(a) [4 points] Insert keys 12 and 10. Draw the resulting two tables.
(b) [4 points] Then delete 14, and insert 8. Draw the resulting two tables.
(c) [6 points] Finally, insert 28. Draw the resulting two tables.
(d) [6 points] What is the smallest key that potentially causes an infinite loop given the
tables in (c)
2 0 2 2 2 5 6 2 7 2 9 2 None of the above
Solution: a)
Question 1 continues. . .
b)
c)
Homework #2 continues. . .
Question 2: B+Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [45 points]

Graded by:
Consider the following B+tree.
Figure 2: B+ Tree of order d = 4 and height h = 2.
When answering the following questions, be sure to follow the procedures described in class
and in your textbook. You can make the following assumptions:
• A left pointer in an internal node guides towards keys < than its corresponding key, while
a right pointer guides towards keys ≥.
• A leaf node underflows when the number of keys goes bellow d d−1 2
e.
• An internal node underflows when the number of pointers goes below d d2 e.
Use the following draw.io template for your answers:
https://cmudb.io/fall2019-hw2
(a) [15 points] Insert 10∗ into the B+tree. Draw the resulting tree.
(b) [5 points] How many pointers (parent-to-child and sibling-to-sibling) do you chase to
find all keys between 5 and 15?
2 2 2 3 4 2 5 2 6 2 7
(c) [15 points] Then delete 23∗ . Draw the resulting tree.
(d) [10 points] Finally insert 4∗ and delete 11∗ . Draw the resulting tree.
Solution: a)
b)
c)
Question 3: Extendible Hashing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [25 points]

Graded by:
Consider an extendible hashing structure such that:
• Each bucket can hold up to two records.
• The hashing function uses the lowest g bits, where g is the global depth.
(a) Starting from an empty table, insert keys 15, 3, 7, 14.
i. [3 points] What is the global depth of the resulting table?
2 0 2 1 2 2 3 2 4 2 None of the above
ii. [3 points] What is the local depth the bucket containing 14?
2 0 1 2 2 2 3 2 4 2 None of the above
iii. [3 points] What is the local depth of the bucket containing 3?
2 0 2 1 2 2 3 2 4 2 None of the above
(b) Starting from the result in (a), you insert keys 1, 9, 23, 11, 17.
i. [4 points] Which key will first cause a split (without doubling the size of the table)?
2 1 2 9 2 23 2 11 17 2 None of the above
ii. [4 points] Which key will first make the table double in size?
2 1 2 9 23 2 11 2 17 2 None of the above
(c) Now consider the table below, along with the following deletion rules:
1. If two buckets have the same local depth d, and share the first d − 1 bits of their
indexes (e.g. 010 and 110 share the first 2 bits), then they can be merged if the total
capacity fits in a single bucket. The resulting local depth is d − 1.
2. If the global depth g becomes strictly greater than all local depths, then the table can
be halved in size. The resulting global depth is g − 1.
Figure 3: Extendible Hash Table along with the indexes of each bucket
Starting from the table above, delete keys 2, 7, 13, 15, 29.
i. [4 points] Which deletion first causes a reduction in a local depth.
2 2 2 7 13 2 15 2 29 2 None of the above
ii. [4 points] Which deletion first causes a reduction in global depth.
2 2 2 7 13 2 15 2 29 2 None of the above
Question 4: Suffix Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [10 points]

Graded by:
Consider the following suffix tree for unsigned 32-bit integers.
Figure 4: Suffix Tree
(a) [3 points] Which of the following elements belong to the suffix tree. Select all that ap-
ply.
2 0x45BD0000 2 0x0000CAAC 2 0xFFAAAA00 2 0xACCA0000 2 0xBD000000
None of the above
(b) [7 points] Insert the key 0x00FFAABB. Draw the resulting tree using this template: https:
//cmudb.io/fall2019-hw4.
Solution: b)
End of Homework #2

hw2 Sols

Uploaded by

Copyright:

Available Formats

hw2 Sols

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

hw2 Sols

Uploaded by

Copyright:

Available Formats

C ARNEGIE M ELLON U NIVERSITY

C OMPUTER S CIENCE D EPARTMENT

Homework #2 (by Amadou Ngom) – Solutions

Question Points Score

Number of Days this Assignment is Late:

Number of Late Day You Have Left:

Question 1: Cuckoo Hashing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [20 points]

1. Both tables have a size of 4.

Figure 1: Initial contents of the hash tables.

Use the following template to answer the questions: https://cmudb.io/fall2019-hw1.

Question 2: B+Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [45 points]

Figure 2: B+ Tree of order d = 4 and height h = 2.

Question 3: Extendible Hashing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [25 points]

Question 4: Suffix Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [10 points]

Figure 4: Suffix Tree

You might also like