Event processing method, apparatus, device, and storage medium

By combining data red-black trees and timeout red-black trees, the problem of low efficiency in event timeout handling mechanisms is solved, achieving efficient resource management and accurate processing with O(logn) time complexity.

CN114327992BActive Publication Date: 2026-06-16CHINA UNIONPAY
2 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
CHINA UNIONPAY
Filing Date
2022-01-13
Publication Date
2026-06-16

AI Technical Summary

⚠Technical Problem

Existing event timeout handling mechanisms are inefficient when dealing with a large number of events, leading to decreased system performance and low resource utilization.

⚗Method used

A combination of data red-black trees and timeout red-black trees is used. The data red-black tree is used to find the data identifier of the target event and the timeout time is found in the timeout red-black tree. If there is no matching node in the timeout red-black tree, the resources are released, thus achieving timeout processing with O(logn) time complexity.

🎯Benefits of technology

This improves the processing efficiency and resource utilization of the timeout handling mechanism, reduces the resource consumption of red-black trees, and enhances the accuracy and efficiency of timeout handling.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
Patent Text Reader

Abstract

The application discloses an event processing method and device, equipment and a storage medium, and belongs to the field of data processing. The method comprises the following steps: receiving an event response message, wherein the event response message comprises the data identifier of a target event; based on the target event data identifier, searching for a first target node in a preset data red-black tree, wherein the key of the node in the data red-black tree comprises the data identifier of the event, and the value of the node in the data red-black tree comprises the timeout time of the event; based on the value of the first target node, searching for a second target node in a preset timeout red-black tree, wherein the second target node is a node in the timeout red-black tree that matches the value of the first target node, the timeout red-black tree comprises the node of the event whose timeout time is later than the current time, and the key of the node in the timeout red-black tree comprises the timeout time of the event; and if the second target node does not exist in the timeout red-black tree, releasing the resource corresponding to the target event. According to the embodiment of the application, the processing efficiency of the timeout processing mechanism can be improved.
Need to check novelty before this filing date? Find Prior Art