Queue data access method and device

Abstract

This specification provides a data access method and device for a queue. The method includes: constructing a double-layer circular queue whose inner and outer layers are circular queues; wherein, the inner circular queue is implemented based on an array, and the outer circular queue is implemented based on a linked list; Setting the management pointer of the outer circular queue; accessing data on the inner circular queue according to the management pointer. The above technical solution makes full use of the advantages of array-based and linked-list-based queues, and solves the problem that memory utilization and access efficiency cannot be well balanced. Especially in some more complex scenarios, memory utilization can be significantly improved. and data access efficiency.

Description

technical field [0001] This specification relates to the technical field of data processing, and in particular to a queue data access method and device. Background technique [0002] Queue is a commonly used in-memory data structure, which is often used in scenarios where data has first-in, first-out characteristics. The queue is a first-in-first-out data structure: when data enters the queue, it enters from the tail, and when fetching data from the queue, it takes it from the head. A circular queue is a logical end-to-end queue to realize the recycling of space, which can be implemented based on an array or a linked list. These two implementations have their own advantages and disadvantages. In some simple application scenarios, one of the two implementations can meet the requirements. However, in some more complex scenarios, especially when there are high requirements on memory utilization and access performance, these two methods are difficult to meet the requirements. ...

AI Technical Summary

Problems solved by technology

If the allocated memory space is large each time memory is allocated, it will lead to low memory utilization. If the memory allocated each time is small, it will lead to excessive memory allocation and memory copying, resulting in decreased access performance.

However, if a circular queue is implemented based on a linked list, since each node needs a pointer, every time a node is created, memory must be allocated once, which will easily lead to more memory fragmentation, so the memory utilization rate is not high

[0004] It can be seen that the traditional queue access data scheme, in some more complex scenarios, is prone to defects of low memory utilization and low access efficiency

Images