Consider the Extendible Hashing index shown in figure below. A bucket is split each time an overflow page gets created h(1) h(0) 000 001 010 011 100 00 01 10 11 00 Next=2 Level = 1 N=4 8 16 32 64 1 10 18 22 3 7 11 15 28 60 76 13 29 61 101 01 Show the state of the index after each operation: a) Insertion of entry 2 b) Insertion of entry 40 c) Insertion of entry 39

Consider the Extendible Hashing index shown in figure below. A bucket is split each time an overflow page gets created h(1) h(0) 000 001 010 011 100 00 01 10 11 00 Next=2 Level = 1 N=4 8 16 32 64 1 10 18 22 3 7 11 15 28 60 76 13 29 61 101 01 Show the state of the index after each operation: a) Insertion of entry 2 b) Insertion of entry 40 c) Insertion of entry 39

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Show the state of the index after each operation:a) Insertion of entry 2b) Insertion of entry 40c) Insertion of entry 39
Show the state of the index after each operation:a) Insertion of entry 1b) Insertion of entry 23c) Deletion of entry 30
Extendible hash index:Consider the Extendible Hashing index shown in figure below: Show the state of the index after each operation:a) Insertion of entry 1b) Insertion of entry 23c) Deletion of entry 30 draw the figures separately for a, b and c
Assume a hash table utilizes an array of 13 elements and that collisions are handled by separate chaining. Considering the hash function is defined as: h(k)=k mod 13. i) Draw the contents of the table after inserting elements with the following keys: 36, 243, 261, 180, 217, 180, 21, 16, 182, 202, 91, 97, 166, 78, 33, 70, 51, 58.
Extendible hash index:Consider the Extendible Hashing index shown in figure below: Show the state of the index after each operation:a) Insertion of entry 1b) Insertion of entry 23c) Deletion of entry 30
Draw the contents of the hash table given the following conditions: The size of the hash table is 25. • Linear Probing is used to resolve collisions. • The hash function H(k) should be calculated in the following way where k is the element to be hashed: R(k) = k mod (summation of last two digits of your student id + 7) If R(k)<10 H(k)=R(k) + 8 else H(k)=R(k) - 4 What values will be in the hash table after the following sequence of insertions? 55, 65, 8, 18, 20, 11, 56, 27, 15, 167 [Note: Draw the values using a hash table and show your work for partial credit.]
2-A linear probing hash table of length 10 uses the hash function h(x) = x mod 10 + 1. mod is the reminder opertatro. For example the h(42) = 42 mod 10 + 1 = 2 + 1 = 3 so we insert 42 in t he position 3 in the array. After inserting 6 integer keys into an initially empty hash table, the array of keys is 1 2 3 4 5 7 8 9. 42 23 34 52 46 33 a- insert the key 35 b- insert the key 12 c- insert the key 10
Consider the following scenario/assumptions: . A hash table can store at most 11 elements. Indices are numbered from 0 to 10. It is currently empty (no elements yet). • The hashing function is defined as H(k) = k % 11 . The collision resolution technique is Linear Probing. Insert the following keys in the hash table in the sequence that they appear below: • 172458 • 282459 • 392458 • 502461 • 612458 • 722463 832458 • 942465 1052458 • 1162467 Write on a piece of paper the contents of the resulting has table after inserting these keys. The table should contain 10 elements, with only one address that is left open, i.e., it is not occupied by any key. Answer the questions below by filling up the blanks, 1. What is the address (array index) of the memory space that is still open? 2. What is H(722463)? 3. In which address (array index) was key 832458 stored? 4. Which key value was stored in address (array index) 8? 5. The value of H(k) is called k's home address. How many keys were not…
3. Double hashing is one of the methods to resolve collision. Write a function to implement this method. The equations used in this method are given below. Note: implement everything within the double hash function. P = (P + INCREMENT(Key)) mod TABLE_SIZE INCREMENT(Key) = 1 + (Key mod INCR)
Task - 1: Write a java program to implement the following algorithms for Open Addressing techniques for Hash Table data structure. (Use a simple array of integers to store integer key values only). HASH-SEARCH(T, k) HASH-INSERT (T, k) i = 0 repeat j = h (k, i) if T[j] == NIL T[j] = k return j else i = i + 1 ● i = 0 repeat until i == m error “hash table overflow" For both algorithms, to compute the index j, write the following methods: getLinear ProbIndex (key, i) getQuadraticProbIndex ● get DoubleHash (key, i) (key, i) j = h (k, i) if T[j] == k return j i = i + 1 until T[j] == NIL or i = m return NIL Linear Probing index is computed using following hash function: h(k, i) = (h₁(k) + i) mod m h₁(k)= k mod m Quadratic probing index is computed using following hash function: h(k, i) = (h₁(k) + i²) mod m h₁(k)= k mod m Double hashing index is computed using following hash function: h(k, i) = (h₁(k) + i h₂(k)) mod m h₁(k)= k mod m h₂(k) = 1 + (k mod m - 1)
3. Given the following keys: 68, 39, 89, 28, 79 Take alpha = 0.6 Compute m (size of hash table), and select it to be a prime number. Now illustrate how you would construct the hash table. Use double hashing as collision resolving technique. The original hash function, is h(k)= k mod m The second hash function for double hashing, h₂(k)=8-(k mod 8)
hash table