CN110442308B - A data block storage method, device, device and storage medium - Google Patents

Abstract

The invention discloses a data block storage method, device, equipment and computer storage medium. The method includes: obtaining the current storage time of a target data block; obtaining an offset time according to the current storage time and the basic time; wherein, the The base time is any time before the storage time of the first data block; the relative time is obtained according to the offset time and the time capacity; wherein, the time capacity is the length of time that can store the most data blocks; Describe the relative time and the storage interval to obtain the offset; wherein, the storage interval is the storage interval time between two adjacent data blocks; according to the offset, the storage start address and the data block size, to Obtain a storage address; wherein, the storage address has a unique mapping relationship with the current storage time; store the target data block in the storage address to complete the storage. The storage time point of the data can also be known without storing the time information that occupies most of the space, which saves most of the storage space and improves the data storage capacity.

Description

A data block storage method, device, device and storage medium

technical field

The present invention relates to the field of computer applications, and in particular, to a data block storage method, device, device and storage medium.

Background technique

With the development of information technology, especially the popularization of the Internet, the rapid growth of various types of data, especially the increase of video data, has brought great pressure to the existing storage devices, so large-capacity, high-performance storage is urgently needed. system to efficiently save and quickly access this data.

In practical applications, most of the non-volatile storage devices are unattended, which requires relatively high data storage capacity. At the same time, in some fields, non-volatile storage devices not only need to store data blocks, but also need to know the storage time of data blocks, and require data blocks to be stored for several years or decades. However, the capacity of non-volatile storage devices in the traditional embedded field is usually relatively small, usually only a few megabytes of space, and a large part of the storage pressure of the storage device comes from the stored time information, which occupies a large amount of time. Storage space, so that the amount of data that can be stored is reduced.

SUMMARY OF THE INVENTION

In view of the above problems, the purpose of the present invention is to provide a data block storage method, device, device and storage medium, which can know the storage time point of data without storing the time information that occupies most of the space, saving the Most of the storage space increases the amount of data storage.

In a first aspect, an embodiment of the present invention provides a data block storage method, including:

Get the current storage time of the target data block;

According to the current storage time and the base time, the offset time is obtained; wherein, the base time is any time before the storage time of the first data block;

Obtain the relative time according to the offset time and the time capacity; wherein, the time capacity is the time length that can store the most data blocks;

Obtain the offset according to the relative time and the storage interval; wherein, the storage interval is the storage interval time between two adjacent data blocks;

According to the offset, the storage start address and the data block size, the storage address is obtained; wherein, the storage address has a unique mapping relationship with the current storage time;

Store the target data block in the storage address to complete the storage.

Preferably, before the acquiring the storage time of the current data block, the method further includes:

Independently allocate page storage guide information for the non-volatile memory; wherein, the page storage guide information includes time capacity, storage start address, storage end address, data block size and storage interval.

Preferably, the relative time is obtained according to the offset time and the time capacity; wherein, the time capacity is the length of time that can store the most data blocks, specifically:

A remainder calculation is performed on the offset time and the time capacity to obtain a relative time.

Preferably, each time a storage interval is increased, the storage address is correspondingly increased by a data block size, and until the storage address reaches the maximum value, the storage address is recalculated from the storage start address.

Preferably, the storage time is subtracted from the base time to obtain the offset time;

dividing the relative time by the storage interval to obtain the offset;

The offset is multiplied by the data block size and added to the storage start address to obtain the storage address.

In a second aspect, an embodiment of the present invention provides a data block storage device, including:

The current storage time obtaining unit is used to obtain the current storage time of the target data block;

an offset time obtaining unit, configured to obtain an offset time according to the current storage time and the base time; wherein, the base time is any time before the storage time of the first data block;

a relative time obtaining unit, configured to obtain the relative time according to the offset time and the time capacity; wherein, the time capacity is the time length that can store the most data blocks;

an offset obtaining unit, configured to obtain the offset according to the relative time and the storage interval; wherein, the storage interval is the storage interval time between two adjacent data blocks;

a storage address obtaining unit, used for obtaining a storage address according to the offset, the storage start address and the data block size; wherein, the storage address has a unique mapping relationship with the current storage time;

The target data block storage unit is used to store the target data block in the storage address to complete the storage.

Preferably, before the current storage time acquisition unit, it is also used for:

Independently allocate page storage guide information for the non-volatile memory; wherein, the page storage guide information includes time capacity, storage start address, storage end address, data block size and storage interval.

Preferably, the relative time acquisition unit is specifically used for:

A remainder calculation is performed on the offset time and the time capacity to obtain a relative time.

Preferably, each time a storage interval is increased, the storage address is correspondingly increased by a data block size, and until the storage address reaches the maximum value, the storage address is recalculated from the storage start address.

Preferably, also for:

The storage time is subtracted from the base time to obtain the offset time; the relative time is divided by the storage interval to obtain the offset; the offset is multiplied by the data block size and the starting storage address Add up to get the memory address.

An embodiment of the present invention further provides a data block storage device, including a processor, a memory, and a computer program stored in the memory, where the computer program can be executed by the processor to implement the above data block storage method.

An embodiment of the present invention further provides a computer-readable storage medium, where the computer-readable storage medium includes a stored computer program, wherein when the computer program runs, the device where the computer-readable storage medium is located is controlled to execute the above-mentioned The data block storage method.

In the above-mentioned one embodiment, through the storage interval and the size of the data block, the storage time of the data block and the storage address are mapped to obtain the storage address, and then the target data block is stored in the storage address mapped to the corresponding storage time to complete the storage. . Under the condition of not storing the time information that occupies most of the space, the data storage time point can be known under the operation of reading the data block, which saves most of the storage space and improves the data storage capacity.

Description of drawings

In order to illustrate the technical solutions of the present invention more clearly, the following will briefly introduce the accompanying drawings used in the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention, which are common in the art. As far as technical personnel are concerned, other drawings can also be obtained based on these drawings without any creative effort.

FIG. 1 is a schematic flowchart of a data block storage method provided by a first embodiment of the present invention.

FIG. 2 is a mapping relationship diagram between storage time and storage address provided by the first embodiment of the present invention.

FIG. 3 is a schematic structural diagram of a data block storage device provided by a second embodiment of the present invention.

Detailed ways

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

In order to better understand the technical solutions of the present invention, the embodiments of the present invention are described in detail below with reference to the accompanying drawings.

It should be understood that the described embodiments are only some, but not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

The terms used in the embodiments of the present invention are only for the purpose of describing specific embodiments, and are not intended to limit the present invention. As used in the embodiments of the present invention and the appended claims, the singular forms "a," "the," and "the" are intended to include the plural forms as well, unless the context clearly dictates otherwise.

It should be understood that the term "and/or" used in this document is only an association relationship to describe the associated objects, indicating that there may be three kinds of relationships, for example, A and/or B, which may indicate that A exists alone, and A and B exist at the same time. B, there are three cases of B alone. In addition, the character "/" in this document generally indicates that the related objects are an "or" relationship.

Depending on the context, the word "if" as used herein can be interpreted as "at" or "when" or "in response to determining" or "in response to detecting." Similarly, the phrases "if determined" or "if detected (the stated condition or event)" can be interpreted as "when determined" or "in response to determining" or "when detected (the stated condition or event)," depending on the context )" or "in response to detection (a stated condition or event)".

The "first\second" mentioned in the embodiment is only to distinguish similar objects, and does not represent a specific order for the objects. It is understood that "first\second" can be interchanged with specific order or sequence. It should be understood that the "first\second" distinctions may be interchanged under appropriate circumstances to enable the embodiments described herein to be practiced in sequences other than those illustrated or described herein.

Example 1:

Referring to FIG. 1 and FIG. 2 , a first embodiment of the present invention provides a data block storage method, which can be executed by a data block storage device, in particular, executed by one or more processors in the data block storage device , and at least include the following steps:

S101, obtain the current storage time of the target data block.

In this embodiment, the current storage time refers to the time point of the target data block that needs to be stored or read currently. In particular, the current storage time is the storage time point.

S102: Obtain an offset time according to the current storage time and the base time, wherein the base time is any time before the storage time of the first data block.

In this embodiment, the offset time is obtained by subtracting the current storage time from the base time. For example, if the current storage time is 2019.06.27, and the storage time of the first data block is 2019.06.01, the base time can be set to , 2019.05.30 or earlier than the storage time of the first data block, and the offset time is the current storage time - the base time = 27 days.

S103: Obtain a relative time according to the offset time and the time capacity, where the time capacity is the time length that can store the most data blocks.

In this embodiment, when the offset time is less than or equal to the time capacity, the relative time is obtained by calculating the remainder of the offset time and the time capacity. For example, assuming that the offset time is 27 days and the length of the time capacity is 54 days, then the relative time is 27/54 and the remainder is 27 days. It should be noted that the time capacity is an abstract concept, corresponding to the "space capacity", that is, the time length for which the storage device can store the most data blocks, and the space capacity is the available storage space allocated by the system.

S104, obtain an offset according to the relative time and the storage interval, wherein the storage interval is a storage interval time between two adjacent data blocks.

In this embodiment, the offset is obtained by dividing the relative time by the storage interval. For example, if the relative time is 27 days and the storage interval is 3 days, the offset is 27/3=9. It can be understood that the unit of the storage interval is a specified amount relative to the original offset time and time capacity.

S105, obtain a storage address according to the offset, the storage start address, and the data block size; wherein, the storage address and the current storage time have a unique mapping relationship.

In this embodiment, the offset is multiplied by the data block size + the starting storage address to obtain the storage address. The size of the data block is the storage space occupied by one data block, assuming that the offset is 9, the time length corresponding to the size of the data block is 1 day, and the starting storage address is 0x87654321, which starts from The storage time corresponding to the initial storage address is 2019.07.05, then the storage address is 9*1+0x87654321=0x87654330, assuming that the mapping relationship between the storage address and the storage time is 1:1, then it is considered that the storage address corresponds to The storage time is 2019.07.14.

The storage address has a unique mapping relationship with the current storage time. For example, if the space capacity is 100 and the time capacity is 200, the mapping relationship between the storage time and the storage address is 1:2. There is a unique mapping relationship between the storage address and the current storage time, so that even if the data block storage device has no storage time, it can also know the storage time according to the current storage time mapped by the storage address when reading the data block. point in time.

S106, the target data block is stored in the storage address to complete the storage.

In summary, through the storage interval and data block size, the storage time of the data block is mapped to the storage address to obtain the storage address, and then the target data block is stored in the storage address corresponding to the storage time mapping to complete the storage. Under the condition of not storing the time information that occupies most of the space, the data storage time point can be known under the operation of reading the data block, which saves most of the storage space and improves the data storage capacity.

On the basis of the above embodiment, in a preferred embodiment of the present invention, before step S101, the method further includes:

The data block storage device independently allocates page storage guide information for the non-volatile memory; wherein, the page storage guide information includes time capacity, storage start address, storage end address, data block size, and storage interval.

On the basis of the above-mentioned embodiment, in a preferred embodiment of the present invention, each time a storage interval is added, the storage address is correspondingly increased by a data block size, until the storage address reaches the maximum value, then the storage start address is recalculated from the storage start address. the storage address.

As shown in FIG. 2, FIG. 2 shows a mapping relationship between storage time and storage address. Figure 2 includes three relationships: the storage space capacity is used to express the storage location relationship between the data blocks, the storage time capacity is used to express the relationship of each storage time point, and the corresponding relationship between storage location and storage time. In order to facilitate the understanding of the present invention, the working principle of the present invention is described in detail below:

First, the data block storage device independently allocates a page to the non-volatile memory to store guide information, where the guide information includes: storage space size, storage start address, data block size, and storage interval. Then, addressing is performed according to the mapping relationship between the storage time point of the data block and the storage address, and data storage and reading operations are performed in the nonvolatile memory according to the found storage address.

Specifically, the storage time and the storage address are mapped through the storage interval and the size of the data block, and then the storage address of the data block is calculated according to the current time, the size of the data block, and the storage interval, that is, the expression of the storage address The formula can be expressed as: storage address=((offset time% time capacity)*space capacity)/time capacity. The space capacity is the available storage space allocated by the system. The hardware resources are limited. After the storage space is full, it is necessary to start the storage from the beginning and cycle the operation.

Wherein, the data block storage method is as follows: first, subtract the current storage time from the base time to obtain an offset time, and the base time is any time earlier than the current storage time of the first data block, and then offset the offset time. The remainder is calculated between the time and the time capacity to obtain the relative time, wherein the time capacity is the time length that the storage device can store the most data blocks. The relative time is then divided by the storage interval to obtain the offset. Finally, the offset is multiplied by the data block size to obtain the storage address. It can be understood that, when the time increases by one storage interval, the storage address is correspondingly increased by one data block size, and if the storage address reaches the maximum value, the calculation starts from the storage starting address again.

The second embodiment of the present invention:

Referring to FIG. 3, a second embodiment of the present invention provides a data block storage device, including:

The current storage time obtaining unit 100 is used to obtain the current storage time of the target data block;

an offset time obtaining unit 200, configured to obtain an offset time according to the current storage time and the base time; wherein, the base time is any time before the storage time of the first data block;

a relative time obtaining unit 300, configured to obtain a relative time according to the offset time and the time capacity; wherein, the time capacity is the time length that can store the most data blocks;

an offset obtaining unit 400, configured to obtain the offset according to the relative time and the storage interval; wherein, the storage interval is the storage interval time between two adjacent data blocks;

The storage address obtaining unit 500 is used to obtain the storage address according to the offset, the storage start address and the data block size; wherein, the storage address has a unique mapping relationship with the current storage time;

The target data block storage unit 600 is configured to store the target data block in the storage address to complete the storage.

On the basis of the above-mentioned embodiment, in a preferred embodiment of the present invention, before the current storage time obtaining unit 100, it is further used for:

Independently allocate page storage guide information for the volatile memory; wherein, the page storage guide information includes time capacity, storage start address, storage end address, data block size and storage interval.

On the basis of the above embodiment, in a preferred embodiment of the present invention, the relative time acquisition unit is specifically used for:

A remainder calculation is performed on the offset time and the time capacity to obtain a relative time.

On the basis of the above-mentioned embodiment, in a preferred embodiment of the present invention, each time a storage interval is added, the storage address is correspondingly increased by a data block size, until the storage address reaches the maximum value, then the storage start address is recalculated from the storage start address. the storage address.

On the basis of the above embodiment, in a preferred embodiment of the present invention, it is also used for:

The storage time is subtracted from the base time to obtain the offset time; the relative time is divided by the storage interval to obtain the offset; the offset is multiplied by the data block size to obtain the storage address.

A third embodiment of the present invention provides a data block storage device, including a processor, a memory, and a computer program stored in the memory, where the computer program can be executed by the processor to implement the above-mentioned data block storage method.

A fourth embodiment of the present invention provides a computer-readable storage medium, where the computer-readable storage medium includes a stored computer program, wherein, when the computer program runs, the device where the computer-readable storage medium is located is controlled to execute the following The above data block storage method.

Exemplarily, the computer program may be divided into one or more units, and the one or more units are stored in the memory and executed by the processor to accomplish the present invention. The one or more units may be a series of computer program instruction segments capable of performing specific functions, and the instruction segments are used to describe the execution process of the computer program in the data block storage device.

The data block storage device may include, but is not limited to, a processor and a memory. Those skilled in the art can understand that the above schematic diagram is only an example of a data block storage device, and does not constitute a limitation on a data block storage device, and may include more or less components than those shown in the figure, or combine some components, or Different components, such as the data block storage device, may also include input and output devices, network access devices, buses, and the like.

The processor may be a central processing unit (Central Processing Unit, CPU), other general-purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), off-the-shelf processors Programmable Gate Array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The control center of the data block storage device uses various interfaces and lines to connect various parts of the entire data block storage device.

The memory can be used to store the computer program and/or module, and the processor implements the data by running or executing the computer program and/or module stored in the memory and calling the data stored in the memory Various functions of block storage devices. The memory may mainly include a stored program area and a stored data area, wherein the stored program area may store an operating system, an application program required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the storage data area may store Data (such as audio data, phonebook, etc.) created according to the usage of the mobile phone, etc. In addition, the memory may include high-speed random access memory, and may also include non-volatile memory such as hard disk, internal memory, plug-in hard disk, Smart Media Card (SMC), Secure Digital (SD) card , a flash memory card (Flash Card), at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage device.

Wherein, if the unit integrated in the data block storage device is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a computer-readable storage medium. Based on this understanding, the present invention can implement all or part of the processes in the methods of the above embodiments, and can also be completed by instructing relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and the computer When the program is executed by the processor, the steps of the foregoing method embodiments can be implemented. Wherein, the computer program includes computer program code, and the computer program code may be in the form of source code, object code, executable file or some intermediate form, and the like. The computer-readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer memory, a read-only memory (ROM, Read-Only Memory) , Random Access Memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium, etc. It should be noted that the content contained in the computer-readable media may be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction, for example, in some jurisdictions, according to legislation and patent practice, the computer-readable media Electric carrier signals and telecommunication signals are not included.

It should be noted that the device embodiments described above are only schematic, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physically separated unit, that is, it can be located in one place, or it can be distributed over multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution in this embodiment. In addition, in the drawings of the apparatus embodiments provided by the present invention, the connection relationship between the modules indicates that there is a communication connection between them, which may be specifically implemented as one or more communication buses or signal lines. Those of ordinary skill in the art can understand and implement it without creative effort.

The above are the preferred embodiments of the present invention. It should be pointed out that for those skilled in the art, without departing from the principles of the present invention, several improvements and modifications can be made, and these improvements and modifications may also be regarded as It is the protection scope of the present invention.

Claims (8)

1. a data block storage method, is characterized in that, comprises: Get the current storage time of the target data block; According to the current storage time and the base time, the offset time is obtained; wherein, the base time is any time before the storage time of the first data block; According to the offset time and the time capacity, obtain the relative time; wherein, the time capacity is the length of time that can store the most data blocks; the remainder is calculated on the offset time and the time capacity, and the relative time is obtained; Obtain the offset according to the relative time and the storage interval; wherein, the storage interval is the storage interval time between two adjacent data blocks; According to the offset, the storage start address and the data block size, the storage address is obtained; wherein, the storage address has a unique mapping relationship with the current storage time; the target data block is stored in the storage address to complete the storage ; wherein, the current storage time is subtracted from the base time to obtain an offset time; the relative time is divided by the storage interval to obtain an offset; the offset is multiplied by the data block size and the The storage start addresses are added to obtain the storage address. 2. The data block storage method according to claim 1, characterized in that, before the acquisition of the current storage time of the target data block, further comprising: Independently allocate page storage guide information for the non-volatile memory; wherein, the page storage guide information includes time capacity, storage start address, storage end address, data block size and storage interval. 3. data block storage method according to claim 1, is characterized in that, Each time a storage interval is increased, the storage address is correspondingly increased by a data block size, and until the storage address reaches the maximum value, the storage address is recalculated from the storage start address. 4. A data block storage device, comprising: The current storage time obtaining unit is used to obtain the current storage time of the target data block; an offset time obtaining unit, configured to obtain an offset time according to the current storage time and the base time; wherein, the base time is any time before the storage time of the first data block; a relative time obtaining unit, configured to obtain the relative time according to the offset time and the time capacity; wherein, the time capacity is the time length that can store the most data blocks; the remainder is calculated on the offset time and the time capacity, get relative time; an offset obtaining unit, configured to obtain the offset according to the relative time and the storage interval; wherein, the storage interval is the storage interval time between two adjacent data blocks; a storage address obtaining unit, used for obtaining a storage address according to the offset, the storage start address and the data block size; wherein, the storage address has a unique mapping relationship with the current storage time; The target data block storage unit is used to store the target data block in the storage address to complete the storage; wherein, the current storage time is subtracted from the base time to obtain an offset time; the relative time is divided by the storage interval , to obtain the offset; the offset is multiplied by the size of the data block and added to the storage start address to obtain the storage address. 5. The data block storage device according to claim 4, characterized in that, before the current storage time acquisition unit, further used for: Independently allocate page storage guide information for the non-volatile memory; wherein, the page storage guide information includes time capacity, storage start address, storage end address, data block size and storage interval. 6. The data block storage device according to claim 4, wherein the relative time obtaining unit is specifically used for: A remainder calculation is performed on the offset time and the time capacity to obtain a relative time. 7. A data block storage device, comprising a processor, a memory, and a computer program stored in the memory, the computer program being executable by the processor to implement any one of claims 1 to 3 The data block storage method described in item. 8. A computer-readable storage medium, characterized in that the computer-readable storage medium comprises a stored computer program, wherein, when the computer program runs, the device where the computer-readable storage medium is located is controlled to execute as claimed in the claims The data block storage method described in any one of 1 to 3.

Images