CN111897487A - Method, apparatus, electronic device and medium for managing data - Google Patents

Abstract

The present application discloses a method, apparatus, electronic device and medium for managing data. Wherein, in this application, after acquiring the target storage area, the target storage area may be divided into a first number of storage groups based on the first preset rule, wherein each storage group has at least a storage capacity capable of storing one data to be stored , and based on the second preset rule, divide each storage group into a second number of storage sub-regions, and then use the first number of storage groups and the second number of storage sub-regions to store data to be stored. By applying the technical solution of the present application, after the data to be stored is acquired, it can be stored in a storage sub-area in the corresponding storage group in a targeted manner according to its corresponding queue identifier. Thus, the problem of storing data out of order in any cache area existing in the related art is avoided.

Description

Method, apparatus, electronic device and medium for managing data

technical field

The present application relates to data storage technology, in particular to a method, apparatus, electronic device and medium for managing data.

Background technique

Due to the rise of the communication age and society, smart devices have been continuously developed with the use of more and more users.

Among them, with the rapid development of the communication era, a large amount of data generation has become the norm. In the process of data application, it is often necessary to store the data accordingly. For example, with the development of network technology, the continuous increase of network data and the continuous improvement of network speed, the scale of network cache is also increasing. Further, for the cache field, shared cache is a common resource allocation strategy in the communication field. It has multiple queues to share storage space, which can greatly improve the cache utilization rate and make reasonable use of cache resources.

However, the shared cache structure existing in the related art occupies more management resources. Therefore, how to realize a solution that can reasonably store data has become a problem to be solved by those skilled in the art.

SUMMARY OF THE INVENTION

The embodiments of the present application provide a method, an apparatus, an electronic device, and a medium for managing data. The embodiments of the present application are used to solve the problem that the shared cache structure in the related art will occupy more management resources.

Wherein, according to an aspect of the embodiments of the present application, a method for managing data is provided, which is characterized by comprising:

Get the target storage area;

Based on the first preset rule, the target storage area is divided into a first number of storage groups, each of the storage groups at least has a storage capacity capable of storing one piece of data to be stored, wherein the storage capacity of each of the storage groups Corresponding;

Based on the second preset rule, each of the storage groups is divided into a second number of storage sub-regions, wherein the storage capacity of each of the storage sub-regions in the same storage group corresponds to;

Data to be stored is stored by using the first number of storage groups and the second number of storage sub-regions.

Optionally, in another embodiment based on the above method of the present application, after dividing each of the storage groups into a second number of storage sub-regions based on the second preset rule, the method further includes:

obtaining a third quantity of data storage queues, where the third quantity is less than or equal to the first quantity;

Allocate at least one corresponding storage group for each of the data storage queues, and establish a mapping relationship for each of the data storage queues and the corresponding storage group respectively;

Record each mapping relationship in the mapping database.

Optionally, in another embodiment based on the above method of the present application, after dividing each of the storage groups into a second number of storage sub-regions based on the second preset rule, the method further includes:

Get the storage parameters of the data to be stored;

Determine the storage queue corresponding to the data to be stored based on the storage queue identifier in the data to be stored;

determining, based on the mapping database, the first storage group mapped to the storage queue corresponding to the data to be stored;

When it is detected that the data size of the data to be stored is lower than the preset capacity, the data to be stored is stored in the first storage sub-area of the first storage group.

Optionally, in another embodiment based on the above method of the present application, after the determining the first storage group mapped to the storage queue corresponding to the data to be stored, the method includes:

When it is detected that the data size of the data to be stored is not less than the preset capacity, acquiring a priority label corresponding to the data to be stored;

When it is determined that the priority label corresponding to the data to be stored satisfies the preset priority condition, the preset priority data stored in the first storage group is cleared, and the data to be stored is stored in the first storage group. in the group;

When it is determined that the priority label corresponding to the data to be stored does not meet the preset priority condition, the data to be stored is cleared.

Optionally, in another embodiment based on the above method of the present application, after the storing the data to be stored in the first storage sub-area of the first storage group, the method includes:

Update the address offset information and team leader information of the first data storage queue, the address offset information includes queue head information and queue tail information, and the address offset information is used to represent the current data in the first storage queue. The location where data is stored, and the captain information is used to represent the storage capacity of the first data storage queue.

Optionally, in another embodiment based on the above method of the present application, after the storing the data to be stored in the first storage sub-area of the first storage group, the method includes:

detecting the remaining storage space of the first storage group;

When it is detected that the remaining storage space of the first storage group is less than the target capacity, acquiring the second storage group in an idle state;

A mapping relationship is established between the second storage group and the first data storage queue.

Optionally, in another embodiment based on the above method of the present application, the storage capacity of each of the storage groups is corresponding, including:

The storage capacity of each of the storage groups is the same;

And, the storage capacity of each of the storage sub-regions in the same storage group corresponds to, including:

In the same storage group, the storage capacity of each storage sub-area is the same.

According to another aspect of the embodiments of the present application, a device for managing data is provided, comprising:

The acquisition module is set to acquire the target storage area;

The first division module is configured to divide the target storage area into a first number of storage groups based on a first preset rule, and each storage group has at least a storage capacity capable of storing one data to be stored, wherein each storage group has a storage capacity. corresponding to the storage capacity of each of the storage groups;

The second dividing module is configured to divide each of the storage groups into a second number of storage sub-regions based on a second preset rule, wherein the storage capacity of each of the storage sub-regions in the same storage group corresponds to ;

The storage module is configured to use the first number of storage groups and the second number of storage sub-regions to store data to be stored.

According to yet another aspect of the embodiments of the present application, an electronic device is provided, comprising:

memory for storing executable instructions; and

A display for displaying with the memory to execute the executable instructions so as to complete the operation of any one of the above-mentioned methods for managing data.

According to another aspect of the embodiments of the present application, a computer-readable storage medium is provided for storing computer-readable instructions, and when the instructions are executed, the operations of any of the foregoing data management methods are performed.

In the present application, after the target storage area is acquired, the target storage area may be divided into a first number of storage groups based on the first preset rule, wherein each storage group has at least a storage capacity capable of storing one piece of data to be stored, and Based on the second preset rule, each storage group is divided into a second number of storage sub-regions, and the first number of storage groups and the second number of storage sub-regions are used to store data to be stored. By applying the technical solution of the present application, after the data to be stored is acquired, it can be stored in the storage sub-region in the corresponding storage group in a targeted manner according to its corresponding queue identifier. Thus, the problem of storing data out of order in any cache area existing in the related art is avoided.

The technical solutions of the present application will be described in further detail below through the accompanying drawings and embodiments.

Description of drawings

The accompanying drawings, which form a part of the specification, illustrate embodiments of the application and together with the description serve to explain the principles of the application.

The present application may be more clearly understood from the following detailed description with reference to the accompanying drawings, wherein:

1 is a schematic diagram of a method for managing data proposed by this application;

FIG. 2 is a schematic flowchart of the storage data proposed by this application;

Fig. 3 is another schematic flow chart of storing data proposed by this application;

4 is a schematic diagram of a method for managing data proposed by this application;

FIG. 5 is a schematic flowchart of a cache allocation of management data proposed by the present application;

6 is a schematic structural diagram of an apparatus for managing data in the application;

FIG. 7 is a schematic structural diagram of an electronic device for displaying management data of the present application.

Detailed ways

Various exemplary embodiments of the present application will now be described in detail with reference to the accompanying drawings. It should be noted that the relative arrangement of the components and steps, the numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present application unless specifically stated otherwise.

Meanwhile, it should be understood that, for the convenience of description, the dimensions of various parts shown in the accompanying drawings are not drawn in an actual proportional relationship.

The following description of at least one exemplary embodiment is merely illustrative in nature and is not intended to limit the application or its application or uses in any way.

Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail, but where appropriate, such techniques, methods, and apparatus should be considered part of the specification.

It should be noted that like numerals and letters refer to like items in the following figures, so once an item is defined in one figure, it does not require further discussion in subsequent figures.

In addition, the technical solutions between the various embodiments of the present application can be combined with each other, but must be based on the realization by those of ordinary skill in the art. When the combination of technical solutions is contradictory or cannot be realized, it should be considered that the combination of technical solutions does not exist and is not within the scope of protection claimed in this application.

It should be noted that all directional indications (such as up, down, left, right, front, back...) in the embodiments of the present application are only used to explain the relationship between the various components under a certain posture (as shown in the drawings). If the specific posture changes, the directional indication also changes accordingly.

A method for managing data according to an exemplary embodiment of the present application will be described below with reference to FIGS. 1-5 . It should be noted that the following application scenarios are only shown to facilitate understanding of the spirit and principles of the present application, and the embodiments of the present application are not limited in this respect. Rather, the embodiments of the present application can be applied to any scenario where applicable.

The present application also provides a method, device, target terminal and medium for managing data.

FIG. 1 schematically shows a flow chart of a method for managing data according to an embodiment of the present application. As shown in Figure 1, the method includes:

S101, acquiring a target storage area.

S102: Divide the target storage area into a first number of storage groups based on the first preset rule, each storage group has at least a storage capacity capable of storing one piece of data to be stored, wherein the storage capacity of each storage group is corresponding.

First of all, it should be noted that the device for obtaining the target storage area is not specifically limited in this application, for example, it may be a smart device, a server, or the like.

Likewise, the solution for storing data in this application can be applied to the field of caching. Among them, the cache refers to the memory that can perform high-speed data exchange. It exchanges data with the CPU before the memory, so the speed is very fast. L1Cache (level 1 cache) is the first level cache of the CPU. The capacity and structure of the built-in L1 cache have a great impact on the performance of the CPU, but the cache memory is composed of static RAM, and the structure is more complicated. In the case that the CPU die area cannot be too large, the capacity of the L1 cache is not large. Might be too big. Generally, the capacity of L1 cache is usually 32-256KB. L2Cache (level 2 cache) is the second-level cache of the CPU, which is divided into internal and external chips. The internal chip L2 cache runs at the same speed as the main frequency, while the external L2 cache is only half of the main frequency.

Further, the working principle of the cache is that when the CPU wants to read a piece of data, it first looks up from the CPU cache, and if it is found, it will be read immediately and sent to the CPU for processing; if it is not found, it will be read from the memory with a relatively slow rate and sent to the CPU for processing. Send it to the CPU for processing, and at the same time call the data block where the data is located into the cache, so that the entire block of data can be read from the cache in the future without calling the memory. It is this read mechanism that makes the CPU read cache hit rate very high, that is to say, most of the data that the CPU will read next time is in the CPU cache. This also greatly saves the time for the CPU to directly read the memory, and basically does not need to wait when the CPU reads the data.

S103: Divide each storage group into a second number of storage sub-regions based on the second preset rule, wherein the storage capacity of each storage sub-region in the same storage group corresponds to the storage capacity.

S104, using the first quantity of storage groups and the second quantity of storage sub-regions to store the data to be stored.

Further, in order to avoid the problem of out-of-order management of cache areas existing in the related art, the present application may first divide the target storage area into a first number of storage groups based on a first preset rule. It should be noted that each storage group has at least a storage capacity capable of storing one piece of data to be stored, and the storage capacity of each storage group is the same.

Similarly, in order to avoid the problem of out-of-order management of cache areas existing in the related art, the present application may further divide each storage group into a second number of storage sub-areas based on a second preset rule. It should be noted that the storage capacity of each storage sub-area in the same storage group is the same.

In addition, the present application does not specifically limit the first number and the second number, for example, it may be 3 or 5. Furthermore, the first number and the second number may be the same, and the first number and the second number may also be different.

In the present application, after the target storage area is acquired, the target storage area may be divided into a first number of storage groups based on the first preset rule, wherein each storage group has at least a storage capacity capable of storing one piece of data to be stored, and Based on the second preset rule, each storage group is divided into a second number of storage sub-regions, and the first number of storage groups and the second number of storage sub-regions are used to store data to be stored. By applying the technical solution of the present application, after the data to be stored is acquired, it can be stored in the storage sub-region in the corresponding storage group in a targeted manner according to its corresponding queue identifier. Thus, the problem of storing data out of order in any cache area existing in the related art is avoided.

Optionally, in a possible implementation manner of the present application, after S103 (dividing each storage group into a second number of storage sub-regions based on the second preset rule), the following steps may also be implemented:

Get the third number of data storage queues;

Allocate at least one corresponding storage group for each data storage queue, and establish a mapping relationship between each data storage queue and the corresponding storage group;

Record each mapping relationship in the mapping database.

Further, after obtaining multiple storage groups and multiple storage sub-regions, the present application can also allocate one or more storage groups for each data storage queue and establish a mapping for each data storage queue and the corresponding storage group respectively. relation. It can be understood that the storage group corresponding to the data storage queue is the storage data used to store the storage queue.

It should be noted that the third quantity in the present application should be less than or equal to the first quantity. For example, when the number of data storage queues is three, the target storage area should contain three or more storage groups. To ensure that each data storage queue is assigned a different storage group.

For example, in terms of the cache field, the following steps are explained to allocate at least one corresponding storage group to each of the data storage queues:

Step 1: Divide the entire cache into N groups, wherein the size of each group of caches is equal, and the size of each group of caches should be larger than at least one piece of data to be cached.

Step 2: In the step 1, each group of caches is further divided into G storage sub-regions of equal size, that is, a group of caches in the step 1 is a storage group composed of G storage sub-regions.

Step 3: In the step 1, the size of the number N of storage groups is related to the size of the cache management resource.

Step 4: Allocate a cache group for each enqueued data packet. For ease of management, the caches in a storage group are allocated continuously; when they are allocated to the last cache sub-region in a group, the next group of cache sub-regions is applied for, and then allocated to the corresponding data queue.

Step 5: The caches of the same set of cache sub-areas will only be allocated to one data queue.

Optionally, after dividing each storage group into a second number of storage sub-regions based on the second preset rule, the present application can also implement the following steps:

Get the storage parameters of the data to be stored;

Determine the storage queue corresponding to the data to be stored based on the storage queue identifier in the data to be stored;

determining, based on the mapping database, a first storage group mapped to the storage queue corresponding to the data to be stored;

When it is detected that the data size of the data to be stored is lower than the preset capacity, the data to be stored is stored in the first storage sub-area of the first storage group.

Further, in the present application, after the data to be stored is acquired, the storage queue corresponding to the data to be stored can be determined according to the storage queue identifier carried by the data. And according to the storage group mapped to each storage queue stored in the mapping database, the first storage group in which the data to be stored is stored is determined. and store the data to be stored in the first storage sub-area of the first storage group.

Obtain the storage parameters of the data to be stored. The storage parameters include data size parameters and storage queue identifiers.

In the present application, when the data to be stored in the cache area is obtained, the corresponding storage parameters can be obtained, wherein the storage parameters include a data size parameter and a storage queue identifier. It can be understood that the application can store the data to be stored in the corresponding data queue according to the storage queue identifier of the data to be stored.

Further, in the present application, the first storage group where the first data storage queue corresponding to the to-be-stored data is located can be determined according to the storage parameters of the to-be-stored data, and the to-be-stored data can be stored in the first storage element of the first storage group. in the area.

Wherein, the present application does not specifically limit the preset capacity, that is, the preset capacity may be a storage capacity of any value.

As shown in FIG. 2 , a schematic flowchart of a data storage proposed in the present application, it can be seen from FIG. 2 that the corresponding data to be stored can be obtained first, and the queue identifier corresponding to the data to be stored can be used to determine that it is to be sent data queue. And when it is determined that the remaining storage capacity of the data queue is greater than the data size of the data to be stored, the data to be stored can be stored in the first storage sub-area of the first storage group. It should be noted that the first storage sub-region in this application may be any block of storage sub-region in the first storage group.

Further optionally, after determining the first storage group mapped to the storage queue corresponding to the data to be stored, the present application can also implement the following steps:

When it is detected that the data size of the data to be stored is not less than the preset capacity, obtain the priority label corresponding to the data to be stored;

When it is determined that the priority label corresponding to the data to be stored satisfies the preset priority condition, clear the stored data of the preset priority of the first storage group, and store the data to be stored in the first storage group;

When it is determined that the priority label corresponding to the data to be stored does not meet the preset priority condition, the data to be stored is cleared.

As shown in FIG. 3 , it is a schematic flowchart of a data storage proposed in the present application. As can be seen from FIG. 3 , the corresponding data to be stored can be obtained first, and the queue identifier corresponding to the data to be stored is used to determine the data queue to be sent. And when it is determined that the remaining storage capacity of the data queue is greater than the data size of the data to be stored, the data to be stored can be stored in the first storage sub-area of the first storage group.

It should be noted that, when it is detected that the data size of the data to be stored is not less than the preset capacity, it means that the remaining storage space of the current data queue has no space for storing the data to be stored. Wherein, the present application needs to detect the priority label corresponding to the data to be stored, and when it meets the preset priority condition, the data to be stored is preferentially stored. For example, it may include storing the data to be stored in the first storage group after clearing the lower-priority stored data of the first storage group. Further, when it is detected that the priority label corresponding to the data to be stored does not meet the preset priority condition, it is determined that the data is not of high importance, that is, it can be directly cleared.

Further optionally, after S103 (storing the data to be stored in the first storage sub-region of the first storage group), the present application may further include a specific implementation manner, as shown in FIG. 4 , including:

S201 , based on a storage queue identifier in the data to be stored, determine a storage queue corresponding to the data to be stored.

S202 , based on the mapping database, determine a first storage group mapped to a storage queue corresponding to the data to be stored.

S203, when it is detected that the data size of the data to be stored is lower than the preset capacity, store the data to be stored in the first storage sub-region of the first storage group.

Optionally, after the data to be stored is stored in the first storage sub-region of the first storage group, the following steps may also be implemented:

Update the address offset information and team leader information of the first data storage queue. The address offset information includes team head information and team tail information. The address offset information is used to represent the position of the currently stored data in the first storage queue. is used to characterize the storage capacity of the first data storage queue.

Further, in order to make reasonable use of the cache and prevent a queue's data burst from seriously affecting other queues, a threshold should be set for the storage group that can be allocated to each queue, and the cache length of each queue should be limited. For example, the queue head address including the storage group address and the storage sub-area offset address, and the queue tail address including the storage group address and the storage sub-area offset address in each queue may be recorded. And record the captain information of the occupied storage sub-area of each queue, that is, the storage capacity of each queue.

In a possible implementation, the application can store the team head information, team tail information and team leader information in each data team respectively in three RAMs, the RAM address is the queue number, and the RAM data is the team head and team tail. , Captain information.

As can be seen from FIG. 5 , in order to perform a flow chart of cache allocation according to the address offset information and captain information of the updated first data storage queue, there are two storage sub-areas in one storage group, and the addresses are G1 and G2 respectively. , and the address of each storage group is continuously allocated during the allocation process, the offset address 0~G-1 of the storage group in use needs to be recorded; G1(0) and G2(0) represent that the storage group has not been allocated. The next allocation starts from G1(0); G1(i), G2(0), i∈[1:G-1] represent the allocation from G1(i); G1(0), G2(j), j∈ [1:G-1] means start allocation from G2(j); G1(G) or G2(G) means that the cache group has been allocated, start allocation from another cache group, and wait for the new cache group to be allocated to the second level The cache module is allocated; S323. In step S31, the number of remaining cache sub-regions can be calculated by i, j, and the formula is 2G-i-j. When the cache allocation is completed, G1, G2, i, j, etc. need to be modified.

Further, after the data is enqueued, the data frame can be written into the corresponding cache sequentially by the cache control module according to the allocated cache sub-area addresses and in the order of the cache sub-areas, and the following steps are performed:

Wherein, in updating the address offset information and captain information of the first data storage queue, the details may include:

Obtain the team leader information. The team leader information obtained at this time is the frame length before entering the team; if the team leader is zero before the data enters the team, write the first address Ph of the data into the team header information of the cache queue management module, including the cache sub-area group. address and cache sub-region offset address; update the queue tail information, write the tail address Pt of the data frame in the step S32 into the queue tail information of the cache queue management module, including the cache sub-region address and the cache sub-region offset address ;Update the captain information, and rewrite the captain information after adding the captain to the new entry frame length to get the entered captain.

S204, detecting the remaining storage space of the first storage group.

S205, when it is detected that the remaining storage space of the first storage group is less than the target capacity, acquire a second storage group in an idle state.

S206: Establish a mapping relationship between the second storage group and the first data storage queue.

Further, this application also includes the case of calling out the stored data that has been stored in the data queue:

Receive the data dequeue application, and the dequeue dispatcher initiates the dequeue application, including the dequeue queue, the number of dequeue buffer sub-areas N' and other information;

Dequeue queue query, including: query the information of the queue leader, if the length L of the queue cache sub-area is zero, it will not be queued; if L>=N', N' cache sub-areas will be output; if L<N', Then output L data;

Query the head information of the queue where the queue is located, and obtain the group address Sh of the queue head cache sub-area group and the offset address i of the buffer sub-area of the queue head;

When the dequeue command is generated, the dequeue command is generated according to the required number of dequeues. Each dequeue command corresponds to a cache sub-area that needs to be dequeued, including the address of the cache sub-area group and the offset address of the group where the cache sub-area is located; The offset address of the group where the sub-area of the team head cache is located starts from the address of the team head, and the dequeue instructions are generated in turn, and the dequeue addresses Sh(i) and Sh(i+1) are given until the number of dequeues is completed or Sh(G- 1) Up to the address, G is the number of cache sub-areas contained in the cache sub-area group; if the number of dequeuing sub-areas in the first cache sub-area group is insufficient, it needs to be dequeued from the next cache sub-area group, from the cache linked list information Obtain the address of the next cache sub-area group, and continue to generate dequeue instructions in sequence.

Further, after the dequeue instruction is generated, record the last dequeued next-hop cache sub-area address St(j); and according to the cache sub-area group address and the cache sub-area offset address in the generated dequeue instruction Read the data frames from the cache in turn; wherein, when the queue information is updated, the team head information can be updated, and the sub-area address St(j) of the middle cache can be written into the queue tail information RAM; the captain information is updated, and the captain L is subtracted The number of dequeuing cache sub-areas is rewritten into the team leader information RAM; if the last cache sub-area Sh (G-1) of a cache sub-area group is successfully dequeued when dequeuing, the cache sub-area group Sh needs to be released. Update the linked list information and free cache information in the second-level cache management; update the cache linked list information, clear the next hop address corresponding to the Sh address in the cache linked list, and set it as invalid; update the free cache FIFO, and rewrite the address Sh to the free cache FIFO.

In the present application, after the target storage area is acquired, the target storage area may be divided into a first number of storage groups based on the first preset rule, wherein each storage group has at least a storage capacity capable of storing one piece of data to be stored, and Based on the second preset rule, each storage group is divided into a second number of storage sub-regions, and the first number of storage groups and the second number of storage sub-regions are used to store data to be stored. By applying the technical solution of the present application, after the data to be stored is acquired, it can be stored in the storage sub-region in the corresponding storage group in a targeted manner according to its corresponding queue identifier. Thus, the problem of storing data out of order in any cache area existing in the related art is avoided.

In another embodiment of the present application, as shown in FIG. 6 , the present application further provides an apparatus for managing data. Wherein, the device includes an acquisition module 301, a determination module 301, and a storage module 303, wherein,

The acquisition module is set to acquire the target storage area;

The first division module is configured to divide the target storage area into a first number of storage groups based on a first preset rule, and each storage group has at least a storage capacity capable of storing one data to be stored, wherein each storage group has a storage capacity. corresponding to the storage capacity of each of the storage groups;

The second dividing module is configured to divide each of the storage groups into a second number of storage sub-regions based on a second preset rule, wherein the storage capacity of each of the storage sub-regions in the same storage group corresponds to ;

The storage module is configured to use the first number of storage groups and the second number of storage sub-regions to store data to be stored.

In the present application, after the target storage area is acquired, the target storage area may be divided into a first number of storage groups based on the first preset rule, wherein each storage group has at least a storage capacity capable of storing one piece of data to be stored, and Based on the second preset rule, each storage group is divided into a second number of storage sub-regions, and the first number of storage groups and the second number of storage sub-regions are used to store data to be stored. By applying the technical solution of the present application, after the data to be stored is acquired, it can be stored in the storage sub-region in the corresponding storage group in a targeted manner according to its corresponding queue identifier. Thus, the problem of storing data out of order in any cache area existing in the related art is avoided.

In another implementation manner of the present application, the obtaining module 301 further includes:

The obtaining module 301 is configured to obtain a third quantity of data storage queues, where the third quantity is less than or equal to the first quantity;

The acquisition module 301 is configured to allocate at least one corresponding storage group to each of the data storage queues, and to establish a mapping relationship between each of the data storage queues and the corresponding storage group;

The acquiring module 301 is configured to record each mapping relationship into a mapping database.

In another implementation manner of the present application, the obtaining module 301 further includes:

an acquisition module 301, configured to acquire the storage parameters of the data to be stored;

The acquiring module 301 is configured to determine the storage queue corresponding to the data to be stored based on the storage queue identifier in the data to be stored;

The acquiring module 301 is configured to, based on the mapping database, determine the first storage group mapped to the storage queue corresponding to the data to be stored;

The obtaining module 301 is configured to store the data to be stored in the first storage sub-region of the first storage group when it is detected that the data size of the data to be stored is lower than a preset capacity.

In another implementation manner of the present application, the obtaining module 301 further includes:

The obtaining module 301 is configured to obtain a priority label corresponding to the data to be stored when it is detected that the data size of the data to be stored is not less than the preset capacity;

The obtaining module 301 is configured to, when it is determined that the priority label corresponding to the data to be stored satisfies a preset priority condition, clear the preset priority data stored in the first storage group, and store the data to be stored. stored in the first storage group;

The obtaining module 301 is configured to clear the data to be stored when it is determined that the priority label corresponding to the data to be stored does not meet the preset priority condition.

In another embodiment of the present application, it also includes an update module 304, wherein:

The update module 304 is configured to update the address offset information and team leader information of the first data storage queue, where the address offset information includes queue head information and queue tail information, and the address offset information is used to represent the The position of the currently stored data in the first storage queue, and the captain information is used to represent the storage capacity of the first data storage queue.

In another embodiment of the present application, the update module 304 further includes:

an update module 304, configured to detect the remaining storage space of the first storage group;

The update module 304 is configured to acquire the second storage group in an idle state when it is detected that the remaining storage space of the first storage group is less than the target capacity;

The updating module 304 is configured to establish a mapping relationship between the second storage group and the first data storage queue.

In another embodiment of the present application, the storage capacity of each of the storage groups is the same;

And, the storage capacity of each of the storage sub-regions in the same storage group corresponds to, including:

In the same storage group, the storage capacity of each storage sub-area is the same.

Fig. 7 is a block diagram of a logical structure of an electronic device according to an exemplary embodiment. For example, electronic device 400 may be a mobile phone, computer, digital broadcast terminal, messaging device, game console, tablet device, medical device, fitness device, personal digital assistant, and the like.

Referring to FIG. 7 , an electronic device 400 may include one or more of the following components: a processor 401 and a memory 402 .

The processor 401 may include one or more processing cores, such as a 4-core processor, an 8-core processor, and the like. The processor 401 may use at least one hardware form of DSP (Digital Signal Processing, digital signal processing), FPGA (Field-Programmable Gate Array, field programmable gate array), and PLA (Programmable Logic Array, programmable logic array). accomplish. The processor 401 may also include a main processor and a coprocessor. The main processor is a processor used to process data in a wake-up state, also called a CPU (Central Processing Unit, central processing unit); A low-power processor for processing data in a standby state. In some embodiments, the processor 401 may be integrated with a GPU (Graphics Processing Unit, image processor), and the GPU is used for rendering and drawing the content that needs to be displayed on the display screen. In some embodiments, the processor 401 may further include an AI (Artificial Intelligence, artificial intelligence) processor, where the AI processor is used to process computing operations related to machine learning.

Memory 402 may include one or more computer-readable storage media, which may be non-transitory. Memory 402 may also include high-speed random access memory, as well as non-volatile memory, such as one or more disk storage devices, flash storage devices. In some embodiments, the non-transitory computer-readable storage medium in the memory 402 is used to store at least one instruction, and the at least one instruction is used to be executed by the processor 401 to realize the interactive special effects provided by the method embodiments in this application. Calibration method.

In some embodiments, the electronic device 400 may optionally further include: a peripheral device interface 403 and at least one peripheral device. The processor 401, the memory 402 and the peripheral device interface 403 may be connected through a bus or a signal line. Each peripheral device can be connected to the peripheral device interface 403 through a bus, a signal line or a circuit board. Specifically, the peripheral device includes: at least one of a radio frequency circuit 404 , a touch display screen 405 , a camera 406 , an audio circuit 407 , a positioning component 408 and a power supply 409 .

The peripheral device interface 403 may be used to connect at least one peripheral device related to I/O (Input/Output) to the processor 401 and the memory 402 . In some embodiments, processor 401, memory 402, and peripherals interface 403 are integrated on the same chip or circuit board; in some other embodiments, any one of processor 401, memory 402, and peripherals interface 403 or The two can be implemented on a separate chip or circuit board, which is not limited in this embodiment.

The radio frequency circuit 404 is used for receiving and transmitting RF (Radio Frequency, radio frequency) signals, also called electromagnetic signals. The radio frequency circuit 404 communicates with the communication network and other communication devices via electromagnetic signals. The radio frequency circuit 404 converts electrical signals into electromagnetic signals for transmission, or converts received electromagnetic signals into electrical signals. Optionally, the radio frequency circuit 404 includes an antenna system, an RF transceiver, one or more amplifiers, a tuner, an oscillator, a digital signal processor, a codec chipset, a subscriber identity module card, and the like. The radio frequency circuit 404 may communicate with other terminals through at least one wireless communication protocol. The wireless communication protocol includes but is not limited to: metropolitan area network, mobile communication networks of various generations (2G, 3G, 4G and 5G), wireless local area network and/or WiFi (Wireless Fidelity, wireless fidelity) network. In some embodiments, the radio frequency circuit 404 may further include a circuit related to NFC (Near Field Communication, short-range wireless communication), which is not limited in this application.

The display screen 405 is used for displaying UI (User Interface, user interface). The UI can include graphics, text, icons, video, and any combination thereof. When the display screen 405 is a touch display screen, the display screen 405 also has the ability to acquire touch signals on or above the surface of the display screen 405 . The touch signal may be input to the processor 401 as a control signal for processing. At this time, the display screen 405 may also be used to provide virtual buttons and/or virtual keyboards, also referred to as soft buttons and/or soft keyboards. In some embodiments, there may be one display screen 405, which is provided on the front panel of the electronic device 400; in other embodiments, there may be at least two display screens 405, which are respectively provided on different surfaces of the electronic device 400 or in a folded design. ; In still other embodiments, the display screen 405 may be a flexible display screen, disposed on a curved surface or a folding surface of the electronic device 400 . Even, the display screen 405 can also be set as a non-rectangular irregular figure, that is, a special-shaped screen. The display screen 405 can be made of materials such as LCD (Liquid Crystal Display, liquid crystal display), OLED (Organic Light-Emitting Diode, organic light emitting diode).

The camera assembly 406 is used to capture images or video. Optionally, the camera assembly 406 includes a front camera and a rear camera. Usually, the front camera is arranged on the front panel of the terminal, and the rear camera is arranged on the back of the terminal. In some embodiments, there are at least two rear cameras, which are any one of a main camera, a depth-of-field camera, a wide-angle camera, and a telephoto camera, so as to realize the fusion of the main camera and the depth-of-field camera to realize the background blur function, the main camera It is integrated with the wide-angle camera to achieve panoramic shooting and VR (Virtual Reality, virtual reality) shooting functions or other integrated shooting functions. In some embodiments, the camera assembly 406 may also include a flash. The flash can be a single color temperature flash or a dual color temperature flash. Dual color temperature flash refers to the combination of warm light flash and cold light flash, which can be used for light compensation under different color temperatures.

Audio circuitry 407 may include a microphone and speakers. The microphone is used to collect the sound waves of the user and the environment, convert the sound waves into electrical signals, and input them to the processor 401 for processing, or to the radio frequency circuit 404 to realize voice communication. For the purpose of stereo acquisition or noise reduction, there may be multiple microphones, which are respectively disposed in different parts of the electronic device 400 . The microphone may also be an array microphone or an omnidirectional collection microphone. The speaker is used to convert the electrical signal from the processor 401 or the radio frequency circuit 404 into sound waves. The loudspeaker can be a traditional thin-film loudspeaker or a piezoelectric ceramic loudspeaker. When the speaker is a piezoelectric ceramic speaker, it can not only convert electrical signals into sound waves audible to humans, but also convert electrical signals into sound waves inaudible to humans for distance measurement and other purposes. In some embodiments, audio circuitry 407 may also include a headphone jack.

The positioning component 408 is used to locate the current geographic location of the electronic device 400 to implement navigation or LBS (Location Based Service). The positioning component 408 may be a positioning component based on the GPS (Global Positioning System, global positioning system) of the United States, the Beidou system of China, the Grenas system of Russia, or the Galileo system of the European Union.

Power supply 409 is used to power various components in electronic device 400 . The power source 409 may be alternating current, direct current, disposable batteries or rechargeable batteries. When the power source 409 includes a rechargeable battery, the rechargeable battery can support wired charging or wireless charging. The rechargeable battery can also be used to support fast charging technology.

In some embodiments, the electronic device 400 also includes one or more sensors 410 . The one or more sensors 410 include, but are not limited to, an acceleration sensor 411 , a gyro sensor 412 , a pressure sensor 413 , a fingerprint sensor 414 , an optical sensor 415 and a proximity sensor 416 .

The acceleration sensor 411 can detect the magnitude of acceleration on the three coordinate axes of the coordinate system established by the electronic device 400 . For example, the acceleration sensor 411 can be used to detect the components of the gravitational acceleration on the three coordinate axes. The processor 401 may control the touch display screen 405 to display the user interface in a landscape view or a portrait view according to the gravitational acceleration signal collected by the acceleration sensor 411 . The acceleration sensor 411 can also be used for game or user movement data collection.

The gyroscope sensor 412 can detect the body direction and rotation angle of the electronic device 400 , and the gyroscope sensor 412 can cooperate with the acceleration sensor 411 to collect 3D actions of the user on the electronic device 400 . The processor 401 can implement the following functions according to the data collected by the gyro sensor 412 : motion sensing (such as changing the UI according to the user's tilt operation), image stabilization during shooting, game control, and inertial navigation.

The pressure sensor 413 may be disposed on the side frame of the electronic device 400 and/or the lower layer of the touch display screen 405 . When the pressure sensor 413 is disposed on the side frame of the electronic device 400 , the user's holding signal of the electronic device 400 can be detected, and the processor 401 can perform left and right hand identification or quick operation according to the holding signal collected by the pressure sensor 413 . When the pressure sensor 413 is disposed on the lower layer of the touch display screen 405 , the processor 401 controls the operability controls on the UI interface according to the user's pressure operation on the touch display screen 405 . The operability controls include at least one of button controls, scroll bar controls, icon controls, and menu controls.

The fingerprint sensor 414 is used to collect the user's fingerprint, and the processor 401 identifies the user's identity according to the fingerprint collected by the fingerprint sensor 414, or the fingerprint sensor 414 identifies the user's identity according to the collected fingerprint. When the user's identity is identified as a trusted identity, the processor 401 authorizes the user to perform relevant sensitive operations, including unlocking the screen, viewing encrypted information, downloading software, making payments, and changing settings. The fingerprint sensor 414 may be provided on the front, back, or side of the electronic device 400 . When the electronic device 400 is provided with physical buttons or a manufacturer's logo, the fingerprint sensor 414 may be integrated with the physical buttons or the manufacturer's logo.

Optical sensor 415 is used to collect ambient light intensity. In one embodiment, the processor 401 can control the display brightness of the touch display screen 405 according to the ambient light intensity collected by the optical sensor 415 . Specifically, when the ambient light intensity is high, the display brightness of the touch display screen 405 is increased; when the ambient light intensity is low, the display brightness of the touch display screen 405 is decreased. In another embodiment, the processor 401 may also dynamically adjust the shooting parameters of the camera assembly 406 according to the ambient light intensity collected by the optical sensor 415 .

Proximity sensor 416 , also referred to as a distance sensor, is typically provided on the front panel of electronic device 400 . Proximity sensor 416 is used to collect the distance between the user and the front of electronic device 400 . In one embodiment, when the proximity sensor 416 detects that the distance between the user and the front of the electronic device 400 gradually decreases, the processor 401 controls the touch display screen 405 to switch from the bright screen state to the off screen state; when the proximity sensor 416 When it is detected that the distance between the user and the front of the electronic device 400 gradually increases, the processor 401 controls the touch display screen 405 to switch from the off-screen state to the bright-screen state.

Those skilled in the art can understand that the structure shown in FIG. 7 does not constitute a limitation on the electronic device 400, and may include more or less components than the one shown, or combine some components, or adopt different component arrangements.

In an exemplary embodiment, a non-transitory computer-readable storage medium including instructions, such as a memory 404 including instructions, is also provided, and the above-mentioned instructions can be executed by the processor 420 of the electronic device 400 to complete the above-mentioned method of managing data, The method includes: acquiring a target storage area; based on a first preset rule, dividing the target storage area into a first number of storage groups, each storage group having at least a storage capacity capable of storing one data to be stored, wherein The storage capacity of each of the storage groups is corresponding; based on the second preset rule, each of the storage groups is divided into a second number of storage sub-regions, wherein in the same storage group, the storage capacity of each of the storage sub-regions is The storage capacity is corresponding; the data to be stored is stored by using the first quantity of storage groups and the second quantity of storage sub-areas. Optionally, the above-mentioned instructions may also be executed by the processor 420 of the electronic device 400 to complete other steps involved in the above-mentioned exemplary embodiments. For example, the non-transitory computer-readable storage medium may be ROM, random access memory (RAM), CD-ROM, magnetic tape, floppy disk, optical data storage device, and the like.

In an exemplary embodiment, an application program/computer program product is also provided, including one or more instructions, which can be executed by the processor 420 of the electronic device 400 to complete the above-mentioned method of managing data , the method includes: obtaining a target storage area; based on a first preset rule, dividing the target storage area into a first number of storage groups, each of the storage groups having at least a storage capacity capable of storing one data to be stored, The storage capacity of each of the storage groups corresponds to each other; based on the second preset rule, each of the storage groups is divided into a second number of storage sub-regions, wherein each of the storage sub-regions in the same storage group The storage capacity corresponds to the storage capacity; the storage data to be stored is stored by using the first quantity of storage groups and the second quantity of storage sub-areas. Optionally, the above-mentioned instructions may also be executed by the processor 420 of the electronic device 400 to complete other steps involved in the above-mentioned exemplary embodiments.

Other embodiments of the present application will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses or adaptations of this application that follow the general principles of this application and include common knowledge or conventional techniques in the technical field not disclosed in this application . The specification and examples are to be regarded as exemplary only, with the true scope and spirit of the application being indicated by the following claims.

It is to be understood that the present application is not limited to the precise structures described above and shown in the accompanying drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.

Claims (10)

1. A method for managing data, comprising: Get the target storage area; Based on the first preset rule, the target storage area is divided into a first number of storage groups, each of the storage groups at least has a storage capacity capable of storing one piece of data to be stored, wherein the storage capacity of each of the storage groups Corresponding; Based on the second preset rule, each of the storage groups is divided into a second number of storage sub-regions, wherein the storage capacity of each of the storage sub-regions in the same storage group corresponds to; Data to be stored is stored by using the first number of storage groups and the second number of storage sub-regions. 2. The method according to claim 1, wherein after dividing each of the storage groups into a second number of storage sub-regions based on the second preset rule, the method further comprises: obtaining a third quantity of data storage queues, where the third quantity is less than or equal to the first quantity; Allocate at least one corresponding storage group for each of the data storage queues, and establish a mapping relationship for each of the data storage queues and the corresponding storage group respectively; Record each mapping relationship in the mapping database. 3. The method of claim 1, wherein after dividing each of the storage groups into a second number of storage sub-regions based on the second preset rule, further comprising: obtaining the storage parameters of the data to be stored; Determine the storage queue corresponding to the data to be stored based on the storage queue identifier in the data to be stored; determining, based on the mapping database, the first storage group mapped to the storage queue corresponding to the data to be stored; When it is detected that the data size of the data to be stored is lower than the preset capacity, the data to be stored is stored in the first storage sub-area of the first storage group. 4. The method according to claim 3, wherein after the determining the first storage group mapped to the storage queue corresponding to the data to be stored, the method comprises: When it is detected that the data size of the data to be stored is not less than the preset capacity, acquiring a priority label corresponding to the data to be stored; When it is determined that the priority label corresponding to the data to be stored satisfies the preset priority condition, the preset priority data stored in the first storage group is cleared, and the data to be stored is stored in the first storage group. in the group; When it is determined that the priority label corresponding to the data to be stored does not meet the preset priority condition, the data to be stored is cleared. 5. The method according to claim 3, wherein after storing the data to be stored in the first storage sub-region of the first storage group, the method comprises: Update the address offset information and team leader information of the first data storage queue, the address offset information includes queue head information and queue tail information, and the address offset information is used to represent the current data in the first storage queue. The location where data is stored, and the captain information is used to represent the storage capacity of the first data storage queue. 6. The method according to claim 5, wherein after storing the data to be stored in the first storage sub-region of the first storage group, the method comprises: detecting the remaining storage space of the first storage group; When it is detected that the remaining storage space of the first storage group is less than the target capacity, acquiring the second storage group in an idle state; A mapping relationship is established between the second storage group and the first data storage queue. 7. The method according to any one of claims 1-6, wherein the storage capacity of each of the storage groups is corresponding, comprising: The storage capacity of each of the storage groups is the same; And, the storage capacity of each of the storage sub-regions in the same storage group corresponds to, including: In the same storage group, the storage capacity of each storage sub-area is the same. 8. A device for managing data, comprising: The acquisition module is set to acquire the target storage area; The first division module is configured to divide the target storage area into a first number of storage groups based on a first preset rule, and each storage group has at least a storage capacity capable of storing one data to be stored, wherein each storage group has a storage capacity. corresponding to the storage capacity of each of the storage groups; The second dividing module is configured to divide each of the storage groups into a second number of storage sub-regions based on a second preset rule, wherein the storage capacity of each of the storage sub-regions in the same storage group corresponds to ; The storage module is configured to use the first number of storage groups and the second number of storage sub-regions to store data to be stored. 9. An electronic device, characterized in that, comprising: memory for storing executable instructions; and, a processor for interacting with the memory to execute the executable instructions to perform operations of the method of managing data of any one of claims 1-7. 10. A computer-readable storage medium for storing computer-readable instructions, wherein when the instructions are executed, the operations of the method for managing data according to any one of claims 1-7 are performed.

Images