We have n elements {x1,... , xn} we want to hash into a table T of size s = Let us consider the following method of hashing these n elements into T: 2п. For each i = 1, . п, do the following: 1. Pick a permutation of [1, ... , s] uniformly at random. Call this permutation T; : [s] → [s], which maps each index to the element which ends up in that index. 2. Set j = 1. 3. While T[T;(j)] has an element in it, increment j. 4. Place x; in T[T;(j)]. 1.1 Show that while inserting any xi, the probability that there are at least t iterations of the while loop in Step 3 is at most 2–t.
We have n elements {x1,... , xn} we want to hash into a table T of size s = Let us consider the following method of hashing these n elements into T: 2п. For each i = 1, . п, do the following: 1. Pick a permutation of [1, ... , s] uniformly at random. Call this permutation T; : [s] → [s], which maps each index to the element which ends up in that index. 2. Set j = 1. 3. While T[T;(j)] has an element in it, increment j. 4. Place x; in T[T;(j)]. 1.1 Show that while inserting any xi, the probability that there are at least t iterations of the while loop in Step 3 is at most 2–t.
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
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.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