Suppose these names have the following hash values.Each leaf can only hold 4 entries.Insert them into the extendible hashtable shown below.Note that the first two nameshave already been inserted.Illustrate each operation that occurs.Bob0100Sue1000Tim1110Ron0010Ann1010Jan1101Ben0001Don0101Tom1111Sam1011(1)(1)Bob 0100Sue 1000

Given data: Considering that the extreme leaf bit is either 0 or 1. So, placing the records,…

Answered: Suppose these names have the following…

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

Insert the following keys: 19, 50, 89, 39 into the given table using Double Hashing - Size of a Hash Table is 5 Note: let n = 3, and the second hash functions have the following formula: g(k) = n – (k % n) Index 1 2 3 4 Number Key Value (k) No of Collisions Total No of Collisions
Q20. In the open addressing solution to the collision problem in the following hash table, the value 40 is stored in the index PARERINGS 13 O 1 * 5 6 12 0 45 1 2 3 77 19 LO 6 7 22 8 9 10 11 12 13 14 84 70 56 28 59
- In class HashTable implement a hash table and consider the following:(i) Keys are integers (therefore also negative!) and should be stored in the tableint[] data.(ii) As a hash function take h(x) = (x · 701) mod 2000. The size of the table istherefore 2000. Be careful when computing the index of a negative key. Forexample, the index of the key x = −10 ish(−10) = (−7010) mod 2000 = (2000(−4) + 990) mod 2000 = 990.Hence, indices should be non-negative integers between 0 and 1999!(iii) Implement insert, which takes an integer and inserts it into a table. Themethod returns true, if the insertion is successful. If an element is already inthe table, the function insert should return false.(iv) Implement search, which takes an integer and finds it in the table. The methodreturns true, if the search is successful and false otherwise.(v) Implement delete, which takes an integer and deletes it form the table. Themethod returns true, if the deletion is successful and false otherwise.(vi)…
valsTable: o Empty-since-start 1 Empty-after-removal Occupied Hash table valsTable uses double probing with the hash functions hash1(key): key % 11 hash2(key): 5 - key % 5 and a table size of 11. 15 5 27 6. 7 HashInsert(valsTable, item 70) inserts item 70 into bucket Ex: 10 8 9 Hashlnsert(valsTable, item 62) inserts item 62 into bucket 10 Hashlnsert(valsTable, item 59) inserts item 59 into bucket 2. 3.
5. Here are keys and their hash values, for hashing using h(k)= k mod m Where m = 13 130 108 K H(K) 9 0 4 Use double hashing to resolve the collision with h2(k)= 10 - (k mod 10) Construct the hash table 100 78 0 35 9
Please type your solution below for the question. d. Suppose the hash tables in the two bridges B1 and B2 are all updated.
4. In the extensible hash index (each bucket can hold at most 2 items) below, if we want to insert 19, what will be the structure of the hash index after the insertion? 16 20 A h(1) = 00001 h(2) = 00010 h(3) = 00011 h(7) = 00111 h(16) = 10000 h(18) = 10010 h(19) = 10011 h(20) = 10100 00 01 1 B 10 11 Directory 3 D %3D Buckets 5. Assuming that the node capacity of B*-trees is 4, please draw the updated B*- trees upon insertions. L 5(a). Insert tuples with key 23* into the following B*-tree. Root 14 19 24 33 2* 3* 5* 7* 14* 16* 19* 20* 22* 24*| 27* 29* 33* 34* 38* | 39*
Trace Linear Probing with My Data A The hash table is size 7 and uses open addressing and linear probing. The hash function is hashCode(phone number) = last four digits % table size 555-1432 VoterA 555-6135 VoterB 555-2747 VoterC 555-6118 VoterD 555-5733 VoterE 555-4722 VoterF 555-7523 VoterG Show the hashCode of each Voter. Show the table after inserting the above voters in the listed order. Assume you want to retrieve each voter. How many seeks does it take to find each voter? How many seeks would it take to know that 555-5357 VoterH is not in the table? What does the table look like if you remove VoterF? Now how many seeks does it take to know that 555-5357 VoterH is not in the table? How many seeks does it take to retrieve voter G?
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.]

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS