You are given an insertion-only stream, only consisting of (add, i) updates where i e {1,...,n}. There are m such updates. Suppose you want to sample a random insertion in the stream. For example, if the insertions formed the sequence (1,3, 5, 5, 7,1,5) with m = 7, then the goal %3D is to output 1 with probability 2/7, 3 with probability 1/7, 5 with probability 3/7, and 7 with probability 1/7. Consider the following algorithm that acts as follows on the t'th insertion. If t = 1, let X be the first inserted element. For t > 1, with probability 1/t, let X be the t'th inserted element and with probability 1– 1/t, don't change X. At the end of the stream, return X. Show that X is indeed uniformly sampled from the m insertions.

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
icon
Related questions
Question
You are given an insertion-only stream, only consisting of (add, i) updates where i e {1,...,n}.
There are m such updates. Suppose you want to sample a random insertion in the stream.
For example, if the insertions formed the sequence (1,3, 5, 5, 7, 1, 5) with m = 7, then the goal
is to output 1 with probability 2/7, 3 with probability 1/7, 5 with probability 3/7, and 7 with
probability 1/7.
Consider the following algorithm that acts as follows on the t'th insertion. If t = 1, let X be
the first inserted element. For t > 1, with probability 1/t, let X be the tth inserted element
and with probability 1– 1/t, don't change X. At the end of the stream, return X.
Show that X is indeed uniformly sampled from the m insertions.
Transcribed Image Text:You are given an insertion-only stream, only consisting of (add, i) updates where i e {1,...,n}. There are m such updates. Suppose you want to sample a random insertion in the stream. For example, if the insertions formed the sequence (1,3, 5, 5, 7, 1, 5) with m = 7, then the goal is to output 1 with probability 2/7, 3 with probability 1/7, 5 with probability 3/7, and 7 with probability 1/7. Consider the following algorithm that acts as follows on the t'th insertion. If t = 1, let X be the first inserted element. For t > 1, with probability 1/t, let X be the tth inserted element and with probability 1– 1/t, don't change X. At the end of the stream, return X. Show that X is indeed uniformly sampled from the m insertions.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education