CN118568310B - Data access method, system, equipment and medium based on linear space linked list - Google Patents

Abstract

The invention relates to the technical field of computer networks, and discloses a data access method, a system, equipment and a medium based on a linear space linked list, wherein the method comprises the following steps: constructing a doubly linked list based on the linear space; the bidirectional linked list comprises a plurality of linked list nodes, each linked list node comprises a data field and a pointer field, the pointer field comprises a precursor node pointer, a subsequent node pointer and a data length variable, the precursor node pointer points to the previous linked list node of the current linked list node, the subsequent node pointer points to the subsequent linked list node of the current linked list node, the value of the data length variable is the data length of data to be stored, and the memory space size of the data field is consistent with the value of the data length variable; setting key value pairs of a hash table based on a bidirectional linked list, and establishing the hash table; based on the hash table and the doubly linked list, data storage and data reading are performed. The invention can avoid the generation of memory fragments, fully utilize the memory space, improve the system performance, save the memory space and improve the system operation efficiency.

Description

Data access method, system, device and medium based on linear space linked list

Technical Field

The present invention relates to the field of computer network technology, and in particular to a data access method, system, device and medium based on a linear space linked list.

Background Art

Intrusion Detection System (IDPS) is an important network security means used to monitor network activities, identify and prevent potential malicious attacks. Among them, the host-based intrusion detection system (HIDS) detects internal threats by analyzing the host's system logs, audit records and other information. However, with the continuous development of network attack technology, the detection capability of HIDS has been challenged. Therefore, researchers began to explore new detection methods, such as network-based intrusion detection system (NIDS), which can realize real-time detection of network attacks by analyzing network traffic. In the field of data storage technology, in order to achieve effective analysis of network traffic, NIDS needs to store and process a large amount of network data.

Existing solutions mainly use the operating system's memory management mechanism, such as malloc and other functions, to achieve dynamic allocation and release of data. In addition, some solutions try to improve memory usage efficiency by optimizing memory management strategies, such as paging management, virtual memory management, etc. However, when processing large amounts of data, existing technologies may cause memory fragmentation problems, thereby affecting system performance. In addition, when implementing effective management of linked lists, existing memory management mechanisms often need to rely on functions such as malloc, which may increase system overhead in some cases. Therefore, how to achieve effective management of linked lists without using functions such as malloc is still a problem worth studying.

Therefore, there is an urgent need for a data access method, system, device and medium based on a linear space linked list that can avoid memory fragmentation, make full use of memory space, improve system performance, save storage space and improve system operation efficiency.

Summary of the invention

In order to solve the above technical problems, the present invention provides a data access method, system, device and medium based on a linear space linked list, which can avoid memory fragmentation, make full use of memory space, improve system performance, save storage space and improve system operation efficiency.

The present invention provides a data access method based on a linear space linked list, comprising the following steps:

A bidirectional linked list is constructed based on a linear space; wherein the bidirectional linked list includes a plurality of linked list nodes, each of which includes a data field and a pointer field, the pointer field includes a predecessor node pointer, a successor node pointer, and a data length variable, the predecessor node pointer points to a previous linked list node of a current linked list node, the successor node pointer points to a subsequent linked list node of the current linked list node, the value of the data length variable is the data length of the data to be stored, and the memory space size of the data field is consistent with the value of the data length variable;

Set the key-value pairs of the hash table based on the doubly linked list to establish a hash table;

Data storage and data reading are performed based on a hash table and a bidirectional linked list; wherein the stored data is compressed data.

The present invention also provides a data access system based on a linear space linked list, which is used to execute any of the above-mentioned data access methods based on a linear space linked list, and the system includes the following modules:

A linked list construction unit is used to construct a bidirectional linked list based on a linear space; wherein the bidirectional linked list includes a plurality of linked list nodes, each of which includes a data field and a pointer field, the pointer field includes a predecessor node pointer, a successor node pointer, and a data length variable, the predecessor node pointer points to the previous linked list node of the current linked list node, the successor node pointer points to the next linked list node of the current linked list node, the value of the data length variable is the data length of the variable-length data stored in the data field, and the memory space size of the data field is consistent with the value of the data length variable;

A hash table construction unit, connected to the linked list construction unit, is used to set the key-value pairs of the hash table based on the bidirectional linked list to establish the hash table;

The processing unit is connected to the linked list construction unit and the hash table construction unit, and is used for storing and reading data based on the hash table and the bidirectional linked list; wherein the stored data is compressed data.

The embodiments of the present invention have the following technical effects:

The present invention improves the linked list structure and allocates the corresponding memory space size according to the data length variable, so that the linked list can realize dynamic allocation of memory space without relying on other functions, optimizes memory management, avoids memory fragmentation, makes full use of memory space, and improves system performance; constructs a hash table based on the linked list, and directly locates the position of the corresponding linked list node through the hash table according to the data keyword, so as to realize fast access to data, without traversing each node of the linked list and comparing and searching one by one, thereby improving the operation efficiency of the system; the design of reading data from a bidirectional linked list or writing data to a bidirectional linked list through a hash table takes into account the security and reliability of the data, and can effectively prevent the loss or tampering of the data; at the same time, the scheme saves storage space and improves memory utilization by compressing and storing the data; by setting a threshold, batch processing is performed on the data, and batch data is stored at one time, thereby avoiding the problem of occupying a large amount of system resources caused by frequent memory application and release, reducing system overhead, and further improving the operation efficiency of the system, thereby providing strong support for the IDPS function and coping with complex network attacks.

This technical solution can be widely used in various scenarios that require storage and processing of network data, such as network monitoring, network attack detection, data analysis, etc., meeting the market demand for efficient, secure, and low-cost data storage and processing, and can be widely used in application fields such as computer network security, data storage, and efficient memory management.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

FIG1 is a flow chart of a data access method based on a linear space linked list provided by an embodiment of the present invention;

FIG2 is a schematic diagram of the structure of a bidirectional linked list provided in an embodiment of the present invention;

3 is a logic diagram of a method for storing data based on a hash table and a bidirectional linked list provided in an embodiment of the present invention;

4 is a schematic diagram of searching for the position of a linked list node corresponding to compressed data in a bidirectional linked list according to a hash table provided by an embodiment of the present invention;

5 is a logic diagram of a method for acquiring data based on a hash table and a bidirectional linked list provided in an embodiment of the present invention;

6 is a schematic diagram of the structure of a data access system based on a linear space linked list provided by an embodiment of the present invention;

FIG. 7 is a schematic diagram of the structure of an electronic device provided by an embodiment of the present invention.

DETAILED DESCRIPTION

In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be described clearly and completely below. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work belong to the scope of protection of the present invention.

In the prior art, functions such as malloc are usually used to realize dynamic allocation and release of data. However, functions such as malloc usually allocate memory blocks based on the granularity of the system memory allocator. If the size of the allocated memory block is not an integer multiple of the requested size, unused space may be left in the memory block, forming internal fragmentation. Moreover, functions such as malloc are non-continuous allocations, and the operating system may not always allocate memory from continuous memory areas. As time goes by, different memory blocks may be scattered in the memory, resulting in external fragmentation. Frequent memory allocation and release may cause memory fragments to gradually accumulate, making large blocks of continuous memory difficult to find, affecting program performance. In addition, the existing linked list node search method is generally a traversal search, which requires one-by-one comparison and search, resulting in low system operation efficiency.

In view of the above problems, the present invention proposes a data access method based on a linear space linked list. FIG1 is a flow chart of a data access method based on a linear space linked list provided by an embodiment of the present invention. Referring to FIG1 , the method specifically includes:

S1. Construct a doubly linked list based on linear space.

Specifically, FIG. 2 is a schematic diagram of the structure of a bidirectional linked list provided by an embodiment of the present invention. Referring to FIG. 2, the bidirectional linked list includes several linked list nodes, each linked list node includes a data field and a pointer field, the pointer field includes a predecessor node pointer, a successor node pointer, and a data length variable, the predecessor node pointer points to the previous linked list node of the current linked list node, the successor node pointer points to the next linked list node of the current linked list node, the value of the data length variable is the data length of the data to be stored, and the memory space size of the data field is consistent with the value of the data length variable. Among them, the linear space is a continuous memory space. In the computer memory, a continuous address space is pre-allocated for storing data structures, that is, the bidirectional linked list of this scheme. This continuous structure can improve the efficiency of data access, and the length of the bidirectional linked list can be dynamically adjusted according to actual needs. Among them, the data to be stored can be the raw data (RAW data) of variable-length Ethernet (ETH), or any data in other formats, which is not limited here. The design of the linked list structure takes into account random access and efficient storage of data, which can effectively avoid the problem of memory fragmentation and improve the performance of the system.

S2. Set the key-value pairs of the hash table based on the bidirectional linked list to establish a hash table.

S21. Use the first n bytes of each linked list node in the bidirectional linked list as keywords, calculate through a hash function, obtain a hash code of the linked list node, and use the hash code as the key corresponding to the linked list node in the hash table.

Specifically, n can be set as needed. For example, the first 4 bytes of each linked list node in the bidirectional linked list can be calculated through a hash function to obtain a hash code of the linked list node, and the hash code is used as the corresponding key of the linked list node in the hash table.

In some embodiments, several bytes at any specified position may be selected as keywords, which is not limited here.

S22. Use the address of the linked list node as the corresponding value of the linked list node in the hash table.

S23. Determine the key-value pair of each linked list node according to the key and value corresponding to each linked list node in the hash table, and establish a hash table.

Furthermore, if two different linked list nodes produce the same hash code (called a conflict), the hash code conflict problem can be solved by using the chain address method or the open addressing method.

S3, based on hash table and bidirectional linked list, data storage and data reading.

The stored data is compressed data.

Specifically, FIG. 3 is a logic diagram of a method for storing data based on a hash table and a bidirectional linked list provided in an embodiment of the present invention. Referring to FIG. 3 , data storage is performed based on a hash table and a bidirectional linked list, specifically including:

S31a. Initialize a bidirectional linked list.

S32a, storing the received data into the cache space.

S33a, adding a header to the data in the cache and encapsulating it to obtain encapsulated data.

Specifically, taking RAW format ETH data as an example, for the complete access of ETH data, since the completely encapsulated data cannot be captured at the ETH layer, it is necessary to save the last encapsulated packet header before the system calls the network device driver to complete the transmission and reception. The packet header may include fields such as the destination media access control address, the source media access control address, and the type. The data at the TCPIP to ETH level needs to be processed and encapsulated once to obtain complete RAW format data, and data access and subsequent use are performed based on the complete RAW format ETH data obtained after encapsulation.

In some embodiments, the data to be accessed does not need to be encapsulated by adding a header, or the data to be accessed is the acquired data itself, and then step S33a does not need to be executed.

S34a, compressing the encapsulated data to obtain compressed data.

Specifically, the GZip compression algorithm is used to compress the data in the cache space, including:

Data preprocessing: Convert the received data into a byte stream and add GZip file header information.

Among them, the GZip file header information includes magic number, compression method, etc.

Compression processing: Use the DEFLATE compression algorithm to compress the preprocessed data.

Add checksum: Calculate the CRC32 checksum of the original received data and the compressed data, and add the checksum to the end of the GZip file; calculate the length of the original received data, and add the length of the original received data to the end of the GZip file.

Output result: Output the final compressed data.

Among them, the Gzip compression algorithm is a lossless compression algorithm, which is based on the DEFLATE compression algorithm. The Gzip compression algorithm encapsulates the DEFLATE compression algorithm and obtains compressed data in the Gzip format through the DEFLATE compression algorithm.

S35a: Determine whether the amount of compressed data in the cache space reaches a preset threshold.

The preset threshold can be set according to the actual situation. Because IO operations and data processing consume a lot of resources, batch processing can reduce frequent input and output operations, improve overall processing efficiency, and is more suitable for processing large amounts of data.

S36a. If the amount of compressed data in the cache space reaches a preset threshold, the compressed data is processed in batches based on the hash function and the hash table, and the compressed data is stored in a bidirectional linked list.

Wherein, each linked list node in the bidirectional linked list stores one piece of the compressed data.

Specifically, FIG. 4 is a schematic diagram of a method for finding a position of a linked list node corresponding to compressed data in a bidirectional linked list according to a hash table provided by an embodiment of the present invention. Referring to FIG. 4 , batch processing of compressed data based on a hash function and a hash table and storing the compressed data in a bidirectional linked list specifically includes:

Based on the hash function, the hash code of the compressed data is calculated according to the keyword of each compressed data.

Among them, when the keywords of two different compressed data generate the same hash code, the chain address method or open addressing method can also be used to solve the hash code conflict problem.

According to the hash code of the compressed data and the hash table, find the position of the linked list node corresponding to the compressed data in the doubly linked list.

If there is a linked list node corresponding to the compressed data in the hash table, the compressed data is stored in the corresponding linked list node.

If there is no linked list node corresponding to the compressed data in the hash table, a new linked list node is created, the key-value pair of the new linked list node is stored in the hash table, and the compressed data is stored in the new linked list node according to the hash table.

Furthermore, the data length of the compressed data is obtained, and the value of the data length variable in the new linked list node is determined according to the data length.

Allocate memory space for the data field in the new linked list node according to the value of the data length variable.

Store the compressed data in the data field of the new linked list node.

S37a: If the amount of compressed data in the cache space does not reach the preset threshold, continue to receive the next set of data.

Specifically, FIG. 5 is a logic diagram of a method for acquiring data based on a hash table and a bidirectional linked list provided in an embodiment of the present invention. Referring to FIG. 5 , data reading is performed based on a hash table and a bidirectional linked list, specifically including:

S31b. Input the keyword of the required data into the hash table.

S32b. Based on the hash function, the keyword of the required data is calculated to obtain a hash code of the required data.

S33b, locating the position of the corresponding linked list node in the bidirectional linked list according to the hash code of the required data and the hash table.

S34b. If there is a corresponding linked list node in the bidirectional linked list, read the data in the corresponding linked list node.

S35b. If there is no corresponding linked list node in the bidirectional linked list, a null value is returned.

The present invention improves the linked list structure and allocates the corresponding memory space size according to the data length variable, so that the linked list can realize dynamic allocation of memory space without relying on other functions, optimizes memory management, avoids memory fragmentation, makes full use of memory space, and improves system performance; constructs a hash table based on the linked list, and directly locates the position of the corresponding linked list node through the hash table according to the data keyword, so as to realize fast access to data, without traversing each node of the linked list and comparing and searching one by one, thereby improving the operation efficiency of the system; the design of reading data from the bidirectional linked list or writing data to the bidirectional linked list through the hash table takes into account the security and reliability of the data, and can effectively prevent the loss or tampering of the data; at the same time, the scheme saves storage space and improves memory utilization by compressing and storing the data; by setting a threshold, batch processing is performed on the data, and batch data is stored at one time, so as to avoid the problem of occupying a large amount of system resources caused by frequent memory application and release, reduce system overhead, and further improve the operation efficiency of the system, thereby providing strong support for the IDPS function and coping with complex network attacks.

This technical solution can be widely used in various scenarios that require storage and processing of network data, such as network monitoring, network attack detection, data analysis, etc., meeting the market demand for efficient, secure, and low-cost data storage and processing, and can be widely used in application fields such as computer network security, data storage, and efficient memory management.

FIG6 is a schematic diagram of the structure of a data access system based on a linear space linked list provided by an embodiment of the present invention. The system is used to execute a data access method based on a linear space linked list described in the above embodiment. As shown in FIG6 , the system includes the following modules:

A linked list construction unit is used to construct a bidirectional linked list based on a linear space; wherein the bidirectional linked list includes a number of linked list nodes, each of which includes a data field and a pointer field, the pointer field includes a predecessor node pointer, a successor node pointer, and a data length variable, the predecessor node pointer points to the previous linked list node of the current linked list node, the successor node pointer points to the next linked list node of the current linked list node, the value of the data length variable is the data length of the variable-length data stored in the data field, and the memory space size of the data field is consistent with the value of the data length variable.

The hash table construction unit is connected to the linked list construction unit and is used to set the key-value pairs of the hash table based on the bidirectional linked list to establish the hash table.

The processing unit is connected to the linked list construction unit and the hash table construction unit, and is used for storing and reading data based on the hash table and the bidirectional linked list; wherein the stored data is compressed data.

FIG7 is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. As shown in FIG7 , the electronic device 500 includes one or more processors 501 and a memory 502 .

The processor 501 may be a central processing unit (CPU) or other forms of processing units having data processing capabilities and/or instruction execution capabilities, and may control other components in the electronic device 500 to perform desired functions.

The memory 502 may include one or more computer program products, and the computer program product may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. The volatile memory may include, for example, random access memory (RAM) and/or cache memory (cache), etc. The non-volatile memory may include, for example, read-only memory (ROM), hard disk, flash memory, etc. One or more computer program instructions may be stored on the computer-readable storage medium, and the processor 501 may run the program instructions to implement a data access method based on a linear space linked list and/or other desired functions of any embodiment of the present application described above. Various contents such as initial external parameters, thresholds, etc. may also be stored in the computer-readable storage medium.

In one example, the electronic device 500 may further include: an input device 503 and an output device 504, which are interconnected via a bus system and/or other forms of connection mechanisms (not shown). The input device 503 may include, for example, a keyboard, a mouse, etc. The output device 504 may output various information to the outside, including early warning prompt information, braking force, etc. The output device 504 may include, for example, a display, a speaker, a printer, a communication network and a remote output device connected thereto, etc.

Of course, for simplicity, FIG7 only shows some of the components related to the present application in the electronic device 500, omitting components such as a bus, an input/output interface, etc. In addition, the electronic device 500 may also include any other appropriate components according to specific application scenarios.

In addition to the above-mentioned methods and devices, an embodiment of the present application may also be a computer program product, which includes computer program instructions, which, when executed by a processor, enable the processor to execute a data access method based on a linear space linked list provided in any embodiment of the present application.

The computer program product may be written in any combination of one or more programming languages to write program codes for performing the operations of the embodiments of the present application, including object-oriented programming languages, such as Java, C++, etc., and conventional procedural programming languages, such as "C" language or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as an independent software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server.

In addition, an embodiment of the present application may also be a computer-readable storage medium on which computer program instructions are stored. When the computer program instructions are executed by a processor, the processor executes a data access method based on a linear space linked list provided in any embodiment of the present application.

The computer readable storage medium can adopt any combination of one or more readable media. The readable medium can be a readable signal medium or a readable storage medium. The readable storage medium can include, for example, but is not limited to, a system, device or device of electricity, magnetism, light, electromagnetic, infrared, or semiconductor, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

It should be noted that the terms used in the present invention are only for describing specific embodiments, rather than limiting the scope of the present application. As shown in the present specification, unless the context clearly indicates an exception, the words "one", "a", "a kind of" and/or "the" do not specifically refer to the singular, but may also include the plural. The terms "include", "comprise" or any other variant thereof are intended to cover non-exclusive inclusion, so that the process, method or device including a series of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method or device. In the absence of more restrictions, the elements defined by the sentence "include one..." do not exclude the presence of other identical elements in the process, method or device including the elements.

It should also be noted that the terms "center", "up", "down", "left", "right", "vertical", "horizontal", "inside", "outside", etc., indicating the orientation or positional relationship, are based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation on the present invention. Unless otherwise clearly specified and limited, the terms "installed", "connected", "connected", etc. should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be an indirect connection through an intermediate medium, or it can be a connection between the two elements. For those of ordinary skill in the art, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the technical solutions of the embodiments of the present invention.

Claims (10)

1. The data access method based on the linear space linked list is characterized by comprising the following steps:

Constructing a doubly linked list based on the linear space; wherein the linear space is a continuous address space which is allocated in advance and is used for storing a data structure; the bidirectional linked list comprises a plurality of linked list nodes, each linked list node comprises a data field and a pointer field, the pointer field comprises a precursor node pointer, a subsequent node pointer and a data length variable, the precursor node pointer points to a previous linked list node of the current linked list node, the subsequent node pointer points to a subsequent linked list node of the current linked list node, the value of the data length variable is the data length of data to be stored, and the memory space size of the data field is consistent with the value of the data length variable;

Setting key value pairs of a hash table based on the doubly linked list, and establishing the hash table;

Based on the hash table and the doubly linked list, data storage and data reading are carried out; wherein the stored data is the data after compression processing.

2. The method for accessing data based on linear spatial linked list according to claim 1, wherein said setting up hash table based on key value pairs of said doubly linked list comprises:

Calculating by using the first n bytes of each linked list node in the bidirectional linked list as keywords through a hash function to obtain hash codes of the linked list nodes, and using the hash codes as keys corresponding to the linked list nodes in a hash table;

Taking the address of the linked list node as a value corresponding to the linked list node in a hash table;

And determining key value pairs of the linked list nodes according to keys and values corresponding to each linked list node in the hash table, and establishing the hash table.

3. The data access method based on the linear space linked list according to claim 2, wherein the data storage based on the hash table and the doubly linked list specifically comprises:

Initializing the bidirectional linked list;

Storing the received data into a cache space;

Adding a packet header to the data in the cache space, and packaging to obtain packaged data;

Compressing the packaged data to obtain compressed data;

Judging whether the quantity of the compressed data in the cache space reaches a preset threshold value or not;

If the quantity of the compressed data in the cache space reaches a preset threshold value, processing the compressed data in batches based on the hash function and the hash table, and storing the compressed data into the doubly linked list; wherein each linked list node in the doubly linked list stores one piece of compressed data;

And if the quantity of the compressed data in the cache space does not reach a preset threshold value, continuing to receive the next group of data.

4. The method for accessing data based on a linear space linked list according to claim 3, wherein if the number of compressed data in the buffer space reaches a preset threshold, processing the compressed data in batches based on the hash function and the hash table, and storing the compressed data in the doubly linked list, specifically comprising:

Based on the hash function, calculating hash codes of the compressed data according to the keywords of each compressed data respectively;

Searching the position of a linked list node corresponding to the compressed data in the doubly linked list according to the hash code of the compressed data and the hash table;

if the linked list node corresponding to the compressed data exists in the hash table, storing the compressed data to the corresponding linked list node;

If the linked list node corresponding to the compressed data does not exist in the hash table, a new linked list node is created, key value pairs of the new linked list node are stored in the hash table, and the compressed data is stored in the new linked list node according to the hash table.

5. The method of claim 4, wherein if there is no linked list node corresponding to the compressed data in the hash table, creating a new linked list node, storing key pairs of the new linked list node in the hash table, and storing the compressed data in the new linked list node according to the hash table comprises:

Acquiring the data length of the compressed data, and determining the value of the data length variable in a new linked list node according to the data length;

Memory space is allocated for the data fields in the new linked list nodes according to the values of the data length variables;

storing the compressed data into the data field of the new linked list node.

6. The method for accessing data based on linear space linked list according to claim 3, wherein compressing data in the cache space to obtain compressed data comprises:

the data in the cache space is compressed by adopting a GZip compression algorithm, which comprises the following steps:

data preprocessing: converting the received data into a byte stream, and adding the GZip file header information;

compression treatment: compressing the preprocessed data by using a DEFLATE compression algorithm;

Adding a checksum: calculating CRC32 checksum of the original received data and the compressed data, and adding the checksum to the end of the GZip file; calculating the length of the original received data, and adding the length of the original received data to the tail of the GZip file;

outputting a result: and outputting the final compressed data.

7. The data access method based on the linear space linked list according to claim 2, wherein the data reading is performed based on the hash table and the doubly linked list, specifically comprising:

Inputting a keyword of required data into the hash table;

based on the hash function, calculating the key words of the required data to obtain the hash codes of the required data;

positioning the position of the corresponding linked list node in the double linked list according to the hash code of the required data and the hash table;

If the corresponding linked list node exists in the bidirectional linked list, reading data in the corresponding linked list node;

And if the corresponding linked list node does not exist in the bidirectional linked list, returning a null value.

8. A data access system based on a linear spatial linked list, the system comprising the following modules:

The linked list construction unit is used for constructing a bidirectional linked list based on the linear space; wherein the linear space is a continuous address space which is allocated in advance and is used for storing a data structure; the bidirectional linked list comprises a plurality of linked list nodes, each linked list node comprises a data field and a pointer field, the pointer field comprises a precursor node pointer, a subsequent node pointer and a data length variable, the precursor node pointer points to a previous linked list node of the current linked list node, the subsequent node pointer points to a subsequent linked list node of the current linked list node, the value of the data length variable is the data length of variable-length data stored in the data field, and the memory space size of the data field is consistent with the value of the data length variable;

the hash table construction unit is connected with the linked list construction unit and is used for setting key value pairs of the hash table based on the bidirectional linked list to establish the hash table;

the processing unit is connected with the linked list construction unit and the hash table construction unit and is used for storing and reading data based on the hash table and the bidirectional linked list; wherein the stored data is the data after compression processing.

9. An electronic device, the electronic device comprising:

a processor and a memory;

the processor is configured to execute the linear space linked list based data access method according to any one of claims 1 to 7 by calling a program or instructions stored in the memory.

10. A computer-readable storage medium storing a program or instructions that cause a computer to perform the linear space linked list based data access method of any one of claims 1 to 7.