|
|
Hashing 1. 6.6Assume a relation with key attribute of type integer, and give examples of the following. (R11) a. A linear hashing index and an extensible hashing index with the same data entries, such that the linear hashing index has more pages. b. A linear hashing index and an extensible hashing index with the same data entries, such that the extensible hashing index has more pages. Specify what hashing function you have chosen. Draw appropriate diagrams. Remember to include the additional directory page for the extensible hashing index in the page count. 2. Consider the ”°llps”± graph in slide 155 of the lecture notes. a. What is a probe sequence? Where does it start and where does it end? b. Given your definition of a probe sequence, assume a uniform hash function h, and assume just one record per bucket.
|
