知识卡片

普通读书笔记卡 · 1980.z.4.b.2.c

流时间与重新分区

理解等级:中级

stream time取已处理事件时间的最大值,只增不减。原书描述的Kafka Streams子拓扑逐事件完成处理,各子拓扑在重分区流两侧各自维护时间。重分区只是数据搬移,需保留原事件时间;若换成发送时的墙钟,将破坏原来的时间关系。并行实例进度不同会在重分区结果中制造乱序,因此单调流时间并不保证输入时间戳单调。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • Deterministic Stream Processing · 查看原书依据

      A second option for maintaining time in a stream processor, known simply as stream time, is the approach favored by Apache Kafka Streams. A consumer application reading from one or more event streams maintains a stream time for its topology, which is the highest timestamp of processed events. The consumer instance consumes and buffers events from each event stream partition assigned to it, applies the event-scheduling algorithm to select the

    参考来源

    - 位置:《Building Event-Driven Microservices Leveraging Organizational Data at Scale (Adam Bellemare)》第06章《Deterministic Stream Processing》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Building Event-Driven Microservices Leveraging Organizational Data at Scale (Adam Bellemare)/_epub-src/OEBPS/ch06.xhtml;规范化段落起句:A second option for maintaining time) - 结论依据:原文对该对象的定义、运行说明或对比支持以下归纳:stream time取已处理事件时间的最大值,只增不减。本卡同时保留其适用条件与失败边界。 - 原始内容:A second option for maintaining time in a stream processor, known simply as stream time, is the approach favored by Apache Kafka Streams. A consumer application reading from one or more event streams maintains a stream time for its topology, which is the highest timestamp of processed events. The consumer instance consumes and buffers events from each event stream partition assigned to it, applies the event-scheduling algorithm to select the