CN112035380A - Data processing method, device and equipment and readable storage medium - Google Patents
Data processing method, device and equipment and readable storage medium Download PDFInfo
- Publication number
- CN112035380A CN112035380A CN202011026507.6A CN202011026507A CN112035380A CN 112035380 A CN112035380 A CN 112035380A CN 202011026507 A CN202011026507 A CN 202011026507A CN 112035380 A CN112035380 A CN 112035380A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- address
- linked list
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 27
- 238000012545 processing Methods 0.000 claims abstract description 30
- 238000004590 computer program Methods 0.000 claims description 9
- 238000004422 calculation algorithm Methods 0.000 claims description 7
- 238000000034 method Methods 0.000 abstract description 21
- 230000008901 benefit Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 7
- 229920006395 saturated elastomer Polymers 0.000 description 5
- 230000007246 mechanism Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000013500 data storage Methods 0.000 description 3
- 238000003780 insertion Methods 0.000 description 3
- 230000037431 insertion Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000004883 computer application Methods 0.000 description 2
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002085 persistent effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 230000001052 transient effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
- G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0614—Improving the reliability of storage systems
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a data processing method, a device, equipment and a readable storage medium, wherein the method comprises the following steps: accessing the address node in the linear linked list to obtain the node address of the target data node in the linear linked list; the linear linked list comprises address nodes and data nodes, wherein the address nodes store node addresses of the data nodes, and the data nodes store data contents; and accessing the target data node by using the node address to obtain target data. In the method, a linear linked list is provided, which comprises address nodes for storing node addresses and data nodes for storing data. The linear linked list does not require continuous addresses among all data nodes, namely, continuous memory space is not required, and the linear linked list has the characteristic of flexible expansion; the data access does not need to traverse each data node, but directly obtains the node address from the address node, so that the access speed can be increased, and the data processing efficiency can be improved under the condition of ensuring the utilization rate of the memory.
Description
Technical Field
The present invention relates to the field of computer application technologies, and in particular, to a data processing method, apparatus, device, and readable storage medium.
Background
The data structure is the basis for the algorithm, and the array and linked list are the basis for the data structure. Because more complex data structures like heaps, stacks, trees, graphs, etc. can basically be represented by arrays and linked lists.
The array has the characteristics of high access speed, high memory requirement, incapability of expansion and the like; the linked list has the characteristics of low memory requirement, flexible expansion, low access speed and the like. Therefore, in practical application, an array or a linked list can be selected and used according to requirements. However, it is difficult to efficiently process data in both an array and a linked list, in response to frequent demands such as a large amount of data and frequent modification and access.
In summary, how to effectively improve the data processing efficiency is a technical problem that needs to be solved by those skilled in the art.
Disclosure of Invention
The invention aims to provide a data processing method, a data processing device, data processing equipment and a readable storage medium, and provides a data structure between an array and a linked list so as to improve the data processing efficiency.
In order to solve the technical problems, the invention provides the following technical scheme:
a method of data processing, comprising:
accessing an address node in a linear linked list to obtain a node address of a target data node in the linear linked list; the linear linked list comprises address nodes and data nodes, wherein the address nodes store node addresses of the data nodes, and the data nodes store data contents;
and accessing the target data node by using the node address to obtain target data.
Preferably, the method further comprises the following steps:
and inserting new data into the data node, and storing a new data address in the address node.
Preferably, inserting new data into the data node comprises:
judging whether the data is in saturation;
if so, expanding the size of the linear linked list by using a linked list expansion algorithm, and inserting the new data into a new data node;
and if not, inserting the new data into the data node.
Preferably, the accessing an address node in a linear linked list to obtain a node address of a target data node in the linear linked list includes:
accessing the address node according to an array access mode to obtain the node address; the data structure in the address node is an array type.
Preferably, the accessing an address node in a linear linked list to obtain a node address of a target data node in the linear linked list includes:
accessing the address node according to a Map access mode to obtain the node address; the data structure in the address node is of a Map type.
Preferably, the method further comprises the following steps:
acquiring the quantity of data to be stored;
and creating a target linear linked list matched with the data quantity.
Preferably, the creating a target linear chain table matching with the data quantity includes:
creating data nodes matched with the data quantity;
judging whether the data quantity is larger than a threshold value;
if so, creating an address node with a data structure of a Map type;
if not, the address node with the data structure of the array type is created.
A data processing apparatus comprising:
the node address acquisition module is used for accessing the address nodes in the linear linked list and acquiring the node addresses of the target data nodes in the linear linked list; the linear linked list comprises address nodes and data nodes, wherein the address nodes store node addresses of the data nodes, and the data nodes store data contents;
and the data access module is used for accessing the target data node by using the node address to obtain target data.
A data processing apparatus comprising:
a memory for storing a computer program;
a processor for implementing the steps of the data processing method when executing the computer program.
A readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the above-mentioned data processing method.
By applying the method provided by the embodiment of the invention, the address node in the linear linked list is accessed to obtain the node address of the target data node in the linear linked list; the linear linked list comprises address nodes and data nodes, wherein the address nodes store node addresses of the data nodes, and the data nodes store data contents; and accessing the target data node by using the node address to obtain target data.
In the method, a new linear linked list is provided, where the linear linked list includes address nodes and data nodes, where the address nodes are used to store node addresses of the data nodes, and the data nodes store data contents. Specifically, when accessing data, the node address of the target data node can be obtained by accessing the address node first, and then the node address is accessed, so that the target data node can be accessed to obtain the target data. Because the node addresses of all the data nodes of the linear linked list are stored in the address nodes, the continuous addresses among all the data nodes are not required, namely, continuous memory space is not required, and the linear linked list has the characteristic of flexible expansion; the data access does not need to traverse each data node, but directly obtains the node address from the address node, thereby accelerating the access speed and improving the data processing efficiency under the condition of ensuring the utilization rate of the memory
Accordingly, embodiments of the present invention further provide a data processing apparatus, a device and a readable storage medium corresponding to the data processing method, which have the above technical effects and are not described herein again.
Drawings
In order to more clearly illustrate the embodiments of the present invention or technical solutions in related arts, the drawings used in the description of the embodiments or related arts will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart of an embodiment of a data processing method;
FIG. 2 is a schematic diagram of a cell structure;
FIG. 3 is a schematic diagram of a linked list structure;
FIG. 4 is a diagram illustrating a target linear linked list according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a data processing apparatus according to an embodiment of the present invention;
FIG. 6 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present invention.
Detailed Description
In order that those skilled in the art will better understand the disclosure, the invention will be described in further detail with reference to the accompanying drawings and specific embodiments. It is to be understood that the described embodiments are merely exemplary of the invention, and not restrictive of the full scope of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In order to facilitate understanding of the data processing method provided by the embodiment of the present invention, the following description will first describe the array and the linked list in detail from the storage structure.
The Array (Array) is an ordered sequence of elements. If a set of a finite number of variables of the same type is named, then this name is the array name. The individual variables that make up an array are referred to as the components of the array, also referred to as the elements of the array, and sometimes as subscript variables. The numerical numbering used to distinguish the various elements of the array is referred to as the subscript. An array is a form in which elements of the same type are organized in an ordered fashion for processing convenience in programming. The collection of these ordered homogeneous data elements is called an array. The array is characterized as follows:
(1) the length of the array is determined. I.e. the number of elements that must be specified when stored.
(2) Once an array is created, its size may not be changed.
(3) The storage of each element in the array is sequential, and the elements must be continuously stored together in the memory according to the sequential order.
(4) The array element is represented by the name of the entire array and its own ordinal position in the array. For example, as shown in FIG. 2, a [0] represents the first element in the array named a, a [1] represents the second element of array a, and so on.
By integrating the characteristics and the storage structure of the array, according to the memory continuity in the definition of the standard array, the advantages and the disadvantages of the array can be easily obtained as follows:
(1) fast access, complexity O (1).
(2) Slow speed is caused by element movement at the time of insertion and deletion.
(3) The memory space requirement is high, and enough continuous memory space is required.
(4) The array size is fixed, and dynamic expansion cannot be realized.
The linked list is a non-continuous, non-sequential storage structure on the physical storage unit, and the logical order of the data elements is realized by the link order of the pointers in the linked list. A linked list is composed of a series of nodes (each element in the linked list is called a node), which can be dynamically generated at runtime. Each node comprises two parts: one is a data field that stores the data element and the other is a pointer field that stores the address of the next node. The linear linked list is characterized in that:
(1) the data elements of the linear table are stored in an arbitrary set of memory locations (the set of memory locations may or may not be contiguous).
(2) In addition to storing its own information, a data element also stores information indicating its immediate successor (i.e., indicating a subsequent storage location), such as a pointer.
(3) To find a certain number, it is necessary to find the number from the beginning, which is time-consuming.
Referring to fig. 3, and the characteristics and storage structure of the comprehensive linear linked list, the advantages and disadvantages of the linked list are as follows:
(1) and the speed of inserting and deleting data is high.
(2) The memory utilization rate is high, and the memory is not wasted.
(3) The size is not fixed, and the expansion is flexible.
(4) The search cannot be carried out randomly, the traversal must be started from the first step, and the search efficiency is low.
It can be seen that the array and the linked list have their advantages and disadvantages, but in practical applications, when the current data size is large, and the modification access is frequent, the disadvantages of the array and the linked list will be amplified, which will seriously affect the data processing efficiency. In order to better perform data processing, the data processing method provided by the embodiment of the invention can meet the requirements of various application scenarios based on a new data storage structure with the corresponding advantages of a compatible array and a linked list. Specifically, referring to fig. 1, fig. 1 is a flowchart of a data processing method according to an embodiment of the present invention, where the method includes the following steps:
s101, address nodes in the linear linked list are accessed, and node addresses of target data nodes in the linear linked list are obtained.
The linear linked list comprises address nodes and data nodes, wherein the address nodes store node addresses of the data nodes, and the data nodes store data contents.
It should be noted that, from the advantage of the array, it has the greatest features: fast access, and reason for fast access: its data is contiguous at memory addresses and is accessed through an array index when accessing a certain array element. For example, an int type array with a length of 5 is assumed that a head address allocated to the array by a computer is 1000, when an element at a position with an angle mark of 2 is accessed, a memory position corresponding to the element, that is, 1000+2 × 4, can be directly obtained through calculation, where 1000 is the head address, 2 represents an offset, and 4 represents the size of the memory occupied by each element (the int type occupies 4 bytes), so that the position corresponding to the angle mark in the array can be directly found through one-time calculation, and thus a high-efficiency access mechanism is realized.
For a linear linked list, it has the greatest characteristics: the size is not fixed, the expansion is flexible, the memory utilization rate is high, and the memory is not wasted; the reason is that: the nodes except the head and tail nodes have both data and the address of the next node, so that the discontinuous memory addresses can be occupied in the memory. And when the data in the linked list is full, the linked list rearranges the data in the combined linked list through the algorithm of the linked list and redistributes the addresses. However, since each node can only store the address of the next node, when randomly accessing data of a certain node, the node can only be traversed from the beginning until the node is found, and the access efficiency is reduced by the mechanism.
Based on this, the embodiment of the invention provides a novel data storage structure, integrates the advantages of high-efficiency access mechanism of the array, flexible expansion of the linked list and the like, and keeps the advantages of the high-efficiency access mechanism and the linked list. Specifically, the linear linked list includes address nodes and data nodes, where the address nodes store node addresses of the data nodes, and the data nodes store data contents. That is, the linear linked list is different from the existing linked list in that: data and node addresses are stored separately, address nodes are specially used for storing the node addresses of all data nodes, and all data nodes only store the data. Therefore, the advantages of the linked list can be reserved, and the advantages of the array can also be achieved.
Specifically, when data needs to be accessed, the node address of the target data node can be determined by accessing the address node.
An address node is a node dedicated to storing the node address of each data node. The address node may be any node in the linear linked list, and for convenience of operation, it is recommended that the first node in the linear linked list is preferentially selected as the address node.
In the embodiment of the present invention, the data structure for storing the node address in the address node may be an array type or a Map type. The Map is an association container, and stores a key value and an element of a mapping value, which are formed by combining, namely a key/value mode, namely a given key, and returns a value, wherein the key can be a data node ID, and the value is a node address of the data node. The manner in which the node address is accessed varies based on the data structure of the address node. Specifically, the manner of accessing the address node includes, but is not limited to, the following:
mode 1: accessing the address nodes according to an array access mode to obtain node addresses; the data structure in the address node is of the array type.
That is, if the data structure of the address node is an array type, the access of the address node needs to be performed according to the access mode of the array type. For example, when the destination data node is the 4 th one, the value corresponding to a [3] is read, and the value is the node address of the destination data node.
Mode 2: accessing the address node according to the Map access mode to obtain a node address; the data structure in the address node is of the Map type.
If the data structure in the address node is of a Map type, the access of the address node is performed according to the access mode of the Map type. For example, when the ID of the target data node is 5, the input key is 5, and a corresponding value is obtained, which is the node address corresponding to the target data node.
And S102, accessing the target data node by using the node address to obtain target data.
After the node address is obtained, the target data node is directly accessed based on the node address, and the data stored in the target data node can be accessed.
It should be noted that, according to the linear chain table provided in the embodiment, when data needs to be modified or nodes need to be deleted, the data can be directly modified and the nodes can be deleted, and if there is addition or deletion of the nodes, the corresponding node addresses need to be adjusted in the address nodes.
By applying the method provided by the embodiment of the invention, the address node in the linear linked list is accessed to obtain the node address of the target data node in the linear linked list; the linear linked list comprises address nodes and data nodes, wherein the address nodes store node addresses of the data nodes, and the data nodes store data contents; and accessing the target data node by using the node address to obtain target data.
In the method, a new linear linked list is provided, where the linear linked list includes address nodes and data nodes, where the address nodes are used to store node addresses of the data nodes, and the data nodes store data contents. Specifically, when accessing data, the node address of the target data node can be obtained by accessing the address node first, and then the node address is accessed, so that the target data node can be accessed to obtain the target data. Because the node addresses of all the data nodes of the linear linked list are stored in the address nodes, the continuous addresses among all the data nodes are not required, namely, continuous memory space is not required, and the linear linked list has the characteristic of flexible expansion; the data access does not need to traverse each data node, but directly obtains the node address from the address node, thereby accelerating the access speed and improving the data processing efficiency under the condition of ensuring the utilization rate of the memory
It should be noted that, based on the above embodiments, the embodiments of the present invention also provide corresponding improvements. In the preferred/improved embodiment, the same steps as those in the above embodiment or corresponding steps may be referred to each other, and corresponding advantageous effects may also be referred to each other, which are not described in detail in the preferred/improved embodiment herein.
In a specific embodiment of the present invention, on the basis of the above embodiment, when data needs to be inserted, new data may be inserted into the data node, and a new data address may be stored in the address node. Specifically, when new data is inserted, data writing to the data node is required, and a new data address, that is, a node address to which the new data is written, is also required to be written in the address node.
Further, the data nodes in the linear linked list provided by the embodiment of the invention can be continuous or discontinuous, so that free expansion can be realized. The specific implementation process comprises the following steps:
step one, judging whether the data is in saturation.
Judging whether the data is saturated, namely determining whether each data node in the linear linked list has written the data, and if the data nodes have been written, determining that the data is saturated; otherwise, it is not saturated.
And step two, if so, expanding the size of the linear linked list by using a linked list expansion algorithm, and inserting new data into the new data node.
Under the condition of defining the size of the storage structure, the data structure cannot be dynamically expanded when being saturated; under the condition that the size of a storage structure is not defined, the structure of a default storage address node is an array, when data in the storage structure reaches a threshold value, the structure of the storage address node is converted into a map structure, and meanwhile, addresses in current data are synchronized, so that dynamic expansion is achieved.
And expanding the size of the linear linked list, namely applying for more data nodes for the linear linked list. For how to apply for the data node, reference may be specifically made to an implementation scheme of free expansion of the linked list, which is not described in detail herein.
After the linear linked list is expanded, new data can be inserted into the new data node obtained after expansion. In particular, the node address of the new data node is also stored in the address node at the same time as the new data node is inserted.
For example, the following steps are carried out: a threshold value, such as 200, may be set within the memory structure of the address node. When the size of the storage structure is defined to be larger than or equal to 200, the data structures of the default storage address nodes are map. When the number is less than 200, the structure is an array structure. That is, if the storage structure is defined as a fixed-size storage structure, dynamic expansion is not caused, and the structure of the storage address is not changed; if the storage structure is defined as a storage structure with unfixed size, the storage structure can be dynamically expanded.
And step three, if not, inserting new data into the data node.
If the data is not saturated, the new data is inserted directly into the data node. In particular, the node address of the data node is also stored in the address node while inserting new data into the data node.
In a specific implementation manner of the present invention, the linear linked list provided in the above embodiment may also be created according to the data quantity. The specific creating implementation process comprises the following steps:
step one, acquiring the quantity of data to be stored.
When a user needs to create a linear linked list, the amount of data to be stored can be set through an input device. That is, the data amount may be obtained by acquiring a specific numerical value input by the input device. Of course, the data amount can be transferred by other upper layer applications.
And step two, creating a target linear linked list matched with the data quantity.
Generally, one data node stores one data, and thus, the same number of data nodes as the number of data can be created. For the address node, the size of the address node may be determined according to the size of the data amount. For example, if a bytes is needed to store a node address and the amount of data is b, the size of the address node is at least the product of a and b.
In a specific embodiment of the present invention, considering that a data storage structure of a node address in an address node may have an influence on node address acquisition efficiency, memory size, and the like, the linked list creating process may include:
And 2, judging whether the data quantity is larger than a threshold value.
And 3, if so, creating the address node with the data structure of the Map type.
And 4, if not, creating the address node with the data structure of the array type.
For convenience of description, the above 4 steps will be described in combination.
Firstly, creating data nodes matched with the data quantity, and then selecting a Map type as a data structure of an address node under the condition that the data quantity is greater than a threshold value; in the case that the amount of data is not greater than the threshold, the array type is selected as the data structure of the address node.
The threshold value can be set according to the actual application requirements, and the value can be specifically a value with obvious reminding on advantages and disadvantages of an array and a linked list. For example, beyond this value (e.g., 200, although other values are possible), the Map type is more advantageous, and beyond this value, the array type is more advantageous. Therefore, the address node is accessed, the data node address can be efficiently taken, and then the information/data can be acquired through the data node address.
For example, if the data type is a Map type, the overall structure of the created target linear linked list may refer to fig. 4. In fig. 4, the left part corresponds to the address node and the right part corresponds to the data node.
Corresponding to the above method embodiments, the embodiments of the present invention further provide a data processing apparatus, and the data processing apparatus described below and the data processing method described above may be referred to in correspondence with each other.
Referring to fig. 5, the apparatus includes the following modules:
a node address obtaining module 100, configured to access an address node in a linear linked list, and obtain a node address of a target data node in the linear linked list; the linear linked list comprises address nodes and data nodes, wherein the address nodes store node addresses of the data nodes, and the data nodes store data contents;
and a data access module 200 for accessing the target data node by using the node address.
By applying the device provided by the embodiment of the invention, the address node in the linear linked list is accessed to obtain the node address of the target data node in the linear linked list; the linear linked list comprises address nodes and data nodes, wherein the address nodes store node addresses of the data nodes, and the data nodes store data contents; and accessing the target data node by using the node address to obtain target data.
In the device, a new linear linked list is provided, where the linear linked list includes address nodes and data nodes, where the address nodes are used to store node addresses of the data nodes, and the data nodes store data contents. Specifically, when accessing data, the node address of the target data node can be obtained by accessing the address node first, and then the node address is accessed, so that the target data node can be accessed to obtain the target data. Because the node addresses of all the data nodes of the linear linked list are stored in the address nodes, the continuous addresses among all the data nodes are not required, namely, continuous memory space is not required, and the linear linked list has the characteristic of flexible expansion; the data access does not need to traverse each data node, but directly obtains the node address from the address node, thereby accelerating the access speed and improving the data processing efficiency under the condition of ensuring the utilization rate of the memory
In one embodiment of the present invention, the method further comprises:
and the data insertion module is used for inserting new data into the data node and storing a new data address in the address node.
In a specific embodiment of the present invention, the data insertion module is specifically configured to determine whether data is in saturation; if so, expanding the size of the linear linked list by using a linked list expansion algorithm, and inserting new data into a new data node; if not, new data is inserted into the data node.
In a specific embodiment of the present invention, the node address obtaining module 100 is specifically configured to access an address node according to an array access manner, so as to obtain a node address; the data structure in the address node is of the array type.
In a specific embodiment of the present invention, the node address obtaining module 100 is specifically configured to access an address node according to a Map access manner, so as to obtain a node address; the data structure in the address node is of the Map type.
In one embodiment of the present invention, the method further comprises:
the linked list creating module is used for acquiring the quantity of data to be stored; and creating a target linear linked list matched with the data quantity.
In a specific embodiment of the present invention, the linked list creating module is specifically configured to create data nodes matching the data quantity; judging whether the data quantity is larger than a threshold value; if so, creating an address node with a data structure of a Map type; if not, the address node with the data structure of the array type is created.
Corresponding to the above method embodiment, the embodiment of the present invention further provides a data processing device, and a data processing device described below and a data processing method described above may be referred to in correspondence with each other.
Referring to fig. 6, the data processing apparatus includes:
a memory 332 for storing a computer program;
a processor 322 for implementing the steps of the data processing method of the above-described method embodiments when executing the computer program.
Specifically, referring to fig. 7, fig. 7 is a schematic diagram of a specific structure of a data processing apparatus provided in this embodiment, which may generate relatively large differences due to different configurations or performances, and may include one or more processors (CPUs) 322 (e.g., one or more processors) and a memory 332, where the memory 332 stores one or more computer applications 342 or data 344. Memory 332 may be, among other things, transient or persistent storage. The program stored in memory 332 may include one or more modules (not shown), each of which may include a sequence of instructions operating on a data processing device. Still further, the central processor 322 may be configured to communicate with the memory 332 to execute a series of instruction operations in the memory 332 on the data processing device 301.
The data processing apparatus 301 may also include one or more power supplies 326, one or more wired or wireless network interfaces 350, one or more input-output interfaces 358, and/or one or more operating systems 341.
The steps in the data processing method described above may be implemented by the structure of a data processing apparatus.
Corresponding to the above method embodiment, the embodiment of the present invention further provides a readable storage medium, and a readable storage medium described below and a data processing method described above may be referred to in correspondence with each other.
A readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the data processing method of the above-mentioned method embodiment.
The readable storage medium may be a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and various other readable storage media capable of storing program codes.
Those of skill would further appreciate that the various illustrative components and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
Claims (10)
1. A data processing method, comprising:
accessing an address node in a linear linked list to obtain a node address of a target data node in the linear linked list; the linear linked list comprises address nodes and data nodes, wherein the address nodes store node addresses of the data nodes, and the data nodes store data contents;
and accessing the target data node by using the node address to obtain target data.
2. The data processing method of claim 1, further comprising:
and inserting new data into the data node, and storing a new data address in the address node.
3. The data processing method of claim 2, wherein inserting new data into the data node comprises:
judging whether the data is in saturation;
if so, expanding the size of the linear linked list by using a linked list expansion algorithm, and inserting the new data into a new data node;
and if not, inserting the new data into the data node.
4. The data processing method of claim 1, wherein the accessing an address node in a linear linked list to obtain a node address of a target data node in the linear linked list comprises:
accessing the address node according to an array access mode to obtain the node address; the data structure in the address node is an array type.
5. The data processing method of claim 1, wherein the accessing an address node in a linear linked list to obtain a node address of a target data node in the linear linked list comprises:
accessing the address node according to a Map access mode to obtain the node address; the data structure in the address node is of a Map type.
6. The data processing method of claim 1, further comprising:
acquiring the quantity of data to be stored;
and creating a target linear linked list matched with the data quantity.
7. The data processing method of claim 6, wherein the creating a target linear linked list matching the data quantity comprises:
creating data nodes matched with the data quantity;
judging whether the data quantity is larger than a threshold value;
if so, creating an address node with a data structure of a Map type;
if not, the address node with the data structure of the array type is created.
8. A data processing apparatus, comprising:
the node address acquisition module is used for accessing the address nodes in the linear linked list and acquiring the node addresses of the target data nodes in the linear linked list; the linear linked list comprises address nodes and data nodes, wherein the address nodes store node addresses of the data nodes, and the data nodes store data contents;
and the data access module is used for accessing the target data node by using the node address to obtain target data.
9. A data processing apparatus, characterized by comprising:
a memory for storing a computer program;
a processor for implementing the steps of the data processing method according to any one of claims 1 to 7 when executing the computer program.
10. A readable storage medium, characterized in that the readable storage medium has stored thereon a computer program which, when being executed by a processor, carries out the steps of the data processing method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011026507.6A CN112035380B (en) | 2020-09-25 | 2020-09-25 | Data processing method, device and equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011026507.6A CN112035380B (en) | 2020-09-25 | 2020-09-25 | Data processing method, device and equipment and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112035380A true CN112035380A (en) | 2020-12-04 |
| CN112035380B CN112035380B (en) | 2023-02-28 |
Family
ID=73574437
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011026507.6A Active CN112035380B (en) | 2020-09-25 | 2020-09-25 | Data processing method, device and equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112035380B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113961754A (en) * | 2021-09-08 | 2022-01-21 | 南湖实验室 | Graph database system based on persistent memory |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107622020A (en) * | 2017-09-06 | 2018-01-23 | 网宿科技股份有限公司 | A kind of date storage method, access method and device |
| CN111125447A (en) * | 2019-12-22 | 2020-05-08 | 北京浪潮数据技术有限公司 | Metadata access method, device and equipment and readable storage medium |
-
2020
- 2020-09-25 CN CN202011026507.6A patent/CN112035380B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107622020A (en) * | 2017-09-06 | 2018-01-23 | 网宿科技股份有限公司 | A kind of date storage method, access method and device |
| CN111125447A (en) * | 2019-12-22 | 2020-05-08 | 北京浪潮数据技术有限公司 | Metadata access method, device and equipment and readable storage medium |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113961754A (en) * | 2021-09-08 | 2022-01-21 | 南湖实验室 | Graph database system based on persistent memory |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112035380B (en) | 2023-02-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106570018B (en) | Serialization and deserialization method, device and system and electronic equipment | |
| CN102508784B (en) | Data storage method of flash memory card in video monitoring equipment, and system thereof | |
| US9871727B2 (en) | Routing lookup method and device and method for constructing B-tree structure | |
| US20100185822A1 (en) | Multi-reader multi-writer circular buffer memory | |
| CN110109873B (en) | File management method for message queue | |
| CN102591787B (en) | The data processing method of JAVA card and device | |
| US11327939B2 (en) | Method and device for indexing dirty data in storage system page | |
| CN112035380B (en) | Data processing method, device and equipment and readable storage medium | |
| CN107451070B (en) | Data processing method and server | |
| CN110968538B (en) | Data buffering method and device | |
| CN108804571B (en) | Data storage method, device and equipment | |
| CN102270179B (en) | For the data Storage and Processing method based on sheet unit and the system thereof of CAD system | |
| CN111522827A (en) | Data updating method and device and electronic equipment | |
| CN113986775B (en) | Page table item generation method, system and device in RISC-V CPU verification | |
| CN113741411B (en) | Generation method and system of global variable point product file of distributed control system | |
| US20230168830A1 (en) | Method and apparatus for data access of nand flash file, and storage medium | |
| CN111143006B (en) | Method and device for acquiring command help information | |
| CN114238226A (en) | NVM (non volatile memory) local file management system and method based on SIMD (single instruction multiple data) instruction | |
| CN105518790B (en) | The method and device of data write-in | |
| CN113360095A (en) | Hard disk data management method, device, equipment and medium | |
| CN108874468B (en) | Application program loading method and device, computer equipment and storage medium | |
| CN109760044A (en) | A kind of data processing method and device | |
| CN112068948A (en) | Data hashing method, readable storage medium and electronic device | |
| CN118034612B (en) | Data processing method, device and storage medium | |
| JP2507399B2 (en) | Database equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |