CN110442308B - Data block storage method, device, equipment and storage medium - Google Patents
Data block storage method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN110442308B CN110442308B CN201910606240.9A CN201910606240A CN110442308B CN 110442308 B CN110442308 B CN 110442308B CN 201910606240 A CN201910606240 A CN 201910606240A CN 110442308 B CN110442308 B CN 110442308B
- Authority
- CN
- China
- Prior art keywords
- storage
- time
- data block
- offset
- address
- 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/064—Management of blocks
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)
Abstract
The invention discloses a data block storage method, a device, equipment and a computer storage medium, wherein the method comprises the following steps: acquiring the current storage time of a target data block; obtaining offset time according to the current storage time and the basic time; wherein the base time is any time before the storage time of the first data block; obtaining relative time according to the offset time and the time capacity; wherein the time capacity is a length of time that can store a maximum number of data blocks; obtaining an offset according to the relative time and a storage interval; wherein, the storage interval is the storage interval time between two adjacent data blocks; obtaining a storage address according to the offset, a storage starting address and the size of the data block; wherein, the storage address and the current storage time have a unique mapping relation; and storing the target data block into the storage address to finish storage. Under the condition that time information occupying most space is not stored, the storage time point of the data can be known, most storage space is saved, and the data storage capacity is improved.
Description
Technical Field
The present invention relates to the field of computer applications, and in particular, to a data block storage method, apparatus, device, and storage medium.
Background
With the development of information technology, especially the popularization of the internet, the amount of various types of data is rapidly increasing, especially the increase of video data, and great pressure is brought to the existing storage devices, so that a high-capacity and high-performance storage system is urgently needed to effectively store and quickly access the data.
In practical applications, most of the nonvolatile memory devices are unattended, and the requirement on the data storage capacity is high. Meanwhile, in some fields, the nonvolatile memory device needs to store not only the data blocks, but also know the storage time of the data blocks, and store the data blocks for several years or several decades. The capacity of a conventional nonvolatile storage device in the embedded field is usually small, and is usually only a few megabytes, a large part of the storage pressure of the storage device is derived from stored time information, and the stored time information occupies a large amount of storage space, so that the amount of data which can be stored is reduced.
Disclosure of Invention
In view of the foregoing problems, an object of the present invention is to provide a data block storage method, apparatus, device and storage medium, which can know the storage time point of data without storing time information occupying most of the space, save most of the storage space, and improve the data storage capacity.
In a first aspect, an embodiment of the present invention provides a data block storage method, including:
acquiring the current storage time of a target data block;
obtaining offset time according to the current storage time and the basic time; wherein the base time is any time before the storage time of the first data block;
obtaining relative time according to the offset time and the time capacity; wherein the time capacity is a length of time that can store a maximum number of data blocks;
obtaining an offset according to the relative time and a storage interval; wherein, the storage interval is the storage interval time between two adjacent data blocks;
obtaining a storage address according to the offset, a storage starting address and the size of the data block; wherein, the storage address and the current storage time have a unique mapping relation;
and storing the target data block into the storage address to finish storage.
Preferably, before the obtaining of the storage time of the current data block, the method further includes:
storing boot information for independently allocated pages of the non-volatile memory; wherein the page storage guide information includes a time capacity, a storage start address, a storage end address, a data block size, and a storage interval.
Preferably, a relative time is obtained according to the offset time and the time capacity; the time capacity is a time length capable of storing the most data blocks, and specifically includes:
and performing remainder calculation on the offset time and the time capacity to obtain relative time.
Preferably, each time a storage interval is increased, the storage address is correspondingly increased by one data block size until the storage address reaches the maximum value, and the storage address is calculated from the storage starting address again.
Preferably, the storage time is subtracted from the base time to obtain an offset time;
dividing the relative time by a storage interval to obtain an offset;
the offset is multiplied by the data block size and added to the memory start address to obtain the memory address.
In a second aspect, an embodiment of the present invention provides a data block storage device, including:
a current storage time acquisition unit, configured to acquire a current storage time of the target data block;
the offset time acquisition unit is used for acquiring offset time according to the current storage time and the basic 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 a relative time according to the offset time and the time capacity; wherein the time capacity is a length of time that can store a maximum number of data blocks;
the offset acquisition unit is used for acquiring an 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 acquisition unit is used for acquiring a storage address according to the offset, a storage starting address and the size of the data block; wherein, the storage address and the current storage time have a unique mapping relation;
and the target data block storage unit is used for storing the target data block into the storage address so as to finish storage.
Preferably, before the current storage time obtaining unit, the method is further configured to:
storing boot information for the non-volatile memory independent allocation pages; wherein the page storage guide information includes a time capacity, a storage start address, a storage end address, a data block size, and a storage interval.
Preferably, the relative time obtaining unit is specifically configured to:
and performing remainder calculation on the offset time and the time capacity to obtain relative time.
Preferably, each time a storage interval is increased, the storage address is correspondingly increased by one data block size until the storage address reaches the maximum value, and the storage address is calculated from the storage starting address again.
Preferably, further for:
subtracting the stored time from a base time to obtain an offset time; dividing the relative time by a storage interval to obtain an offset; the offset is multiplied by the data block size and added to the starting memory address to obtain the memory address.
The embodiment of the present invention further provides a data block storage device, which includes 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 data block storage method.
The embodiment of the present invention further provides a computer-readable storage medium, where the computer-readable storage medium includes a stored computer program, and when the computer program runs, the apparatus where the computer-readable storage medium is located is controlled to execute the data block storage method described above.
In the above embodiment, the storage time and the storage address of the data block are mapped through the storage interval and the data block size 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 time information occupying most space, the storage time point of the data can be known under the operation of reading the data block, most storage space is saved, and the data storage capacity is improved.
Drawings
In order to more clearly illustrate the technical solution of the present invention, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart illustrating a data block storage method according to a first embodiment of the present invention.
Fig. 2 is a mapping relationship diagram of 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 according to a second embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In order to better understand the technical scheme of the invention, the following detailed description of the embodiments of the invention is made with reference to the accompanying drawings.
It should be understood that the described embodiments are only some embodiments of the invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terminology used in the embodiments of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the examples of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be understood that the term "and/or" as used herein is merely one type of association that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination" or "in response to a detection", depending on the context. Similarly, the phrases "if determined" or "if detected (a stated condition or event)" may be interpreted as "when determined" or "in response to a determination" or "when detected (a stated condition or event)" or "in response to a detection (a stated condition or event)", depending on the context.
In the embodiments, the references to "first \ second" are merely to distinguish similar objects and do not represent a specific ordering for the objects, and it is to be understood that "first \ second" may be interchanged with a specific order or sequence, where permitted. It should be understood that "first \ second" distinct objects may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced in sequences other than those illustrated or described herein.
The first embodiment is as follows:
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, and in particular, by one or more processors in the data block storage device, and at least includes the following steps:
s101, obtaining the current storage time of the target data block.
In this embodiment, the current storage time refers to a time point of a target data block that needs to be stored or read currently. Specifically, the current storage time is a storage time point.
S102, obtaining offset time according to the current storage time and the basic time; wherein the base time is an arbitrary 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, the current storage time is 2019.06.27, and the storage time of the first data block is 2019.06.01, then the base time may be 2019.05.30 or earlier than the storage time of the first data block, and then the offset time is the current storage time — the base time is 27 days.
S103, obtaining relative time according to the offset time and the time capacity; wherein the time capacity is a length of time 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 performing remainder calculation on the offset time and the time capacity. For example, assuming an offset time of 27 days and a time capacity of 54 days in length, the relative time of 27/54 is given by the remainder of 27 days. It should be noted that the time capacity is an abstract concept, and corresponds to a "space capacity", that is, a time length of a storage device that can store the most data blocks, and the space capacity is an available storage space allocated by the system.
S104, obtaining 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 is understood that the unit of the storage interval is a predetermined amount relative to the original offset time and time capacity.
S105, obtaining a storage address according to the offset, the storage starting address and the size of the data block; and the storage address and the current storage time have a unique mapping relation.
In this embodiment, the offset is multiplied by the data block size + the starting memory address to obtain the memory address. The data block size is a storage space occupied by one data block, assuming that the offset is 9, the time length corresponding to the data block size is 1 day, the starting storage address is 0x87654321, and the storage time corresponding to the starting storage address is 2019.07.05, the storage address is 9 x 1+0x87654321 is 0x87654330, and assuming that the mapping relationship between the storage address and the storage time is 1:1, the storage time corresponding to the storage address is 2019.07.14.
The storage address and the current storage time have a unique mapping relationship, for example, assuming that 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. The unique mapping relation is formed between the storage address and the current storage time, so that when the data block storage device has no storage time at all, and a data block can be read, the storage time point can be known according to the current storage time mapped by the storage address.
And S106, storing the target data block into the storage address to finish storage.
In summary, the storage time and the storage address of the data block are mapped through the storage interval and the data block size 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 time information occupying most space, the storage time point of the data can be known under the operation of reading the data block, most storage space is saved, and the data storage capacity is improved.
On the basis of the foregoing embodiment, in a preferred embodiment of the present invention, before the step S101, the method further includes:
the data block storage device stores the boot information for the independent allocation page of the nonvolatile memory; wherein the page storage guide information includes a time capacity, a storage start address, a storage end address, a data block size, and a storage interval.
On the basis of the above embodiment, in a preferred embodiment of the present invention, each time a storage interval is increased, the storage address is correspondingly increased by one data block size until the storage address reaches the maximum value, and the storage address is calculated from the storage start address again.
As shown in fig. 2, fig. 2 shows a mapping relationship between storage time and storage address. Fig. 2 includes 3 relationships: the storage position relation among the data blocks is expressed by the storage space capacity, the relation of the storage time points is expressed by the storage time capacity, and the corresponding relation of the storage position and the storage time. For the purpose of facilitating an understanding of the present invention, the principles of operation of the present invention are described in detail below:
firstly, the data block storage device independently allocates a page to the nonvolatile memory to store the boot information, wherein the boot information comprises: size of storage space, storage start address, size of data block, storage interval. And then addressing according to the mapping relation between the storage time point and the storage address of the data block, and performing data storage and reading operation in the nonvolatile memory according to the searched storage address.
Specifically, the storage time and the storage address are mapped through a storage interval and the data block size, and then a data block storage address is calculated according to the current time, the data block size and the storage interval, that is, an expression of the storage address may be expressed as: the storage address is ((offset time% time capacity) × space capacity)/time capacity. Wherein the space capacity is an available storage space allocated by the system. The hardware resource is limited, and after the storage space is full, the storage needs to be started again, and the operation is circulated.
The data block storage method comprises the following steps: the method comprises the steps of firstly subtracting current storage time from basic time to obtain offset time, wherein the basic time is any time earlier than the current storage time of a first data block, and then calculating the remainder of the offset time and time capacity to obtain relative time, wherein the time capacity is the time length of the storage device capable of storing the most data blocks. The relative time is then divided by the storage interval to obtain the offset. And finally multiplying the offset by the size of the data block to obtain a storage address. It will be appreciated that if 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 is started again from the stored starting address.
Second embodiment of the invention:
referring to fig. 3, a second embodiment of the present invention provides a data block storage device, including:
a current storage time obtaining unit 100, configured to obtain a 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 a basic 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 a length of time that can store a maximum number of data blocks;
an offset obtaining unit 400, configured to obtain an 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 500, configured to obtain a storage address according to the offset, a storage start address, and a data block size; wherein, the storage address and the current storage time have a unique mapping relation;
and a target data block storage unit 600, configured to store the target data block into the storage address to complete storage.
On the basis of the foregoing embodiment, in a preferred embodiment of the present invention, before the current storage time obtaining unit 100, the current storage time obtaining unit is further configured to:
storing boot information for the volatile memory independent allocation page; wherein the page storage guide information includes a time capacity, a storage start address, a storage end address, a data block size, and a storage interval.
On the basis of the foregoing embodiment, in a preferred embodiment of the present invention, the relative time obtaining unit is specifically configured to:
and performing remainder calculation on the offset time and the time capacity to obtain relative time.
On the basis of the above embodiment, in a preferred embodiment of the present invention, each time a storage interval is increased, the storage address is correspondingly increased by one data block size until the storage address reaches the maximum value, and the storage address is calculated from the storage start address again.
On the basis of the above embodiment, in a preferred embodiment of the present invention, the method is further configured to:
subtracting the stored time from a base time to obtain an offset time; dividing the relative time by a storage interval to obtain an offset; the offset is multiplied by the data block size to obtain the memory address.
A third embodiment of the present invention provides 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 the data block storage method as described above.
A fourth embodiment of the present invention provides a computer-readable storage medium, which includes a stored computer program, where when the computer program runs, the apparatus in which the computer-readable storage medium is located is controlled to execute the data block storage method as described above.
Illustratively, the computer program may be divided into one or more units, which 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 certain functions, the instruction segments describing the execution of the computer program in the data block storage device.
The data block storage device may include, but is not limited to, a processor, a memory. Those skilled in the art will appreciate that the schematic diagram is merely an example of a data block storage device and is not meant to be limiting, and may include more or fewer components than those shown, or some components may be combined, or different components, e.g., the data block storage device may also include input output devices, network access devices, buses, etc.
The Processor may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. The general purpose processor may be a microprocessor or the processor may be any conventional processor or the like, the control center of the data block storage device, various interfaces and lines connecting the various parts of the overall data block storage device.
The memory may be used to store the computer programs and/or modules, and the processor may implement the various functions of the data block storage device by running or executing the computer programs and/or modules stored in the memory, as well as by invoking data stored in the memory. The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, a phonebook, etc.) created according to the use of the cellular phone, and the like. In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.
Wherein, the integrated unit of the data block storage device can be stored in a computer readable storage medium if the integrated unit is realized in the form of a software functional unit and sold or used as a stand-alone product. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like. It should be noted that the computer readable medium may contain content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media does not include electrical carrier signals and telecommunications signals as is required by legislation and patent practice.
It should be noted that the above-described device embodiments are merely illustrative, where the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. In addition, in the drawings of the embodiment of the apparatus provided by the present invention, the connection relationship between the modules indicates that there is a communication connection between them, and may be specifically implemented as one or more communication buses or signal lines. One of ordinary skill in the art can understand and implement it without inventive effort.
While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention.
Claims (8)
1. A method for storing a block of data, comprising:
acquiring the current storage time of a target data block;
obtaining offset time according to the current storage time and the basic time; wherein the base time is any time before the storage time of the first data block;
obtaining relative time according to the offset time and the time capacity; wherein the time capacity is a length of time that can store a maximum number of data blocks; calculating the remainder of the offset time and the time capacity to obtain relative time;
obtaining an offset according to the relative time and a storage interval; wherein, the storage interval is the storage interval time between two adjacent data blocks;
obtaining a storage address according to the offset, a storage starting address and the size of the data block; wherein, the storage address and the current storage time have a unique mapping relation; storing the target data block into a storage address to finish storage; wherein the current storage time is subtracted from a base time to obtain an offset time; dividing the relative time by a storage interval to obtain an offset; the offset is multiplied by the data block size and added to the memory start address to obtain the memory address.
2. The data block storage method according to claim 1, further comprising, before the current storage time of the acquisition target data block:
storing boot information for independently allocated pages of the non-volatile memory; wherein the page storage guide information includes a time capacity, a storage start address, a storage end address, a data block size, and a storage interval.
3. The data block storage method of claim 1,
and when each storage interval is increased, correspondingly increasing the size of one data block by the storage address until the storage address reaches the maximum value, and calculating the storage address from the storage initial address again.
4. A data block storage device, comprising:
a current storage time acquisition unit, configured to acquire a current storage time of the target data block;
the offset time acquisition unit is used for acquiring offset time according to the current storage time and the basic 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 a relative time according to the offset time and the time capacity; wherein the time capacity is a length of time that can store a maximum number of data blocks; calculating the remainder of the offset time and the time capacity to obtain relative time;
the offset acquisition unit is used for acquiring an 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 acquisition unit is used for acquiring a storage address according to the offset, a storage starting address and the size of the data block; wherein, the storage address and the current storage time have a unique mapping relation;
the target data block storage unit is used for storing the target data block into the storage address so as to finish storage; wherein the current storage time is subtracted from a base time to obtain an offset time; dividing the relative time by a storage interval to obtain an offset; the offset is multiplied by the data block size and added to the memory start address to obtain the memory address.
5. The data block storage device of claim 4, further configured to, before the current storage time obtaining unit:
storing boot information for independently allocated pages of the non-volatile memory; wherein the page storage guide information includes a time capacity, a storage start address, a storage end address, a data block size, and a storage interval.
6. The data block storage device of claim 4, wherein the relative time obtaining unit is specifically configured to:
and performing remainder calculation on the offset time and the time capacity to obtain 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 a data block storage method as claimed in any one of claims 1 to 3.
8. A computer-readable storage medium, comprising a stored computer program, wherein the computer program, when executed, controls an apparatus in which the computer-readable storage medium is located to perform a data block storage method according to any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910606240.9A CN110442308B (en) | 2019-07-05 | 2019-07-05 | Data block storage method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910606240.9A CN110442308B (en) | 2019-07-05 | 2019-07-05 | Data block storage method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110442308A CN110442308A (en) | 2019-11-12 |
| CN110442308B true CN110442308B (en) | 2022-05-17 |
Family
ID=68429520
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910606240.9A Active CN110442308B (en) | 2019-07-05 | 2019-07-05 | Data block storage method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110442308B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111090396A (en) * | 2019-12-10 | 2020-05-01 | 联想(北京)有限公司 | File processing method and device and electronic equipment |
| CN113918578B (en) * | 2020-07-10 | 2024-05-24 | 成都秦川物联网科技股份有限公司 | Method for storing power-down data of intelligent gas meter of Internet of things in full-order mode |
| CN112506918B (en) * | 2020-11-03 | 2024-06-04 | 深圳市宏电技术股份有限公司 | Data access method, terminal and computer readable storage medium |
| CN113934373A (en) * | 2021-10-13 | 2022-01-14 | 山东鲁软数字科技有限公司 | Energy monitoring data storage method and system |
| CN114661722A (en) * | 2022-03-23 | 2022-06-24 | 天津同阳科技发展有限公司 | Data storage method, data indexing method and device |
| CN116069260B (en) * | 2023-02-23 | 2024-03-22 | 摩尔线程智能科技(北京)有限责任公司 | Data processing apparatus, data processing method, computer device, and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS5614359A (en) * | 1979-07-13 | 1981-02-12 | Nec Corp | Operation log storing system |
| CN103150397A (en) * | 2013-03-26 | 2013-06-12 | 北京经纬恒润科技有限公司 | Establishing method for data index, and data searching method and system |
| US8578126B1 (en) * | 2009-10-29 | 2013-11-05 | Netapp, Inc. | Mapping of logical start addresses to physical start addresses in a system having misalignment between logical and physical data blocks |
| CN105302883A (en) * | 2015-10-13 | 2016-02-03 | 深圳市乐唯科技开发有限公司 | Time-based media file management method and system |
| EP3285186A1 (en) * | 2016-08-16 | 2018-02-21 | Netscout Systems Texas, LLC | Methods and procedures for timestamp-based indexing of items in real-time storage |
-
2019
- 2019-07-05 CN CN201910606240.9A patent/CN110442308B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS5614359A (en) * | 1979-07-13 | 1981-02-12 | Nec Corp | Operation log storing system |
| US8578126B1 (en) * | 2009-10-29 | 2013-11-05 | Netapp, Inc. | Mapping of logical start addresses to physical start addresses in a system having misalignment between logical and physical data blocks |
| CN103150397A (en) * | 2013-03-26 | 2013-06-12 | 北京经纬恒润科技有限公司 | Establishing method for data index, and data searching method and system |
| CN105302883A (en) * | 2015-10-13 | 2016-02-03 | 深圳市乐唯科技开发有限公司 | Time-based media file management method and system |
| EP3285186A1 (en) * | 2016-08-16 | 2018-02-21 | Netscout Systems Texas, LLC | Methods and procedures for timestamp-based indexing of items in real-time storage |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110442308A (en) | 2019-11-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110442308B (en) | Data block storage method, device, equipment and storage medium | |
| CN111078408B (en) | Memory allocation method and device, storage medium and electronic equipment | |
| CN107391038B (en) | Data writing method of data storage type flash memory, flash memory and storage medium | |
| CN113704140A (en) | Solid state disk address mapping method and device | |
| CN106095416B (en) | Jump processing method and device in application program and intelligent terminal | |
| CN108255989B (en) | Picture storage method and device, terminal equipment and computer storage medium | |
| CN111104178A (en) | Dynamic library loading method, terminal device and storage medium | |
| CN118210455B (en) | Ultra-long field data read-write performance optimization method and device, electronic equipment and storage medium | |
| CN114816263A (en) | Storage access method and intelligent processing device | |
| CN113177045A (en) | Data extraction method and device, computable storage equipment and data request equipment | |
| CN111708715B (en) | Memory allocation method, memory allocation device and terminal equipment | |
| CN108874491A (en) | information loading method and device | |
| CN115237819A (en) | Data storage method, data reading method, data storage device and data reading device | |
| CN111061429B (en) | Data access method, device, equipment and medium | |
| CN111444117A (en) | Method and device for realizing fragmentation of storage space, storage medium and electronic equipment | |
| CN113272785B (en) | Method for mounting file system, terminal equipment and storage medium | |
| CN111143092A (en) | Fault recording data processing method and system and terminal equipment | |
| CN107506253B (en) | Method and device for storing abnormal information of operating system | |
| CN104182181A (en) | Data processing method, device and terminal of memory card | |
| CN111753142B (en) | Label-based retrieval method and device | |
| US20170131946A1 (en) | Method and device for formatting storage of mobile terminal | |
| CN109144399B (en) | Data storage method and device and electronic equipment | |
| CN114385552A (en) | Page integration method and device for file pages in memory | |
| CN111381905B (en) | Program processing method, device and equipment | |
| CN112015672A (en) | Data processing method, device, equipment and storage medium in storage system |
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 |