Design and Implementation of Sliding Window with Circular Linked List for Dynamic Data Flow

Abstract

Sliding Windows can transmit frames as well as byte data. Dynamic data flow has the characteristics of magnanimity, timeliness and continuity, among which data and knowledge will change with the passage of time, the application of sliding window can effectively limit the operation of dynamic data flow. The traditional vector sliding window has high cost and low efficiency in processing dynamic data flow. In this paper, the cyclic linked list is introduced into the sliding window design, and the location information of each child window is stored in the linked list. When the sliding window receives the dynamic data flow, the newly added data is directly inserted into the child window, which avoids the disadvantage that the sliding window needs to move the data in the window frequently when processing the dynamic data flow. Meanwhile, design clustering algorithm: Dclustream. Through efficiency analysis and experimental verification, the method proposed in this paper can effectively reduce the calculation cost of sliding window, obtain better clustering effect and improve the processing efficiency of dynamic data flow. Also, it can save memory.