CN112817526B - Data storage method, device and medium - Google Patents
Data storage method, device and medium Download PDFInfo
- Publication number
- CN112817526B CN112817526B CN202110068583.1A CN202110068583A CN112817526B CN 112817526 B CN112817526 B CN 112817526B CN 202110068583 A CN202110068583 A CN 202110068583A CN 112817526 B CN112817526 B CN 112817526B
- Authority
- CN
- China
- Prior art keywords
- data
- storage
- storage space
- new data
- storing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0608—Saving storage space on storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0644—Management of space entities, e.g. partitions, extents, pools
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Memory System (AREA)
Abstract
The application discloses a data storage method, a device and a medium, wherein the method comprises the steps of counting data in a storage area, reallocating the storage space of the storage area according to bytes of the data so as to form a continuous free storage space in the storage area, and storing new data in the free storage space when a storage signal for storing the new data is received. The storage space is allocated again according to the byte size of the data, so that the purpose of allocating and utilizing the storage fragments existing before the reallocation can be achieved, a continuous free space is formed in the storage area, when new data needs to be stored, the data can be stored in the free space formed after the reallocation, the problem that a large number of storage fragments exist in the storage area is avoided, the problem that the storage area is not full but cannot continue to store the data is avoided, and the utilization rate of the storage space is improved.
Description
Technical Field
The present disclosure relates to the field of electronic information technologies, and in particular, to a data storage method, apparatus, and medium.
Background
With the development of automation and intellectualization of industrial production, the demands of industrial production business on real-time debugging and incremental downloading are more intense, and due to frequent modification of stored data and incremental downloading, a large amount of storage fragments appear in a storage area, so that the problem that the data cannot be stored continuously although the storage area is not full is caused.
At present, in order to solve the problem that data cannot be stored, a method of reapplying a storage area is often adopted for solving, but because an embedded system is often adopted in industrial production, and the storage space of the embedded system is limited, the storage area cannot be reapplied continuously, so that the problem that all the storage areas of the embedded system are not full but cannot continue to store data cannot be avoided, and the utilization rate of the storage space is reduced.
It can be seen that how to improve the utilization of the storage space is a problem to be solved by those skilled in the art.
Disclosure of Invention
The purpose of the application is to provide a data storage method for improving the utilization rate of storage space. The application aims to provide a data storage device and a medium.
In order to solve the above technical problems, the present application provides a data storage method, including:
counting data of a storage area;
reallocating the storage space of the storage area according to the bytes of the data so as to form continuous free storage space in the storage area;
and storing the new data in the free storage space when a storage signal for storing the new data is received.
Preferably, after the reallocating the storage space of the storage area according to the bytes of the data, the method further includes:
acquiring a first address of a storage space corresponding to each piece of data before reassignment;
acquiring a second address of the storage space corresponding to each data after reassignment;
and forming a mapping table according to the corresponding relation between the first addresses and the second addresses.
Preferably, after the mapping table is formed according to the correspondence between the first addresses and the second addresses, the mapping table further includes:
and sending the mapping table to a controller so that the controller can copy the data before the reassignment to the storage space corresponding to the second address according to the mapping table.
Preferably, before storing the new data in the free storage space, the method further includes:
judging whether bytes of the new data are larger than the free storage space or not;
if not, the step of storing the new data in the free storage space is entered.
Preferably, the storing the new data in the free storage space is specifically:
and storing the new data matched with the free storage space in the free storage space.
Preferably, the mapping table formed according to the correspondence between each first address and each second address is specifically:
and forming the mapping table according to the corresponding relation between the reassigned storage spaces and the second addresses, the corresponding relation between the first addresses and the second addresses.
Preferably, the mapping table includes: each first address, each second address, and each storage space after reassignment.
In order to solve the above technical problem, the present application further provides a data storage device, including:
the statistics module is used for counting the data of the storage area;
the allocation module is used for reallocating the storage space of the storage area according to the bytes of the data so as to form continuous free storage space in the storage area;
and the first storage module is used for storing the new data in the free storage space under the condition that a storage signal for storing the new data is received.
In order to solve the above technical problem, the present application further provides a data storage device, including:
a memory for storing a computer program;
a processor for implementing the steps of the data storage method as described above when executing the computer program.
To solve the above technical problem, the present application further provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor, implements the steps of the data storage method as described above.
According to the data storage method, after the data of the storage area are counted, the storage space of the storage area is redistributed according to bytes of the data so as to form a continuous free storage space in the storage area, and when a storage signal for storing new data is received, the new data is stored in the free storage space. The storage space is allocated again according to the byte size of the data, so that the purpose of allocating and utilizing the storage fragments existing before the reallocation can be achieved, a continuous free space is formed in the storage area, when new data needs to be stored, the data can be stored in the free space formed after the reallocation, the problem that a large number of storage fragments exist in the storage area is avoided, the problem that the storage area is not full but cannot continue to store the data is avoided, and the utilization rate of the storage space is improved.
In addition, the data storage device and the medium provided by the application correspond to the data storage method, and the effects are the same as the effects.
Drawings
For a clearer description of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described, it being apparent that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart of a data storage method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of a storage area before reassignment according to an embodiment of the present application;
FIG. 3 is a schematic diagram of a reallocated storage area according to an embodiment of the present disclosure;
FIG. 4 is a flowchart of another data storage method according to an embodiment of the present application;
FIG. 5 is a schematic structural diagram of a data storage device according to an embodiment of the present disclosure;
fig. 6 is a schematic structural diagram of another data storage device according to an embodiment of the present application.
Detailed Description
The following description of the technical solutions in the embodiments of the present application will be made clearly and completely with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, but not all embodiments. All other embodiments obtained by those skilled in the art based on the embodiments herein without making any inventive effort are intended to fall within the scope of the present application.
The core of the application is to provide a data storage method for improving the utilization rate of storage space. The core of the application is also to provide a data storage device and a medium.
In order to provide a better understanding of the present application, those skilled in the art will now make further details of the present application with reference to the drawings and detailed description.
Fig. 1 is a flowchart of a data storage method according to an embodiment of the present application. As shown in fig. 1, the method includes:
s10: and counting the data of the storage area.
In this embodiment, the statistics of the data stored in the storage area and the byte size thereof further includes, after the statistics of the data in the storage area, reclaiming the stored storage space to facilitate subsequent reassignment according to the data byte size.
S11: the memory space of the memory area is reallocated according to bytes of data so as to form a continuous free memory space within the memory area.
Fig. 2 is a schematic diagram of a storage area before reallocation according to an embodiment of the present application. Fig. 3 is a schematic diagram of a reallocated storage area according to an embodiment of the present application. As shown in FIG. 2, after some data pruning operations, a large amount of unusable memory fragmentation occurs within the memory area. For example, as shown in fig. 2, the byte sizes of the data V3, the data V6, the data V12 and the data V13 are changed from 4 bytes to 2 bytes, respectively forming 2-byte fragments; the byte sizes of the data V7 and the data V9 are changed from 4 bytes to 1 byte, respectively forming 3-byte fragments.
After counting the data of the storage area as shown in fig. 2, the storage space of the storage area is reallocated according to the byte sizes of the data V1, the data V2, the data V3, the data V4, the data V5, the data V6, the data V7, the data V8, the data V9, the data V10, the data V11, the data V12 and the data V13, and as shown in fig. 3, the data V7 and the data V9 are respectively allocated with only 1 byte of storage space, so as to achieve the purpose of storing the data V7 and the data V9 by using the storage fragments formed by the data V3 before the reallocation. It will be appreciated that the purpose of allocating and utilizing the memory fragments existing before reallocation can be achieved by reallocating the memory space according to the byte size of the data, so that a continuous free space is formed in the memory area, as shown in fig. 3, a continuous free 16-byte memory space can be formed in the memory area, and the free memory space can continue to store data compared with the memory fragments which cannot be used before reallocation.
S12: and judging whether a storage signal for storing new data is received, if so, entering S13, and if not, ending.
S13: new data is stored in free memory.
It can be understood that when the storage space of the storage area is reallocated, which is equivalent to that the storage space before reallocation and the storage defragmentation are arranged to form a continuous usable free storage space, and when a storage signal for storing new data is received, the new data can be stored in the free storage space, so that the limited storage area can be used and utilized to the maximum extent.
In order to further increase the utilization of the storage space, as a preferred embodiment, S13 may specifically be: new data matching the byte size of the free memory space is stored in the free memory space. For example, when the bytes of the free memory space are 3 bytes, new data having a byte size of 3 may be preferentially stored. It will be appreciated that when the byte size of the plurality of new data matches the byte size of the free memory space, it may be preferable to store the new data corresponding to the first received storage signal.
According to the data storage method provided by the embodiment of the application, after the data of the storage area are counted, the storage space of the storage area is redistributed according to the bytes of the data so as to form a continuous free storage space in the storage area, and when a storage signal for storing new data is received, the new data is stored in the free storage space. The storage space is allocated again according to the byte size of the data, so that the purpose of allocating and utilizing the storage fragments existing before the reallocation can be achieved, a continuous free space is formed in the storage area, when new data needs to be stored, the data can be stored in the free space formed after the reallocation, the problem that a large number of storage fragments exist in the storage area is avoided, the problem that the storage area is not full but cannot continue to store the data is avoided, and the utilization rate of the storage space is improved.
Fig. 4 is a flowchart of another data storage method according to an embodiment of the present application. As shown in fig. 4, on the basis of the above embodiment, after S11, the method further includes:
s20: and acquiring a first address of a storage space corresponding to each piece of data before reassignment.
S21: and acquiring the second address of the storage space corresponding to each data after the reassignment.
S22: and forming a mapping table according to the corresponding relation between each first address and each second address.
In order to further improve the practicality of the mapping table and increase the speed of reading data through the mapping table, as a preferred embodiment, S22 is specifically: and forming a mapping table according to the corresponding relation between each storage space and each second address after the reassignment and the corresponding relation between each first address and each second address. The mapping table includes: each first address, each second address and each storage space after reassignment.
Wherein, table 1 is a format table of a mapping table provided in the embodiment of the present application. As shown in table 1, 4 bytes of data having a first address of 0x12345678 are stored in the memory space having a second address of 0x10000000, and 2 bytes of data having a first address of 0x12345670 are stored in the memory space having a second address of 0x 10000004.
TABLE 1
| First address | Second address | Storage space size (bytes) |
| 0x12345678 | 0x10000000 | 4 |
| 0x12345670 | 0x10000004 | 2 |
| …… | …… | …… |
According to the data storage method provided by the embodiment of the application, the mapping table is formed according to the corresponding relation between each first address and each second address, so that when the subsequent controller reads data, the corresponding data is read from the reassigned second addresses according to the mapping table, and the problem that the data cannot be read or the data is wrong due to reassignment of storage space according to the data is avoided.
On the basis of the above embodiment, after S22, further includes: and sending the mapping table to the controller so that the controller can copy each data before reallocation to the storage space corresponding to each second address according to the mapping table.
It can be understood that each data is copied into the storage space corresponding to each second address through the mapping table, so that the data stored before can be prevented from being lost, the problem that the data is read by the controller due to errors of the data is avoided, and meanwhile, the problem that execution logic is disordered when the controller reads the data after the storage space is redistributed is further avoided.
On the basis of the above embodiment, before S13, further includes:
judging whether bytes of the new data are larger than the free storage space, if so, ending storage; if not, S13 is entered.
According to the data storage method provided by the embodiment of the application, under the condition that the byte size of the new data is not larger than that of the free storage space, the new data is stored in the free storage space, so that the limited storage space can be used and utilized to the maximum extent, and the utilization rate of the storage space is further improved.
In the above embodiments, the data storage method is described in detail, and the application further provides corresponding embodiments of the data storage device. It should be noted that the present application describes an embodiment of the device portion from two angles, one based on the angle of the functional module and the other based on the angle of the hardware.
Fig. 5 is a schematic structural diagram of a data storage device according to an embodiment of the present application. As shown in fig. 5, the apparatus includes, based on the angle of the functional module:
and the statistics module 10 is used for counting the data of the storage area.
The allocation module 11 is configured to reallocate the storage space of the storage area according to bytes of data so as to form a continuous free storage space in the storage area.
The first storage module 12 is configured to store new data in the free storage space when receiving a storage signal for storing the new data.
Since the embodiments of the apparatus portion and the embodiments of the method portion correspond to each other, the embodiments of the apparatus portion are referred to the description of the embodiments of the method portion, and are not repeated herein.
As a preferred embodiment, further comprising:
the first acquisition module is used for acquiring the first address of the storage space corresponding to each data before reallocation.
And the second acquisition module is used for acquiring the second address of the storage space corresponding to each data after being reassigned.
The first establishing module is used for forming a mapping table according to the corresponding relation between each first address and each second address.
Further comprises:
and the sending module is used for sending the mapping table to the controller so that the controller can copy the data before the reassignment to the storage space corresponding to each second address according to the mapping table.
Further comprises:
and the first judging module is used for judging whether bytes of the new data are larger than the free storage space.
And the second storage module is used for entering the step of storing new data in the free storage space if not.
Further comprises:
and the third storage module is used for storing the new data matched with the free storage space in the free storage space.
Further comprises:
the second building module is used for forming a mapping table according to the corresponding relation between each storage space and each second address after being reassigned, each first address and the corresponding relation between each second address.
According to the data storage device provided by the embodiment of the application, after the data of the storage area are counted, the storage space of the storage area is redistributed according to the bytes of the data so as to form a continuous free storage space in the storage area, and when a storage signal for storing new data is received, the new data is stored in the free storage space. The storage space is allocated again according to the byte size of the data, so that the purpose of allocating and utilizing the storage fragments existing before the reallocation can be achieved, a continuous free space is formed in the storage area, when new data needs to be stored, the data can be stored in the free space formed after the reallocation, the problem that a large number of storage fragments exist in the storage area is avoided, the problem that the storage area is not full but cannot continue to store the data is avoided, and the utilization rate of the storage space is improved.
Fig. 6 is a schematic structural diagram of another data storage device according to an embodiment of the present application. As shown in fig. 6, the apparatus includes, based on the angle of the hardware structure:
a memory 20 for storing a computer program;
a processor 21 for implementing the steps of the data storage method in the above embodiment when executing the computer program.
Processor 21 may include one or more processing cores, such as a 4-core processor, an 8-core processor, etc. The processor 21 may be implemented in hardware in at least one of digital signal processing (Digital Signal Processing, DSP), field programmable gate array (Field-Programmable Gate Array, FPGA), programmable logic array (Programmable Logic Array, PLA). The processor 21 may also comprise a main processor, which is a processor for processing data in an awake state, also called central processor (Central Processing Unit, CPU), and a coprocessor; a coprocessor is a low-power processor for processing data in a standby state. In some embodiments, the processor 21 may be integrated with an image processor (Graphics Processing Unit, GPU) for rendering and rendering of content required to be displayed by the display screen. In some embodiments, the processor 21 may also include an artificial intelligence (Artificial Intelligence, AI) processor for processing computing operations related to machine learning.
In some embodiments, the data storage device may further include a display 22, an input/output interface 23, a communication interface 24, a power supply 25, and a communication bus 26.
Those skilled in the art will appreciate that the structure shown in fig. 6 is not limiting of the data storage device and may include more or fewer components than shown.
The data storage device provided by the embodiment of the application comprises a memory and a processor, wherein when the processor executes a program stored in the memory, the processor can realize the following method: after the data of the storage area are counted, the storage space of the storage area is redistributed according to bytes of the data so as to form continuous free storage space in the storage area, and when a storage signal for storing new data is received, the new data is stored in the free storage space. The storage space is allocated again according to the byte size of the data, so that the purpose of allocating and utilizing the storage fragments existing before the reallocation can be achieved, a continuous free space is formed in the storage area, when new data needs to be stored, the data can be stored in the free space formed after the reallocation, the problem that a large number of storage fragments exist in the storage area is avoided, the problem that the storage area is not full but cannot continue to store the data is avoided, and the utilization rate of the storage space is improved.
Finally, the present application also provides a corresponding embodiment of the computer readable storage medium. The computer-readable storage medium has stored thereon a computer program which, when executed by a processor, performs the steps as described in the method embodiments above.
It will be appreciated that the methods of the above embodiments, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored on a computer readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present application may be essentially or partly contributing to the prior art or all or part of the technical solutions may be embodied in the form of a software product stored in a storage medium, performing all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The embodiment of the application provides a computer readable storage medium, and the medium stores a computer program, and when the computer program is executed by a processor, the method can be implemented as follows: after the data of the storage area are counted, the storage space of the storage area is redistributed according to bytes of the data so as to form continuous free storage space in the storage area, and when a storage signal for storing new data is received, the new data is stored in the free storage space. The storage space is allocated again according to the byte size of the data, so that the purpose of allocating and utilizing the storage fragments existing before the reallocation can be achieved, a continuous free space is formed in the storage area, when new data needs to be stored, the data can be stored in the free space formed after the reallocation, the problem that a large number of storage fragments exist in the storage area is avoided, the problem that the storage area is not full but cannot continue to store the data is avoided, and the utilization rate of the storage space is improved.
The above describes in detail a data storage method, device and medium provided in the present application. In the description, each embodiment is described in a progressive manner, and each embodiment is mainly described by the differences from other embodiments, so that the same similar parts among the embodiments are mutually referred. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant points refer to the description of the method section. It should be noted that it would be obvious to those skilled in the art that various improvements and modifications can be made to the present application without departing from the principles of the present application, and such improvements and modifications fall within the scope of the claims of the present application.
It should also be noted that in this specification, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
Claims (9)
1. A method of data storage, comprising:
counting the data of the storage area, including counting the data stored in the storage area and the byte size thereof, and after counting the data in the storage area, recovering the stored storage space so as to facilitate subsequent reassignment according to the data byte size;
reallocating the storage space of the storage area according to the bytes of the data so as to form continuous free storage space in the storage area;
storing new data in the free storage space when a storage signal for storing the new data is received;
the storing the new data in the free storage space specifically includes:
storing the new data matched with the free storage space in the free storage space, and preferentially storing the data with the byte size identical to that of the free storage space in the new data, wherein when the byte sizes of a plurality of new data are matched with that of the free storage space, the new data corresponding to the storage signal received first is preferentially stored.
2. The data storage method according to claim 1, wherein after the reallocating the storage space of the storage area according to the bytes of the data, further comprising:
acquiring a first address of a storage space corresponding to each piece of data before reassignment;
acquiring a second address of the storage space corresponding to each data after reassignment;
and forming a mapping table according to the corresponding relation between the first addresses and the second addresses.
3. The method of claim 2, wherein after the mapping table is formed according to the correspondence between the first addresses and the second addresses, further comprising:
and sending the mapping table to a controller so that the controller can copy the data before the reassignment to the storage space corresponding to the second address according to the mapping table.
4. The data storage method of claim 1, wherein the storing the new data in the free storage space is preceded by:
judging whether bytes of the new data are larger than the free storage space or not;
if not, the step of storing the new data in the free storage space is entered.
5. The method of claim 2, wherein the mapping table is formed according to the correspondence between each of the first addresses and each of the second addresses, and is specifically:
and forming the mapping table according to the corresponding relation between the reassigned storage spaces and the second addresses, the corresponding relation between the first addresses and the second addresses.
6. The data storage method of claim 5, wherein the mapping table comprises: each first address, each second address, and each storage space after reassignment.
7. A data storage device, comprising:
the statistics module is used for counting the data of the storage area, including counting the data stored in the storage area and the byte size thereof, and recovering the stored storage space after counting the data in the storage area so as to facilitate the subsequent reassignment according to the data byte size;
the allocation module is used for reallocating the storage space of the storage area according to the bytes of the data so as to form continuous free storage space in the storage area;
the first storage module is used for storing the new data in the idle storage space under the condition that a storage signal for storing the new data is received;
the storing the new data in the free storage space specifically includes:
storing the new data matched with the free storage space in the free storage space, and preferentially storing the data with the byte size identical to that of the free storage space in the new data, wherein when the byte sizes of a plurality of new data are matched with that of the free storage space, the new data corresponding to the storage signal received first is preferentially stored.
8. A data storage device, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the data storage method according to any one of claims 1 to 6 when executing said computer program.
9. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon a computer program which, when executed by a processor, implements the steps of the data storage method according to any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110068583.1A CN112817526B (en) | 2021-01-19 | 2021-01-19 | Data storage method, device and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110068583.1A CN112817526B (en) | 2021-01-19 | 2021-01-19 | Data storage method, device and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112817526A CN112817526A (en) | 2021-05-18 |
| CN112817526B true CN112817526B (en) | 2023-04-28 |
Family
ID=75870061
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110068583.1A Active CN112817526B (en) | 2021-01-19 | 2021-01-19 | Data storage method, device and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112817526B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117539796B (en) * | 2024-01-09 | 2024-05-28 | 深圳宏芯宇电子股份有限公司 | Electronic device and buffer memory management method |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105468304B (en) * | 2015-11-26 | 2018-05-11 | 恒宝股份有限公司 | A kind of Native storage cards and its management method |
| CN106874218B (en) * | 2017-01-12 | 2019-12-03 | 深圳市汉云科技有限公司 | A kind of distribution method and its device of mapped address space |
| WO2018165957A1 (en) * | 2017-03-16 | 2018-09-20 | Microsoft Technology Licensing, Llc. | Log-appended-structured storage management with byte-level accessibility |
| CN107239412B (en) * | 2017-06-19 | 2020-07-07 | 杭州宏杉科技股份有限公司 | Storage space configuration method based on Thin-LUN, data writing method and storage equipment |
| CN109885255A (en) * | 2019-01-07 | 2019-06-14 | 北京小米移动软件有限公司 | Memory space method for sorting and device |
| CN110597797A (en) * | 2019-09-16 | 2019-12-20 | 北京百度网讯科技有限公司 | Table space debris recovery method and device, electronic equipment and storage medium |
| CN110941436B (en) * | 2019-11-11 | 2023-04-21 | Oppo（重庆）智能科技有限公司 | Data storage method and device for application program, storage medium and terminal equipment |
| CN111897493B (en) * | 2020-07-15 | 2023-03-10 | 杭州海康威视系统技术有限公司 | Storage space management method and device, electronic equipment and storage medium |
| CN112199303B (en) * | 2020-12-03 | 2021-03-16 | 北京紫光青藤微系统有限公司 | Storage space fragmentation processing method and device |
-
2021
- 2021-01-19 CN CN202110068583.1A patent/CN112817526B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN112817526A (en) | 2021-05-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111813713B (en) | Data acceleration operation processing method and device and computer readable storage medium | |
| JP4701321B2 (en) | Memory management | |
| CN104750620B (en) | A kind of internal memory migration method and device | |
| US5963982A (en) | Defragmentation of stored data without pointer indirection | |
| CN108632624B (en) | Image data processing method and device, terminal equipment and readable storage medium | |
| CN101963912A (en) | Implementation method for storing and checking hardware configuration information of system | |
| EP2919120A1 (en) | Memory monitoring method and related device | |
| CN109960612B (en) | Method, device and server for determining data storage ratio | |
| CN112817526B (en) | Data storage method, device and medium | |
| CN111491169B (en) | Digital image compression method, device, equipment and medium | |
| CN104503868B (en) | Method of data synchronization, device and system | |
| CN107678686B (en) | Method for realizing FT L function of flash memory based on hardware and data storage device thereof | |
| CN114327917A (en) | Memory management method, computing device and readable storage medium | |
| CN117236236B (en) | Chip design data management method and device, electronic equipment and storage medium | |
| WO2024124843A1 (en) | Data processing method and apparatus, and device and readable storage medium | |
| CN104317735A (en) | High-capacity cache and method for data storage and readout as well as memory allocation and recovery | |
| CN114995770B (en) | Data processing method, device, equipment, system and readable storage medium | |
| CN115328656A (en) | Dynamic memory intelligent expansion method, device, equipment and storage medium | |
| CN115658561A (en) | Power distribution terminal memory management method and device, electronic equipment and storage medium | |
| CN110674086A (en) | Data merging method and device, electronic equipment and storage medium | |
| CN100359491C (en) | Addressing space extending method of 16M syllable data storage based on MCS-51 structure | |
| CN111651124B (en) | Parallel reconstruction method, device, equipment and medium for SSD mapping table multi-core partition | |
| CN111679909B (en) | Data processing method and device and terminal equipment | |
| CN111562983B (en) | Memory optimization method and device, electronic equipment and storage medium | |
| CN104268005B (en) | Virtual machine awakening method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |