a) An extendable hashing index is given below. Present the state of the indexafter adding the keys 21, 25, and 29.DirectoryBuckets0*8* 12* 20*009* 13*33*01106*26* 42*117* 11* 15*23*b) Explain the concepts of global depth and local depth of buckets. Which bucketsin the index above (after inserting 21, 25 and 29) have a global depth equal to the localdepth?c) Describe the bulk loading algorithm for B+ trees. What are the differences tousing a simple B+ tree add operation?

Approach to solving the question: a) State of the Index After Adding Keys 21, 25, and 29 Key…

Answered: a) An extendable hashing index is given…

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

Draw a hash table given these numbers and hashing function, build each of the hashing options, and decide if it is efficient, and what function or size might be a better match. Explain why it is efficient or what changes you would make for it to be efficient. a. Scenario 1 a. Hashing function: k mod 4 b. Linear Probing c. Array from 0 to 3 d. Values: 19, 7, 12, 11 b. Scenario 2 a. Hashing function: k mod 10 b. Quadratic Probing c. Array from 0 to 9 d. Values: 20 39 23 56 34 29 55 13 c. Scenario 3 a. Hashing function: first three digits of a phone number b. Overflow chaining c. File with base address of 0 and ends at 999 d. Values: 3135552314, 7343455523, 3134445555, 3134441234, 7342346555, e. 5555342232, 4072984555, 2692185552 d. Scenario 4 a. Hashing function: k mod 100 b. Internal Chaining c. Array 0 to 99 d. Values: 314 325 623 2234 425 1234 2132 2361 1245 123 436 742
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)
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*
Given values below: 66 47 87 900 126 140 145 500 177 285 393 395 467 566 620 735 Store the values into a hash table with ten buckets, each containing three slots. If a bucket is full, use the next (sequential) bucket that contains a free slot. And Store the values into a hash table that uses the hash function key % 10 to determine into which of ten chains (separate chaining) to put the value?
3. Cuckoo hashing. Consider a cuckoo hash table for six items, with two tables of size 5 (similar to what we have in the textbook example). Use the following hash functions to insert items in the order of U, V, W, X, Y, Z. Be sure to include some steps so that the instructor can trace your work.
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)
Q4:Let be a hash function whose input is a string of bits of arbitrary size and the output is a string of m bits. Explain why the security of this function is m/2.
a ) How to add 40 on this linear hashing ? b) How to delete 10 on this linear hashing ? please show the results visually NOT WITH CODE. And at the end please write where is the next.
Consider name taha, take ASCII value of each character and map all those values in a Hash table using division method. Mention each insertion step wise and if there is collision, mention that as well. Answer the following questions A) What should be the preferable Table size and why? B) What technique did you use to cater collision and why? C) What is the value of load factor D) Implement the above problem in java using generic hash function class
Consider a OBHTin which the keys are student identifiers (strings of 6 digits). Assume the following number of buckets and hash function: m = 100; hash(id) = first two digits of id Starting with an empty hash table, show the effect of successively adding the following student identifiers: 000014, 990021, 990019, 970036, 000015, 970012, 970023. Use following function as second hash function hash(id) = last digit of id 2. Show the effect of deleting 000014 from the hash table
3. A hash table contains 10 buckets and uses lincar probing to resolve collisions. The key values are integers and the hash function used is key % 10. If the values 43, 165, 62, 123, 142 are inserted in the table, in what location would the key value 142 be inseted.
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.]

SEE MORE QUESTIONS

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