CN111897487B - Method, device, electronic equipment and medium for managing data - Google Patents

Abstract

The application discloses a method, a device, electronic equipment and a medium for managing data. In the application, after the target storage area is acquired, the target storage area can be divided into a first number of storage groups based on a first preset rule, wherein each storage group at least has a storage capacity capable of storing one piece of data to be stored, each storage group is divided into a second number of storage subareas based on a second preset rule, and the first number of storage groups and the second number of storage subareas are utilized to store the data to be stored. By applying the technical scheme of the application, after the data to be stored is acquired, the data can be stored into the storage subareas in the corresponding storage groups in a targeted manner according to the corresponding queue identifications. Thereby avoiding the problem of unordered data storage in any cache area in the related art.

Description

Method, device, electronic device and medium for managing data

technical field

This application relates to data storage technology, especially a method, device, 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, the generation of a large amount of data has become a norm. In the process of data application, it is often necessary to store the data correspondingly. 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. Furthermore, 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 cache utilization and rationally utilize cache resources.

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

Contents of the invention

Embodiments of the present application provide a data management method, device, electronic device, and medium. The embodiments of the present application are used to solve the problem in the related art that the shared cache structure occupies more management resources.

Among them, according to an aspect of the embodiments of the present application, a method for managing data is provided, which is characterized in that it includes:

Get the target storage area;

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

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

The data to be stored is stored by using the first number of storage groups and the second number of storage sub-areas.

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-areas based on the second preset rule, the method further includes:

Acquiring a third number of data storage queues, the third number being less than or equal to the first number;

Allocating at least one corresponding storage group to each of the data storage queues, and establishing a mapping relationship between each of the data storage queues and the corresponding storage group;

Record each mapping relationship into 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-areas based on the second preset rule, the method further includes:

Obtain the storage parameters of the data to be stored;

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

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

When it is detected that the data size of the data to be stored is lower than a 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 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 lower than the preset capacity, acquiring a priority tag corresponding to the data to be stored;

When it is determined that the priority tag 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 in the first storage group group;

When it is determined that the priority label corresponding to the data to be stored does not satisfy 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 storing the data to be stored in the first storage sub-area of the first storage group, the method includes:

Updating 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 currently existing data in the first storage queue The location where the data is stored, and the captain information is used to characterize the storage capacity of the first data storage queue.

Optionally, in another embodiment based on the above method of the present application, after 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 a second storage group in an idle state;

Establish a mapping relationship 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 storage group is corresponding, including:

each of said storage groups has the same storage capacity;

And, the storage capacity of each storage sub-area in the same storage group is corresponding, 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, including:

an acquisition module configured to acquire a target storage area;

The first dividing 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 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-areas to store data to be stored.

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

memory for storing executable instructions; and

A display, configured to display with the memory to execute the executable instructions to complete the operation of any one of the methods for managing data above.

According to still another aspect of the embodiments of the present application, there is provided a computer-readable storage medium for storing computer-readable instructions, and when the instructions are executed, operations of any one of the methods for managing data described above are performed.

In this application, after the target storage area is acquired, the target storage area may be divided into a first number of storage groups based on a 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, each storage group is divided into a second number of storage sub-areas, and then the first number of storage groups and the second number of storage sub-areas are used to store the 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-area of the corresponding storage group according to its corresponding queue identifier. Thus, the problem of disorderly storing data 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 with reference to the drawings and embodiments.

Description of drawings

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

The present application can be more clearly understood from the following detailed description with reference to the accompanying drawings, in which:

FIG. 1 is a schematic diagram of a method for managing data proposed in this application;

Fig. 2 is a schematic flow chart of the stored data proposed by the present application;

FIG. 3 is a schematic flow diagram of another storage data proposed by the present application;

FIG. 4 is a schematic diagram of a method for managing data proposed by the present application;

FIG. 5 is a schematic diagram of a buffer allocation process for management data proposed by the present application;

FIG. 6 is a schematic structural diagram of a device for managing data in the present application;

FIG. 7 is a schematic structural diagram of an electronic device for displaying management data in 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 arrangements of components and steps, numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present application unless specifically stated otherwise.

At the same time, it should be understood that, for the convenience of description, the sizes of the various parts shown in the drawings are not drawn according to the actual proportional relationship.

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

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

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

In addition, the technical solutions of the various embodiments of the present application can be combined with each other, but it must be based on the realization of those skilled in the art. When the combination of technical solutions is contradictory or cannot be realized, it should be considered as a combination of technical solutions. Does not exist, nor is it within the scope of protection required by 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 If the specific posture changes, the directional indication will also change accordingly.

A method for managing data according to an exemplary embodiment of the present application is described below with reference to FIGS. 1-5 . It should be noted that the following application scenarios are only shown for easy understanding of the spirit and principle of the present application, and the implementation manners of the present application are not limited in this respect. On the contrary, the embodiments of the present application can be applied to any applicable scene.

The present application also proposes a data management method, device, target terminal and medium.

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

S101. Obtain a target storage area.

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

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 or a server.

Similarly, the solution for storing data in this application can be applied to the cache field. 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 layer of CPU cache. The capacity and structure of the built-in L1 cache have a great influence on the performance of the CPU. However, the cache memory is composed of static RAM, and the structure is relatively complicated. When the CPU die area cannot be too large, the capacity of the L1 cache is not large. Might be too big. The capacity of the general L1 cache is usually 32-256KB. L2Cache (second-level cache) is the second-level cache of the CPU, which is divided into internal and external chips. The internal on-chip L2 cache runs at the same speed as the main frequency, while the external L2 cache runs at half the main frequency.

Furthermore, the working principle of the cache is that when the CPU wants to read a piece of data, it first searches it from the CPU cache, and if it finds it, it reads it immediately and sends it to the CPU for processing; if it does not find it, it reads it from the relatively slow memory and sends it to the CPU Send it to the CPU for processing, and at the same time transfer 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 reading mechanism that makes the hit rate of the CPU read cache very high, which means that 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 for the CPU to read data.

S103. Based on a second preset rule, divide each storage group into a second number of storage sub-areas, where the storage capacity of each storage sub-area in the same storage group is corresponding.

S104. Use the first number of storage groups and the second number of storage sub-areas to store the data to be stored.

Further, in order to avoid the problem of out-of-order management of the cache area 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 each storage group has the same storage capacity.

Likewise, in order to avoid the problem of out-of-order management of cache areas 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, they may be 3 or 5. Furthermore, the first quantity and the second quantity may be the same, or the first quantity and the second quantity may be different.

In this application, after the target storage area is acquired, the target storage area may be divided into a first number of storage groups based on a 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, each storage group is divided into a second number of storage sub-areas, and then the first number of storage groups and the second number of storage sub-areas are used to store the 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-area of the corresponding storage group according to its corresponding queue identifier. Thus, the problem of disorderly storing data 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-areas based on the second preset rule), the following steps may also be implemented:

Obtain a third number of data storage queues;

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

Record each mapping relationship into the mapping database.

Furthermore, after the application obtains multiple storage groups and multiple storage sub-areas, it can also assign one or more storage groups to each data storage queue and establish a mapping for each data storage queue and the corresponding storage group relation. It can be understood that the storage group corresponding to the data storage queue is used to store the storage data of the storage queue.

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

For example, in the field of caching, the following steps explain the allocation of at least one corresponding storage group for each of the data storage queues:

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

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

Step 3: In the step 1, the size of the storage group number N 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, caches in a storage group are allocated continuously; when allocated to the last cache sub-area in a group, apply for the next set of cache sub-areas, and then allocate to the corresponding data queue.

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

Optionally, after the present application divides each storage group into a second number of storage sub-areas based on the second preset rule, the following steps may also be implemented:

Obtain the storage parameters of the data to be stored;

Based on the storage queue identifier in the data to be stored, determine the storage queue corresponding to the data to be stored;

Based on the mapping database, determine 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.

Further, in this application, after the data to be stored is acquired, the storage queue corresponding to the data to be stored may be determined according to the storage queue identifier carried by it. And according to the storage group mapped to each storage queue stored in the mapping database, determine the first storage group where the data to be stored is stored. 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 this application, when the data to be stored in the cache area is obtained, its corresponding storage parameters may be obtained, where the storage parameters include data size parameters and storage queue identifiers. It can be understood that the present application may 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 this application, according to the storage parameters of the data to be stored, the first storage group in which the first data storage queue corresponding to the data to be stored is located is determined, and the data to be stored is stored in the first storage sub-group 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 Figure 2, it is a schematic flow diagram of a data storage proposed by the present application. It can be seen from Figure 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 the data 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-area in this application may be any storage sub-area in the first storage group.

Further optionally, after the application determines the first storage group mapped to the storage queue corresponding to the data to be stored, the following steps may also be implemented:

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

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

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

As shown in FIG. 3 , it is a schematic flow chart of a data storage proposed in this application. It can be seen from FIG. 3 that the corresponding data to be stored may be obtained first, and the queue identifier corresponding to the data to be stored may be 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 lower 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 tag corresponding to the data to be stored, and when it meets the preset priority condition, the data to be stored is stored preferentially. For example, it may include clearing the stored data of lower priority in the first storage group, and then storing the data to be stored in the first storage group. Further, when it is detected that the priority tag corresponding to the data to be stored does not meet the preset priority condition, it is judged that the data is not of high importance, that is, it can be cleared directly.

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

S201. Based on the 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 the 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-area of the first storage group.

Optionally, after the data to be stored is stored in the first storage sub-area 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, and the team leader information uses is used to represent the storage capacity of the first data storage queue.

Furthermore, 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 to limit the cache length of each queue. For example, the head address of each queue including the address of the storage group and the offset address of the storage sub-area, and the address of the tail of the queue including the address of the storage group and the offset address of the storage sub-area 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, this application can store the team leader information, team tail information and captain information in each data team in three RAMs respectively, the RAM address is the queue number, and the RAM data is the team leader and team tail information. , captain information.

It can be seen from Fig. 5 that it is a flow chart of cache allocation based on updating the address offset information and captain information of the first data storage queue, wherein 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 assigned continuously during the allocation process, it is necessary to record the offset address 0~G-1 of the storage group in use; G1(0), G2(0) represent that the storage group has not been allocated, Allocation starts from G1(0) next time; G1(i), G2(0), i∈[1:G-1] means allocation starts from G1(i); G1(0), G2(j), j∈ [1:G-1] means to 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 secondary The cache module is allocated; S323. In the step S31, the number of remaining cache sub-areas can be calculated by i, j, and the formula is 2G-i-j. When the cache is allocated, G1, G2, i, j, etc. need to be modified.

Further, after the data is enqueued, the cache control module can write the data frame into the corresponding cache sequentially according to the address of the allocated cache sub-area and in the order of the cache sub-area and implement the following steps:

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

Obtain the captain information, the captain information obtained at this time is the frame length before entering the queue; if the captain is zero before the data enters the queue, write the data head address Ph into the queue header information of the cache queue management module, including the cache sub-area group Address and cache sub-area offset address; update team tail information, write the tail address Pt of the data frame in the step S32 in the team tail information of the cache queue management module, including cache sub-area address and cache sub-area offset address ;Update the captain information, add the captain plus the newly joined frame length to get the captain after entering the team and rewrite it into the captain information.

S204. Detect 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 already 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 cache sub-areas N' and other information;

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

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

When the dequeue command is generated, the dequeue command is generated according to the number of dequeues required. Each dequeue command corresponds to a cache sub-area that needs to be de-queue, including the address of the cache sub-area group, and the offset address of the group where the cache sub-area is located; from The offset address of the group where the team head cache sub-area is located starts from the address of the team head, and sequentially generates dequeue commands, and gives the dequeue addresses Sh(i), Sh(i+1) 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 cache sub-area group dequeues at the head of the team is insufficient, it is necessary to dequeue from the next cache sub-area group, from the cache link list information After obtaining the address of the next cache sub-region group, continue to generate dequeuing instructions in sequence.

Further, after the dequeue instruction is generated, record the last dequeue next-hop cache sub-area address St(j); and according to the cache sub-area group address and cache sub-area offset address in the dequeue command generated Read data frames from the cache in turn; wherein, when the queue information is updated, the team head information can be updated, and the middle cache sub-area address St(j) is written in the team tail information RAM; the team leader information is updated, and the team leader L is subtracted from The number of cache sub-areas to be dequeued is rewritten in the captain information RAM; if the last cache sub-area Sh (G-1) of a cache sub-area group is dequeued successfully when dequeuing, the cache sub-area group Sh needs to be released. Update the linked list information and idle cache information in the secondary 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 to invalid; update the idle cache FIFO, and rewrite the address Sh into the idle cache in the FIFO.

In this application, after the target storage area is acquired, the target storage area may be divided into a first number of storage groups based on a 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, each storage group is divided into a second number of storage sub-areas, and then the first number of storage groups and the second number of storage sub-areas are used to store the 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-area of the corresponding storage group according to its corresponding queue identifier. Thus, the problem of disorderly storing data in any cache area existing in the related art is avoided.

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

an acquisition module configured to acquire a target storage area;

The first dividing 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 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-areas to store data to be stored.

In this application, after the target storage area is acquired, the target storage area may be divided into a first number of storage groups based on a 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, each storage group is divided into a second number of storage sub-areas, and then the first number of storage groups and the second number of storage sub-areas are used to store the 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-area of the corresponding storage group according to its corresponding queue identifier. Thus, the problem of disorderly storing data in any cache area existing in the related art is avoided.

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

The acquiring module 301 is configured to acquire a third number of data storage queues, where the third number is less than or equal to the first number;

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

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

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

The obtaining module 301 is configured to obtain the storage parameters of the data to be stored;

The obtaining 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 obtaining module 301 is configured to determine, based on the mapping database, 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-area 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 acquisition 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 lower than the preset capacity;

The obtaining module 301 is configured to clear the preset priority data stored in the first storage group when it is determined that the priority label corresponding to the data to be stored satisfies a preset priority condition, and store the data to be stored stored in said 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 satisfy the preset priority condition.

In another embodiment of the present application, an update module 304 is also included, wherein:

The update module 304 is configured to 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 The location of the currently stored data in the first storage queue, where the captain information is used to represent the storage capacity of the first data storage queue.

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

An updating module 304, configured to detect the remaining storage space of the first storage group;

The update module 304 is configured to acquire a 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 update 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 storage sub-area in the same storage group is corresponding, including:

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

Fig. 7 is a logical structural block diagram of an electronic device according to an exemplary embodiment. For example, the electronic device 400 may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, a fitness device, a 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 can adopt at least one hardware form in DSP (Digital Signal Processing, digital signal processing), FPGA (Field-Programmable Gate Array, field programmable gate array), 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 for processing data in the wake-up state, and is also called a CPU (Central Processing Unit, central processing unit); Low-power processor for processing data in 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 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 configured to process computing operations related to machine learning.

Memory 402 may include one or more computer-readable storage media, which may be non-transitory. The memory 402 may also include high-speed random access memory and non-volatile memory, such as one or more magnetic disk storage devices and flash memory 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 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 buses or signal lines. 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 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, input/output) to the processor 401 and the memory 402 . In some embodiments, the processor 401, memory 402 and peripheral device interface 403 are integrated on the same chip or circuit board; in some other embodiments, any one of the processor 401, memory 402 and peripheral device 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 configured to receive and transmit RF (Radio Frequency, radio frequency) signals, also called electromagnetic signals. The radio frequency circuit 404 communicates with the communication network and other communication devices through 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 can communicate with other terminals through at least one wireless communication protocol. The wireless communication protocol includes, but is not limited to: a metropolitan area network, various generations of mobile communication networks (2G, 3G, 4G and 5G), a wireless local area network and/or a WiFi (Wireless Fidelity, wireless fidelity) network. In some embodiments, the radio frequency circuit 404 may also include circuits related to NFC (Near Field Communication, short-range wireless communication), which is not limited in this application.

The display screen 405 is used to display a 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 collect touch signals on or above the surface of the display screen 405 . The touch signal can be input to the processor 401 as a control signal for processing. At this time, the display screen 405 can also be used to provide virtual buttons and/or virtual keyboards, also called soft buttons and/or soft keyboards. In some embodiments, there may be one display screen 405, which is arranged on the front panel of the electronic device 400; in other embodiments, there may be at least two display screens 405, which are respectively arranged on different surfaces of the electronic device 400 or in a folding design In some other embodiments, the display screen 405 may be a flexible display screen, which is arranged on the curved surface or the 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 LCD (Liquid Crystal Display, liquid crystal display), OLED (Organic Light-Emitting Diode, organic light-emitting diode) and other materials.

The camera assembly 406 is used to capture images or videos. Optionally, the camera component 406 includes a front camera and a rear camera. Usually, the front camera is set on the front panel of the terminal, and the rear camera is set on the back of the terminal. In some embodiments, there are at least two rear cameras, which are any one of the main camera, depth-of-field camera, wide-angle camera, and telephoto camera, so as to realize the fusion of the main camera and the depth-of-field camera to realize the background blur function. Combined with the wide-angle camera to realize panoramic shooting and VR (Virtual Reality, virtual reality) shooting functions or other fusion shooting functions. In some embodiments, 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 sound waves of the user and the environment, and convert the sound waves into electrical signals and input them to the processor 401 for processing, or input them to the radio frequency circuit 404 to realize voice communication. For the purpose of stereo sound collection or noise reduction, there may be multiple microphones, which are respectively arranged in different parts of the electronic device 400 . The microphone can 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 conventional membrane loudspeaker or a piezoelectric ceramic loudspeaker. When the speaker is a piezoelectric ceramic speaker, it is possible not only to convert electrical signals into sound waves audible to humans, but also to convert electrical signals into sound waves inaudible to humans for purposes such as distance measurement. 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, 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 Grenax system of Russia, or the Galileo system of the European Union.

The power supply 409 is used to supply power to various components in the electronic device 400 . Power source 409 may be AC, DC, disposable 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 further 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 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 collecting game or user's motion data.

The gyro sensor 412 can detect the body direction and rotation angle of the electronic device 400 , and the gyro sensor 412 can cooperate with the acceleration sensor 411 to collect 3D actions of the user on the electronic device 400 . According to the data collected by the gyroscope sensor 412, the processor 401 can realize the following functions: 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 screen 405 . When the pressure sensor 413 is arranged on the side frame of the electronic device 400 , it can detect the user's grip signal on the electronic device 400 , and the processor 401 performs left and right hand recognition or shortcut operation according to the grip signal collected by the pressure sensor 413 . When the pressure sensor 413 is arranged on the lower layer of the touch screen 405, the processor 401 controls the operable controls on the UI interface according to the user's pressure operation on the touch screen 405. The operable 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 identity of the user is recognized as a trusted identity, the processor 401 authorizes the user to perform related sensitive operations, such sensitive operations include unlocking the screen, viewing encrypted information, downloading software, making payment, and changing settings. The fingerprint sensor 414 may be disposed on the front, back or side of the electronic device 400 . When the electronic device 400 is provided with a physical button or a manufacturer's Logo, the fingerprint sensor 414 may be integrated with the physical button or the manufacturer's Logo.

The optical sensor 415 is used to collect ambient light intensity. In one embodiment, the processor 401 can control the display brightness of the touch 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 screen 405 is increased; when the ambient light intensity is low, the display brightness of the touch screen 405 is decreased. In another embodiment, the processor 401 may also dynamically adjust shooting parameters of the camera assembly 406 according to the ambient light intensity collected by the optical sensor 415 .

The proximity sensor 416 , also called a distance sensor, is usually arranged on the front panel of the electronic device 400 . The proximity sensor 416 is used to collect the distance between the user and the front of the 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 on-screen state.

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

In an exemplary embodiment, there is also provided a non-transitory computer-readable storage medium including instructions, such as a memory 404 including instructions, the instructions can be executed by the processor 420 of the electronic device 400 to complete the above method for managing data, The method includes: acquiring a target storage area; dividing 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 The storage capacity of each of the storage groups corresponds; based on a second preset rule, each of the storage groups is divided into a second number of storage sub-areas, wherein in the same storage group, each of the storage sub-areas The storage capacity is corresponding; the data to be stored is stored by using the first number of storage groups and the second number of storage sub-areas. Optionally, the above instructions may also be executed by the processor 420 of the electronic device 400 to complete other steps involved in the above 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, so as to complete the above-mentioned method for 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 of which has at least a storage capacity capable of storing one data to be stored, wherein the storage capacity of each of the storage groups corresponds; based on a second preset rule, each of the storage groups is divided into a second number of storage sub-areas, wherein each of the storage sub-areas in the same storage group corresponding to the storage capacity; using the first number of storage groups and the second number of storage sub-areas to store the data to be stored. Optionally, the above instructions may also be executed by the processor 420 of the electronic device 400 to complete other steps involved in the above exemplary embodiments.

Other embodiments of the present application will be readily apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any modification, use or adaptation of the application, these modifications, uses or adaptations follow the general principles of the application and include common knowledge or conventional technical means in the technical field not disclosed in the application . The specification and examples are to be considered exemplary only, with a true scope and spirit of the application indicated by the following claims.

It should be understood that the present application is not limited to the precise constructions which have been described above and shown in the accompanying drawings, and 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 (8)

1. A method of managing data, comprising:

acquiring a target storage area;

dividing the target storage area into a first number of storage groups based on a first preset rule, wherein each storage group at least has a storage capacity for storing one data to be stored, and the storage capacity of each storage group corresponds to the storage capacity of the corresponding storage group;

dividing each storage group into a second number of storage subareas based on a second preset rule, wherein the storage capacity of each storage subarea in the same storage group corresponds to that of each storage subarea;

storing data to be stored by utilizing the first number of storage groups and the second number of storage subareas;

wherein after dividing each memory group into a second number of memory sub-regions based on a second preset rule, the method further comprises:

acquiring a third number of data storage queues, wherein the third number is smaller than or equal to the first number;

Allocating at least one corresponding storage group for each data storage queue, and respectively establishing a mapping relation between each data storage queue and the corresponding storage group;

recording each mapping relation into a mapping database;

wherein after dividing each memory group into a second number of memory sub-regions based on a second preset rule, the method further comprises:

acquiring storage parameters of the data to be stored;

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

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

and when the data size of the data to be stored is detected to be lower than the preset capacity, storing the data to be stored in a first memory subarea of the first memory group.

2. The method of claim 1, wherein after said determining said first storage group mapped to a storage queue corresponding to said data to be stored, comprising:

when the data size of the data to be stored is detected to be not lower than the preset capacity, acquiring a priority label corresponding to the data to be stored;

When the priority label corresponding to the data to be stored is determined to meet 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;

and when the priority label corresponding to the data to be stored is determined not to meet the preset priority condition, the data to be stored is cleared.

3. The method of claim 1, after said storing said data to be stored in a first memory sub-region of said first memory group, comprising:

updating address offset information and queue length information of a first data storage queue, wherein the address offset information comprises queue head information and queue tail information, the address offset information is used for representing the position of currently stored data in the first data storage queue, and the queue length information is used for representing the storage capacity of the first data storage queue.

4. The method of claim 3, after said storing said data to be stored in a first memory sub-region of said first memory group, comprising:

detecting the remaining storage space of the first storage group;

when the fact that the residual storage space of the first storage group is smaller than the target capacity is detected, acquiring a second storage group in an idle state;

And establishing a mapping relation between the second storage group and the first data storage queue.

5. The method of any of claims 1-4, wherein the storage capacity of each of the storage groups corresponds to comprising:

the storage capacity of each storage group is the same;

and, the memory capacity of each memory subarea in the same memory group corresponds to that of the memory subarea, including:

in the same memory group, the memory capacity of each memory subarea is the same.

6. An apparatus for managing data, comprising:

an acquisition module configured to acquire a target storage area;

the first dividing module is configured to divide the target storage area into a first number of storage groups based on a first preset rule, wherein each storage group is provided with at least one storage capacity for storing data to be stored, and the storage capacity of each storage group corresponds to the storage capacity of the corresponding storage group;

a second dividing module, configured to divide each storage group into a second number of storage subareas based on a second preset rule, where the storage capacity of each storage subarea in the same storage group corresponds to that of each storage subarea;

a storage module configured to store data to be stored using the first number of storage groups and the second number of storage sub-regions;

Wherein after dividing each memory group into a second number of memory sub-regions based on a second preset rule, the method further comprises:

acquiring a third number of data storage queues, wherein the third number is smaller than or equal to the first number;

allocating at least one corresponding storage group for each data storage queue, and respectively establishing a mapping relation between each data storage queue and the corresponding storage group;

recording each mapping relation into a mapping database;

wherein after dividing each memory group into a second number of memory sub-regions based on a second preset rule, the method further comprises:

acquiring storage parameters of the data to be stored;

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

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

and when the data size of the data to be stored is detected to be lower than the preset capacity, storing the data to be stored in a first memory subarea of the first memory group.

7. An electronic device, comprising:

A memory for storing executable instructions; the method comprises the steps of,

a processor for displaying with the memory to execute the executable instructions to perform operations of the method of managing data of any one of claims 1-5.

8. A computer readable storage medium storing computer readable instructions which, when executed, perform the operations of the method of managing data of any one of claims 1-5.