Answered: Suppose in the DGIM algorithm the…

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

Related questions

Question

[Mining Data Streams]

13. Suppose in the DGIM algorithm the window is as shown below. Answer the
following questions.

(a) Using the above DGIM window, estimate the number of 1’s for the last k positions for the
following values of k: (show the calculation steps)
• k = 12
• k = 17
b) What will the modified buckets look like after the following bits enter the stream?
• First, a 1 enters, then a 0 enters, then a 0 enters, and at the end, a 1 enters the stream.
o Show all intermediate steps.
o Note that always one or two buckets with the same number of 1s must exist.

1 0 1 1 0 1 1 0 0 0 1 0 1 1 1 0 1 1 0 0 1 0 1 1 0

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions