You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@flink.apache.org by "Stefan Richter (JIRA)" <ji...@apache.org> on 2018/05/23 13:01:00 UTC
[jira] [Updated] (FLINK-9423) Implement efficient deletes for heap
based timer service
[ https://issues.apache.org/jira/browse/FLINK-9423?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Stefan Richter updated FLINK-9423:
----------------------------------
Description:
The current data structures in the `HeapInternalTimerService` are not able to support efficient timer deletes, the complexity is currently O\(n\), where n is the number of registered timers.
We can keep track of timer's positions in the priority queue and (in combination with the already existing set/map) have a more efficient algorithm for deletes.
was:
The current data structures in the `HeapInternalTimerService` are not able to support efficient timer deletes, the complexity is currently O(n), where n is the number of registered timers.
We can keep track of timer's positions in the priority queue and (in combination with the already existing set/map) have a more efficient algorithm for deletes.
> Implement efficient deletes for heap based timer service
> --------------------------------------------------------
>
> Key: FLINK-9423
> URL: https://issues.apache.org/jira/browse/FLINK-9423
> Project: Flink
> Issue Type: Improvement
> Components: Streaming
> Affects Versions: 1.6.0
> Reporter: Stefan Richter
> Assignee: Stefan Richter
> Priority: Major
>
> The current data structures in the `HeapInternalTimerService` are not able to support efficient timer deletes, the complexity is currently O\(n\), where n is the number of registered timers.
>
> We can keep track of timer's positions in the priority queue and (in combination with the already existing set/map) have a more efficient algorithm for deletes.
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)