CN111061429A - Data access method, device, equipment and medium - Google Patents
Data access method, device, equipment and medium Download PDFInfo
- Publication number
- CN111061429A CN111061429A CN201911157860.5A CN201911157860A CN111061429A CN 111061429 A CN111061429 A CN 111061429A CN 201911157860 A CN201911157860 A CN 201911157860A CN 111061429 A CN111061429 A CN 111061429A
- Authority
- CN
- China
- Prior art keywords
- data
- operation request
- cache pool
- read
- array
- 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.)
- Granted
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/061—Improving I/O performance
- G06F3/0611—Improving I/O performance in relation to response time
-
- 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/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
- G06F3/0656—Data buffering arrangements
Abstract
The application discloses a data access method, a device, equipment and a medium, wherein the method comprises the following steps: creating an array to record the reading times and the latest modification time of the data in the cache pool; when a data read-write operation request of a front-end host is received, judging whether the data read-write operation request is a data read operation request; if the data read-write operation request is a data read operation request, judging whether first target data corresponding to the data read operation request is in the cache pool; and if the first target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time which is farthest from the current time to a hard disk, and putting the first target data into the cache pool for the front-end host to read. Therefore, the hit rate of read data in the cache is improved, the read application performance is enhanced, and the read efficiency is improved.
Description
Technical Field
The present application relates to the field of data storage technologies, and in particular, to a data access method, apparatus, device, and medium.
Background
When the front-end host reads data, the front-end host searches in a system cache first, if the data are found, the data are directly returned to the front-end host, if the data are not found, the data are read from the hard disk, the read data are firstly put into the cache, and then the data are returned to the front-end host. When the data in the cache is full and needs to be replaced, the latest modification time of the data in the cache is searched, and the data with the latest modification time is printed on the hard disk.
Disclosure of Invention
In view of this, an object of the present application is to provide a data access method, apparatus, device, and medium, which can print data with the least number of reads and the most recent modification time from the current farthest distance to a hard disk, improve the hit rate of read data in a cache, enhance the performance of read application, and improve the read efficiency. The specific scheme is as follows:
in a first aspect, the present application discloses a data access method, including:
creating an array to record the reading times and the latest modification time of the data in the cache pool;
when a data read-write operation request of a front-end host is received, judging whether the data read-write operation request is a data read operation request;
if the data read-write operation request is a data read operation request, judging whether first target data corresponding to the data read operation request is in the cache pool;
and if the first target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time which is farthest from the current time to a hard disk, and putting the first target data into the cache pool for the front-end host to read.
Optionally, the creating an array to record the read times and the latest modification time of the data in the cache pool includes:
an array is created to record the data address, read times and the latest modification time of the data in the cache pool.
Optionally, after determining whether the data read-write operation request is a data read-write operation request, the method further includes:
and if the data read-write operation request is a data write operation request, updating the latest modification time of the second target data in the array corresponding to the data write operation request.
Optionally, in the process of updating the latest modification time of the second target data corresponding to the data write operation request, the method further includes:
and if the second target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time farthest from the current time to a hard disk so as to store the second target data in the cache pool.
Optionally, after the data with the least number of reads and the latest modification time farthest from the current time is printed on the hard disk, so as to store the second target data into the cache pool, the method further includes:
storing the data address, the read times, and the most recent modification time of the second target data in the array.
Optionally, after determining whether the first target data corresponding to the data read operation request is in the cache pool, the method further includes:
and if the first target data corresponding to the data reading operation request is in the cache pool, returning the first target data to the front-end host, and adding 1 to the reading times of the first target data in the array.
Optionally, after the placing the first target data into a cache pool for the front-end host to read, the method further includes:
storing the data address, the read times, and the most recent modification time of the first target data in the array.
In a second aspect, the present application discloses a data access device, comprising:
the array creating module is used for creating an array record cache pool, wherein the array record cache pool comprises a plurality of data reading times and latest modification time;
the first judgment module is used for judging whether the data read-write operation request is a data read-write operation request or not when receiving the data read-write operation request of the front-end host;
the second judging module is used for judging whether the first target data corresponding to the data reading operation request is in the cache pool or not when the judging result of the first judging module is yes;
and the data downloading and brushing module is used for downloading and brushing the data with the minimum reading times and the latest modification time farthest from the current time to a hard disk according to the array when the first target data is not in the cache pool and the cache pool is full, and putting the first target data into the cache pool for the front-end host to read.
In a third aspect, the present application discloses a data access device, comprising:
a memory and a processor;
wherein the memory is used for storing a computer program;
the processor is configured to execute the computer program to implement the data access method disclosed in the foregoing.
In a fourth aspect, the present application discloses a computer readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the data access method disclosed above.
Therefore, an array is firstly created to record the reading times and the latest modification time of the data in the cache pool; when a data read-write operation request of a front-end host is received, judging whether the data read-write operation request is a data read operation request; if the data read-write operation request is a data read operation request, judging whether first target data corresponding to the data read operation request is in the cache pool; and if the first target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time which is farthest from the current time to a hard disk, and putting the first target data into the cache pool for the front-end host to read. Therefore, the array is firstly created to record the reading times and the latest modification time of the data in the cache pool, so that when the data in the cache pool needs to be replaced, the data with the least reading times and the latest modification time which is farthest from the current time can be printed on the hard disk, the hit rate of the read data in the cache is improved, the reading application performance is enhanced, and the reading efficiency is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
FIG. 1 is a flow chart of a data access method disclosed herein;
FIG. 2 is a flow chart of a particular data access method disclosed herein;
FIG. 3 is a schematic diagram of a data access device according to the present disclosure;
FIG. 4 is a block diagram of a data access device disclosed herein;
fig. 5 is a structural diagram of a user terminal disclosed in the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, 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 application.
At present, when data in a cache is full and needs to be replaced, the latest modification time of the data in the cache is searched, and the data with the longest latest modification time is printed on a hard disk. In view of this, the present application provides a data access method, which can print the data with the least number of reads and the most recent modification time from the current time to the hard disk, thereby improving the hit rate of read data in the cache, enhancing the read application performance, and improving the read efficiency.
The embodiment of the application discloses a data access method, and as shown in fig. 1, the method comprises the following steps:
step S11: an array is created to record the read times and the latest modification time of the data in the cache pool.
In this embodiment, an array needs to be created first to record the read times and the latest modification time of the data in the cache pool. And accumulating the read times from the time when the data is put into the cache pool for the first read. The array can reflect which data are read frequently, and can provide basis for data replacement in the cache pool.
Step S12: and when a data read-write operation request of a front-end host is received, judging whether the data read-write operation request is a data read operation request.
In a specific implementation process, when a data read-write operation request of a front-end host is received, it needs to be determined whether the data read-write operation request is a data read operation request or a data write operation request, and a corresponding response is made according to an actual situation.
Step S13: and if the data read-write operation request is a data read operation request, judging whether first target data corresponding to the data read operation request is in the cache pool.
In a specific implementation process, if the data read-write operation request is a data read operation request, it needs to be determined whether first target data corresponding to the data read operation request is in the cache pool, so as to determine whether the first target data needs to be acquired from a hard disk first. If the first target data is not in the cache pool, the first target data needs to be read from the hard disk first, the first target data is placed in the cache pool, and then the first target data is returned to the front-end host. If the first target data is in the cache pool, the first target data can be directly returned to the front-end host.
Step S14: and if the first target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time which is farthest from the current time to a hard disk, and putting the first target data into the cache pool for the front-end host to read.
In this embodiment, if the first target data is not in the cache pool and the cache pool is full, it is necessary to first print, according to the array, the data with the minimum read times and the latest modification time being farthest from the current time to a hard disk, and then place the first target data in the cache pool for the front-end host to read.
Therefore, an array is firstly created to record the reading times and the latest modification time of the data in the cache pool; when a data read-write operation request of a front-end host is received, judging whether the data read-write operation request is a data read operation request; if the data read-write operation request is a data read operation request, judging whether first target data corresponding to the data read operation request is in the cache pool; and if the first target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time which is farthest from the current time to a hard disk, and putting the first target data into the cache pool for the front-end host to read. Therefore, the array is firstly created to record the reading times and the latest modification time of the data in the cache pool, so that when the data in the cache pool needs to be replaced, the data with the least reading times and the latest modification time which is farthest from the current time can be printed on the hard disk, the hit rate of the read data in the cache is improved, the reading application performance is enhanced, and the reading efficiency is improved.
Referring to fig. 2, an embodiment of the present application discloses a specific data access method, which includes:
step S21: an array is created to record the data address, read times and the latest modification time of the data in the cache pool.
In a specific implementation process, a data record is created to record the read times and the latest modification time of data in a cache pool. Specifically, the content recorded in the array includes: data address, read times, and most recent modification time.
Step S22: and when a data read-write operation request of a front-end host is received, judging whether the data read-write operation request is a data read operation request.
In a specific implementation process, if the data read-write operation request is a data write operation request, the latest modification time of the second target data in the array corresponding to the data write operation request is updated. In the process of updating the latest modification time of the second target data corresponding to the data write operation request, the method further includes: and if the second target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time farthest from the current time to a hard disk so as to store the second target data in the cache pool. After the data with the minimum read times and the latest modification time farthest from the current time is printed on the hard disk so as to store the second target data into the cache pool, the method further includes: storing the data address, the read times, and the most recent modification time of the second target data in the array.
Step S23: and if the data read-write operation request is a data read operation request, judging whether first target data corresponding to the data read operation request is in the cache pool.
In a specific implementation process, if first target data corresponding to the data read operation request is in the cache pool, returning the first target data to the front-end host, and adding 1 to the read times of the first target data in the array.
Step S24: and if the first target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time which is farthest from the current time to a hard disk, and putting the first target data into the cache pool for the front-end host to read.
Step S25: storing the data address, the read times, and the most recent modification time of the first target data in the array.
In a specific implementation process, if the first target data corresponding to the data read operation request is not in the cache pool and the cache pool is full, the data with the least read times and the latest modification time farthest from the current time is printed on a hard disk, and the first target data is placed in the cache pool for the front-end host to read. And storing the data address, the read times and the latest modification time of the first target data into the array. In practical cases, the data that is printed down to the hard disk may be 5% -10% of the entire cache pool data.
Referring to fig. 3, an embodiment of the present application discloses a data access apparatus, including:
the array creating module 11 is configured to create an array to record the read times and the latest modification time of the data in the cache pool;
the first judging module 12 is configured to, when receiving a data read-write operation request of a front-end host, judge whether the data read-write operation request is a data read operation request;
a second judging module 13, configured to, when a judgment result of the first judging module is yes, judge whether the first target data corresponding to the data read operation request is in the cache pool;
and a data downloading and brushing module 14, configured to, when the first target data is not in the cache pool and the cache pool is full, download, according to the array, the data with the minimum read frequency and the latest modification time farthest from the current time to a hard disk, and place the first target data in the cache pool for reading by the front-end host.
Therefore, an array is firstly created to record the reading times and the latest modification time of the data in the cache pool; when a data read-write operation request of a front-end host is received, judging whether the data read-write operation request is a data read operation request; if the data read-write operation request is a data read operation request, judging whether first target data corresponding to the data read operation request is in the cache pool; and if the first target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time which is farthest from the current time to a hard disk, and putting the first target data into the cache pool for the front-end host to read. Therefore, the array is firstly created to record the reading times and the latest modification time of the data in the cache pool, so that when the data in the cache pool needs to be replaced, the data with the least reading times and the latest modification time which is farthest from the current time can be printed on the hard disk, the hit rate of the read data in the cache is improved, the reading application performance is enhanced, and the reading efficiency is improved.
Further, referring to fig. 4, an embodiment of the present application further discloses a data access device, including: a processor 21 and a memory 22.
Wherein the memory 22 is used for storing a computer program; the processor 21 is configured to execute the computer program to implement the data access method disclosed in the foregoing embodiment.
For the specific process of the data access method, reference may be made to corresponding contents disclosed in the foregoing embodiments, and details are not repeated here.
Fig. 5 is a schematic structural diagram of a user terminal 20 according to an embodiment of the present disclosure, where the user terminal may specifically include, but is not limited to, a tablet computer, a notebook computer, or a desktop computer.
Generally, the user terminal 20 in the present embodiment includes: a processor 21 and a memory 22.
In some embodiments, user terminal 20 may also include a display 23, an input-output interface 24, a communication interface 25, a sensor 26, a power supply 27, and a communication bus 28.
The processor 21 may include one or more processing cores, such as a four-core processor, an eight-core processor, and so on. The processor 21 may be implemented by at least one hardware of a DSP (digital signal processing), an FPGA (field-programmable gate array), and a PLA (programmable logic array). The processor 21 may also include a main processor and a coprocessor, where the main processor is a processor for processing data in an awake state, and is also called a Central Processing Unit (CPU); a coprocessor is a low power processor for processing data in a standby state. In some embodiments, the processor 21 may be integrated with a GPU (graphics processing unit) which is responsible for rendering and drawing images to be displayed on the display screen. In some embodiments, the processor 21 may include an AI (artificial intelligence) processor for processing a calculation operation related to machine learning.
Those skilled in the art will appreciate that the configuration shown in fig. 5 is not intended to be limiting of user terminal 20 and may include more or fewer components than those shown.
Further, an embodiment of the present application also discloses a computer readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the following steps:
creating an array to record the reading times and the latest modification time of the data in the cache pool; when a data read-write operation request of a front-end host is received, judging whether the data read-write operation request is a data read operation request; if the data read-write operation request is a data read operation request, judging whether first target data corresponding to the data read operation request is in the cache pool; and if the first target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time which is farthest from the current time to a hard disk, and putting the first target data into the cache pool for the front-end host to read.
Therefore, an array is firstly created to record the reading times and the latest modification time of the data in the cache pool; when a data read-write operation request of a front-end host is received, judging whether the data read-write operation request is a data read operation request; if the data read-write operation request is a data read operation request, judging whether first target data corresponding to the data read operation request is in the cache pool; and if the first target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time which is farthest from the current time to a hard disk, and putting the first target data into the cache pool for the front-end host to read. Therefore, the array is firstly created to record the reading times and the latest modification time of the data in the cache pool, so that when the data in the cache pool needs to be replaced, the data with the least reading times and the latest modification time which is farthest from the current time can be printed on the hard disk, the hit rate of the read data in the cache is improved, the reading application performance is enhanced, and the reading efficiency is improved.
In this embodiment, when the computer subprogram stored in the computer-readable storage medium is executed by the processor, the following steps may be specifically implemented: an array is created to record the data address, read times and the latest modification time of the data in the cache pool.
In this embodiment, when the computer subprogram stored in the computer-readable storage medium is executed by the processor, the following steps may be specifically implemented: and if the data read-write operation request is a data write operation request, updating the latest modification time of the second target data in the array corresponding to the data write operation request.
In this embodiment, when the computer subprogram stored in the computer-readable storage medium is executed by the processor, the following steps may be specifically implemented: and if the second target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time farthest from the current time to a hard disk so as to store the second target data in the cache pool.
In this embodiment, when the computer subprogram stored in the computer-readable storage medium is executed by the processor, the following steps may be specifically implemented: storing the data address, the read times, and the most recent modification time of the second target data in the array.
In this embodiment, when the computer subprogram stored in the computer-readable storage medium is executed by the processor, the following steps may be specifically implemented: and if the first target data corresponding to the data reading operation request is in the cache pool, returning the first target data to the front-end host, and adding 1 to the reading times of the first target data in the array.
In this embodiment, when the computer subprogram stored in the computer-readable storage medium is executed by the processor, the following steps may be specifically implemented: storing the data address, the read times, and the most recent modification time of the first target data in the array.
The embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts among the embodiments are referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
Finally, it is further noted that, herein, relational terms such as first and second, and the like may be 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. Also, 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 other 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 an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The foregoing detailed description is directed to a data access method, apparatus, device, and medium provided by the present application, and specific examples are applied in the present application to explain the principles and implementations of the present application, and the descriptions of the foregoing examples are only used to help understand the method and core ideas of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.
Claims (10)
1. A method of data access, comprising:
creating an array to record the reading times and the latest modification time of the data in the cache pool;
when a data read-write operation request of a front-end host is received, judging whether the data read-write operation request is a data read operation request;
if the data read-write operation request is a data read operation request, judging whether first target data corresponding to the data read operation request is in the cache pool;
and if the first target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time which is farthest from the current time to a hard disk, and putting the first target data into the cache pool for the front-end host to read.
2. The data access method of claim 1, wherein the creating an array to record read times and most recent modification times of data in the cache pool comprises:
an array is created to record the data address, read times and the latest modification time of the data in the cache pool.
3. The data access method of claim 2, wherein after determining whether the data read/write operation request is a data read operation request, the method further comprises:
and if the data read-write operation request is a data write operation request, updating the latest modification time of the second target data in the array corresponding to the data write operation request.
4. The data access method according to claim 3, wherein in the process of updating the latest modification time of the second target data corresponding to the data write operation request, the method further comprises:
and if the second target data is not in the cache pool and the cache pool is full, according to the array, printing the data with the minimum reading times and the latest modification time farthest from the current time to a hard disk so as to store the second target data in the cache pool.
5. The data access method of claim 4, wherein after the data with the least number of reads and the most recent modification time being farthest from the current time is printed to a hard disk to store the second target data in the cache pool, the method further comprises:
storing the data address, the read times, and the most recent modification time of the second target data in the array.
6. The data access method according to claim 5, wherein after determining whether the first target data corresponding to the data read operation request is in the cache pool, the method further comprises:
and if the first target data corresponding to the data reading operation request is in the cache pool, returning the first target data to the front-end host, and adding 1 to the reading times of the first target data in the array.
7. The data access method according to any one of claims 2 to 6, wherein after the placing the first target data into the cache pool for reading by the front-end host, further comprising:
storing the data address, the read times, and the most recent modification time of the first target data in the array.
8. A data access device, comprising:
the array creating module is used for creating an array record cache pool, wherein the array record cache pool comprises a plurality of data reading times and latest modification time;
the first judgment module is used for judging whether the data read-write operation request is a data read-write operation request or not when receiving the data read-write operation request of the front-end host;
the second judging module is used for judging whether the first target data corresponding to the data reading operation request is in the cache pool or not when the judging result of the first judging module is yes;
and the data downloading and brushing module is used for downloading and brushing the data with the minimum reading times and the latest modification time farthest from the current time to a hard disk according to the array when the first target data is not in the cache pool and the cache pool is full, and putting the first target data into the cache pool for the front-end host to read.
9. A data access device, comprising:
a memory and a processor;
wherein the memory is used for storing a computer program;
the processor for executing the computer program to implement the data access method of any one of claims 1 to 7.
10. A computer-readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements a data access method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911157860.5A CN111061429B (en) | 2019-11-22 | 2019-11-22 | Data access method, device, equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911157860.5A CN111061429B (en) | 2019-11-22 | 2019-11-22 | Data access method, device, equipment and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111061429A true CN111061429A (en) | 2020-04-24 |
| CN111061429B CN111061429B (en) | 2022-06-17 |
Family
ID=70298144
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911157860.5A Active CN111061429B (en) | 2019-11-22 | 2019-11-22 | Data access method, device, equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111061429B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113076067A (en) * | 2021-04-16 | 2021-07-06 | 北京沃东天骏信息技术有限公司 | Method and device for eliminating cache data |
| CN114089912A (en) * | 2021-10-19 | 2022-02-25 | 银联商务股份有限公司 | Data processing method and device based on message middleware and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110191540A1 (en) * | 2010-02-03 | 2011-08-04 | International Business Machines Corporation | Processing read and write requests in a storage controller |
| US9606938B1 (en) * | 2014-06-30 | 2017-03-28 | EMC IP Holding Company LLC | Managing caches in storage systems |
| WO2017157158A1 (en) * | 2016-03-17 | 2017-09-21 | 中兴通讯股份有限公司 | Data writing method and apparatus, and computer storage medium |
| CN108491166A (en) * | 2018-03-27 | 2018-09-04 | 江苏菲利斯通信息科技有限公司 | Reading data caching management method towards CD server |
| CN108875046A (en) * | 2018-06-28 | 2018-11-23 | 郑州云海信息技术有限公司 | A kind of storage system access method, device and electronic equipment |
| CN108920300A (en) * | 2018-08-02 | 2018-11-30 | 郑州云海信息技术有限公司 | A kind of data manipulation method and relevant apparatus |
| CN110008142A (en) * | 2019-04-16 | 2019-07-12 | 苏州浪潮智能科技有限公司 | Storing data management method, device, equipment and computer readable storage medium |
| US20190303037A1 (en) * | 2018-03-30 | 2019-10-03 | Ca, Inc. | Using sequential read intention to increase data buffer reuse |
-
2019
- 2019-11-22 CN CN201911157860.5A patent/CN111061429B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110191540A1 (en) * | 2010-02-03 | 2011-08-04 | International Business Machines Corporation | Processing read and write requests in a storage controller |
| US9606938B1 (en) * | 2014-06-30 | 2017-03-28 | EMC IP Holding Company LLC | Managing caches in storage systems |
| WO2017157158A1 (en) * | 2016-03-17 | 2017-09-21 | 中兴通讯股份有限公司 | Data writing method and apparatus, and computer storage medium |
| CN108491166A (en) * | 2018-03-27 | 2018-09-04 | 江苏菲利斯通信息科技有限公司 | Reading data caching management method towards CD server |
| US20190303037A1 (en) * | 2018-03-30 | 2019-10-03 | Ca, Inc. | Using sequential read intention to increase data buffer reuse |
| CN108875046A (en) * | 2018-06-28 | 2018-11-23 | 郑州云海信息技术有限公司 | A kind of storage system access method, device and electronic equipment |
| CN108920300A (en) * | 2018-08-02 | 2018-11-30 | 郑州云海信息技术有限公司 | A kind of data manipulation method and relevant apparatus |
| CN110008142A (en) * | 2019-04-16 | 2019-07-12 | 苏州浪潮智能科技有限公司 | Storing data management method, device, equipment and computer readable storage medium |
Non-Patent Citations (9)
| Title |
|---|
| ALI A. TITINCHI等: "FPGA implementation of simplified Fuzzy LRU replacement algorithm", 《2019 16TH INTERNATIONAL MULTI-CONFERENCE ON SYSTEMS, SIGNALS & DEVICES (SSD)》 * |
| 刘秉煦等: "面向SSD/HDD混合存储的动态缓存调度算法DRC", 《微型电脑应用》 * |
| 周健等: "组合盘中结合访问次数与能量代价的文件缓存替换策略", 《计算机系统应用》 * |
| 尚晓薇等: "一种基于闪存的缓冲区管理算法", 《计算机与现代化》 * |
| 朱平等: "磁盘缓存管理机制研究", 《计算机工程与应用》 * |
| 汤显等: "FClock:一种面向SSD的自适应缓冲区管理算法", 《计算机学报》 * |
| 王志刚等: "一种高效率访问NAND数据的方法", 《通信技术》 * |
| 王江涛等: "闪存数据库:现状、技术与展望", 《计算机学报》 * |
| 郑开: "闪存数据库缓冲区置换算法综述", 《微型机与应用》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113076067A (en) * | 2021-04-16 | 2021-07-06 | 北京沃东天骏信息技术有限公司 | Method and device for eliminating cache data |
| CN114089912A (en) * | 2021-10-19 | 2022-02-25 | 银联商务股份有限公司 | Data processing method and device based on message middleware and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111061429B (en) | 2022-06-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3131265A1 (en) | Data prefetching method for distributed hash table dht storage system, node, and system | |
| CN109614377A (en) | File delet method, device, equipment and the storage medium of distributed file system | |
| CN105677580A (en) | Method and device for accessing cache | |
| CN111061429B (en) | Data access method, device, equipment and medium | |
| CN107402870B (en) | Method and device for processing log segment in metadata server | |
| CN105393228B (en) | Read and write the method, apparatus and user equipment of data in flash memory | |
| CN112286459A (en) | Data processing method, device, equipment and medium | |
| CN109800181B (en) | Disk-based data writing method, data writing device and terminal equipment | |
| CN104156321A (en) | Data pre-fetching method and device | |
| CN110673789A (en) | Metadata storage management method, device, equipment and storage medium of solid state disk | |
| CN109213450B (en) | Associated metadata deleting method, device and equipment based on flash memory array | |
| CN111177079A (en) | Network file system data reading method, device, equipment and medium | |
| CN103176753A (en) | Storage device and data management method of storage device | |
| CN111026682B (en) | Data access method and device of board card chip and computer readable storage medium | |
| CN112463041B (en) | Processing method for host read-write data and related device | |
| CN111459848B (en) | File fragment sorting method and device, storage medium and electronic equipment | |
| CN110019086A (en) | More copy read methods, equipment and storage medium based on distributed file system | |
| CN113821499A (en) | Method, device and equipment for eliminating data in double storage pools | |
| CN114296635A (en) | Cache elimination method and device of cache data, terminal and storage medium | |
| CN111090633A (en) | Small file aggregation method, device and equipment of distributed file system | |
| CN111124285B (en) | Solid state disk data holding method, device, equipment and medium | |
| CN111625192B (en) | Metadata object access method, device, equipment and medium | |
| CN111143418A (en) | Data reading method, device and equipment for database and storage medium | |
| EP2511825A1 (en) | Method and device for configuring memory capacity | |
| TWI592943B (en) | Data management method for data storage device and memory controller |
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 |