Which statement about a Hopping Window is true?

Which statement about a Hopping Window is true?

• A. Time based, Fixed Size, Non-Overlapping
• B. Fixed Size, Overlapping
• C. Time based, Fixed Size, Overlapping
• D. Session-based, Dynamically sized

Answer: (C)

Hopping windows are a time-based windowing approach in stream processing where each window has a fixed duration and a fixed start interval (the hop). Because the start times advance by this fixed hop, which is often smaller than the window duration, successive windows overlap in time. That overlap is the defining feature of hopping windows. So the statement that best describes a hopping window is: time-based, fixed size, overlapping. For example, with a window length of 10 minutes and a hop of 5 minutes, you get windows from 0–10, 5–15, 10–20, and so on, and events can belong to multiple windows. If the hop were equal to the window length, there would be no overlap; if the hop were larger than the window, there would be gaps. Options describing session-based or dynamically sized windows don’t fit hopping windows.

Hopping windows are a time-based windowing approach in stream processing where each window has a fixed duration and a fixed start interval (the hop). Because the start times advance by this fixed hop, which is often smaller than the window duration, successive windows overlap in time. That overlap is the defining feature of hopping windows.

So the statement that best describes a hopping window is: time-based, fixed size, overlapping. For example, with a window length of 10 minutes and a hop of 5 minutes, you get windows from 0–10, 5–15, 10–20, and so on, and events can belong to multiple windows. If the hop were equal to the window length, there would be no overlap; if the hop were larger than the window, there would be gaps. Options describing session-based or dynamically sized windows don’t fit hopping windows.