Hisoka-X commented on PR #4250: URL: https://github.com/apache/flink-cdc/pull/4250#issuecomment-3838575416
> I'm unclear how the O(n²) time complexity arises—could you elaborate on the specific cause? As ticket say, the BinaryLogClient return LinkedList. But MySqlStreamingChangeEventSource handleChange() uses Index-based for loop traversal https://github.com/apache/flink-cdc/blob/master/flink-cdc-connect/flink-cdc-source-connectors/flink-connector-mysql-cdc/src/main/java/io/debezium/connector/mysql/MySqlStreamingChangeEventSource.java#L947 So the cost is O(1 + 2 + 3 + ... + n) = O(n²) -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
