CN108984128B - Data reading method and device - Google Patents

Data reading method and device Download PDF

Info

Publication number
CN108984128B
CN108984128B CN201810797726.0A CN201810797726A CN108984128B CN 108984128 B CN108984128 B CN 108984128B CN 201810797726 A CN201810797726 A CN 201810797726A CN 108984128 B CN108984128 B CN 108984128B
Authority
CN
China
Prior art keywords
data
memory
target data
target
block 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
Application number
CN201810797726.0A
Other languages
Chinese (zh)
Other versions
CN108984128A (en
Inventor
刚亚州
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhengzhou Yunhai Information Technology Co Ltd
Original Assignee
Zhengzhou Yunhai Information Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhengzhou Yunhai Information Technology Co Ltd filed Critical Zhengzhou Yunhai Information Technology Co Ltd
Priority to CN201810797726.0A priority Critical patent/CN108984128B/en
Publication of CN108984128A publication Critical patent/CN108984128A/en
Application granted granted Critical
Publication of CN108984128B publication Critical patent/CN108984128B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/0659—Command handling arrangements, e.g. command buffers, queues, command scheduling
    • 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
    • G06F3/0673—Single storage device

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)
  • Memory System Of A Hierarchy Structure (AREA)
  • Storage Device Security (AREA)

Abstract

The application discloses a data reading method and a data reading device, which comprise the following steps: acquiring a data reading request for requesting target data; determining whether the target data is in the memory by utilizing a hash chain table according to the data reading request; and if the target data is in the memory, reading the target data from the memory. Therefore, by using the data reading method and device provided by the embodiment of the application, whether the target data is in the memory can be judged firstly, if the target data is in the memory, the target data can be directly read from the memory without reading the target data from the storage device such as a magnetic disk, and the time spent on reading the target data from the memory is shorter than the time spent on reading the target data from the storage device, so that the efficiency of reading the target data is improved.

Description

Data reading method and device
Technical Field
The present application relates to the field of data processing, and in particular, to a data reading method and apparatus.
Background
With the development of information technology, a huge amount of data is generated. Data storage devices, such as hard disks, are currently available for storing data and reading the data from the storage device, such as a magnetic disk, when it is desired to view or use the data.
However, the speed of reading data from a magnetic disk is generally slow, and the data reading efficiency is low.
Therefore, it is desirable to provide a solution that can improve the efficiency of data reading.
Disclosure of Invention
The technical problem to be solved by the present application is how to improve the efficiency of data reading, and a data reading method and apparatus are provided.
In a first aspect, an embodiment of the present application provides a data reading method, including:
acquiring a data reading request for requesting target data;
determining whether the target data is in the memory by utilizing a hash chain table according to the data reading request;
and if the target data is in the memory, reading the target data from the memory.
Optionally, the data reading request carries a logical block address of the target data and a physical block address of the target data; determining whether the target data is in the memory by using a hash chain table according to the data reading request, including:
calculating a target hash value by using a hash algorithm according to the logical block address;
and if the target hash value exists in the hash chain table and the physical block address corresponding to the target hash value in the hash chain table comprises the physical block address of the target data, determining that the target data is in the memory.
Optionally, if the target data is in the memory, the method further includes:
moving the target hash value and the physical block address of the target data from a least recently used LRU queue to a head of the LRU queue;
the LRU queue stores the hash value of the memory data in the memory and the physical block address of the memory data.
Optionally, the method further includes:
and if the target data is not in the memory, reading the target data from the storage equipment.
Optionally, the method further includes:
writing the target data into the memory, storing the physical block address of the target data and the hash value of the target data to the head of the LRU queue, and storing the physical block address of the target data and the hash value of the target data in the hash chain table.
Optionally, the method further includes:
if the LRU queue is full, deleting the data at the tail of the LRU queue, deleting the data corresponding to the data at the tail of the LRU queue in the hash chain table, and deleting the memory data corresponding to the data at the tail of the LRU queue from the memory.
In a second aspect, an embodiment of the present application provides a data reading apparatus, including:
an acquisition unit configured to acquire a data read request for requesting target data;
a determining unit, configured to determine whether the target data is in the memory by using a hash chain table according to the data reading request;
the first reading unit is used for reading the target data from the memory if the target data is in the memory.
Optionally, the data reading request carries a logical block address of the target data and a physical block address of the target data; the determining unit is specifically configured to:
calculating a target hash value by using a hash algorithm according to the logical block address;
and if the target hash value exists in the hash chain table and the physical block address corresponding to the target hash value in the hash chain table comprises the physical block address of the target data, determining that the target data is in the memory.
Optionally, if the target data is in the memory, the apparatus further includes:
a moving unit for moving the target hash value and the physical block address of the target data from a least recently used LRU queue to a head of the LRU queue;
the LRU queue stores the hash value of the memory data in the memory and the physical block address of the memory data.
Optionally, the apparatus further comprises:
and the second reading unit is used for reading the target data from the storage device if the target data is not in the memory.
Optionally, the apparatus further comprises:
and the writing unit is used for writing the target data into the memory, storing the physical block address of the target data and the hash value of the target data to the head of the LRU queue, and storing the physical block address of the target data and the hash value of the target data into the hash chain table.
Optionally, the apparatus further comprises:
and the deleting unit is used for deleting the data at the tail part of the LRU queue if the LRU queue is full, deleting the data corresponding to the data at the tail part of the LRU queue in the hash chain table, and deleting the memory data corresponding to the data at the tail part of the LRU queue from the memory.
Compared with the prior art, the embodiment of the application has the following advantages:
the embodiment of the application provides a data reading method and a data reading device, and the data reading method comprises the following steps: acquiring a data reading request for requesting target data; determining whether the target data is in the memory by utilizing a hash chain table according to the data reading request; and if the target data is in the memory, reading the target data from the memory. Therefore, by using the data reading method and device provided by the embodiment of the application, whether the target data is in the memory can be judged firstly, if the target data is in the memory, the target data can be directly read from the memory without reading the target data from the storage device such as a magnetic disk, and the time spent on reading the target data from the memory is shorter than the time spent on reading the target data from the storage device, so that the efficiency of reading the target data 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 described below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a schematic flowchart of a data reading method according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a hash chain table according to an embodiment of the present application;
fig. 3 is a flowchart illustrating a method for determining whether target data exists in a memory according to an embodiment of the present disclosure;
fig. 4 is a schematic structural diagram of an LRU queue according to an embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of a data reading apparatus according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions of the present application better understood, 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.
The inventors of the present application have studied and found that data can be stored in a data storage device, such as a hard disk, and read from the data storage device, such as a hard disk, when the data needs to be viewed or used. However, the speed of reading data from a hard disk is generally slow, and the data reading efficiency is low.
The inventor of the present application has found in research that data with relatively high access frequency can be stored in a memory, so that when the data with relatively high access frequency needs to be read, the data can be directly read from the memory without reading the data from a storage device. Because the data reading speed from the memory is higher, the data reading efficiency can be improved.
In view of this, an embodiment of the present application provides a data reading method and apparatus, including: acquiring a data reading request for requesting target data; determining whether the target data is in the memory by utilizing a hash chain table according to the data reading request; and if the target data is in the memory, reading the target data from the memory. Therefore, by using the data reading method and device provided by the embodiment of the application, whether the target data is in the memory can be judged firstly, if the target data is in the memory, the target data can be directly read from the memory without reading the target data from the storage device such as a magnetic disk, and the time spent on reading the target data from the memory is shorter than the time spent on reading the target data from the storage device, so that the efficiency of reading the target data is improved.
Various non-limiting embodiments of the present application are described in detail below with reference to the accompanying drawings.
Exemplary method
Referring to fig. 1, the figure is a schematic flowchart of a data reading method according to an embodiment of the present application.
The data reading method provided by the embodiment of the application can be realized through the following steps S101 to S103, for example.
S101: a data read request for requesting target data is obtained.
It should be noted that, in the embodiment of the present application, the data read request is used to request to read target data.
It should be noted that the embodiment of the present application is not particularly limited to the target data, and as an example, the target data may be metadata.
The embodiments of the present application do not specifically limit the content included in the data reading request. The content of the data reading request can be specifically determined according to actual conditions. In a possible implementation manner of the embodiment of the present application, the data read request may carry a Logical Block Address (LBA) of the target data and a Physical Block Address (PBA) of the target data.
S102: and determining whether the target data exists in the memory by utilizing a hash chain table according to the data reading request.
It should be noted that, in the embodiment of the present application, a hash chain table is used to determine whether the target data exists in the memory.
First, a hash chain table is briefly introduced.
Referring to fig. 2, the figure is a schematic structural diagram of a hash chain table provided in the embodiment of the present application.
In the hash chain table shown in fig. 2, a hash value d1 is stored in 210, a hash value d2 is stored in 220, a hash value d3 is stored in 230, and a hash value d4 is stored in 240. The hash value may correspond to a storage location of the data in the memory.
Each hash value corresponds to a record storage area, in fig. 2, the hash value d1 corresponds to the record storage area 210a, the hash value d2 corresponds to the record storage area 220a, the hash value d3 corresponds to the record storage area 230a, and the hash value d4 corresponds to the record storage area 240 a.
In the recording storage area 210a, there are several physical block addresses, for example, a1, a2, and a3, and the combination of any one of the physical block addresses in the hash value d1 and 210a can point to part of the memory data stored in the memory. For example, d1 and a1 may point to portions of memory data stored in memory, d1 and a2 may point to portions of memory data stored in memory, and d1 and a3 may point to portions of memory data stored in memory. Similarly, there are several physical block addresses in the recording storage area 220a, and the combination of any one of the physical block addresses in the hash values d2 and 220a can point to part of the memory data stored in the memory; recording that the storage area 230a has a plurality of physical block addresses, and the combination of any one of the physical block addresses in the hash values d3 and 230a can point to part of the memory data stored in the memory; there are several physical block addresses in the recording storage area 240a, and the combination of any one of the physical block addresses in the hash values d4 and 240a can point to part of the memory data stored in the memory.
When the step S102 is implemented specifically, it can be implemented by the following steps S301 to S302.
S301: and calculating by utilizing a hash algorithm according to the logical block address to obtain a target hash value.
As described above, the data read request may carry the logical block address of the target data. Therefore, a target hash value can be calculated by a hash algorithm according to the logical block address.
It should be noted that the embodiment of the present application is not particularly limited to the hash algorithm, and as an example, a hash algorithm that makes the length distribution of the hash chain table uniform may be selected. Taking the hash chain table shown in fig. 2 as an example, a hash algorithm that makes the length distribution of the record storage areas 210a, 220a, 230a, and 240a uniform may be selected.
S302: and if the target hash value exists in the hash chain table and the physical block address corresponding to the target hash value in the hash chain table comprises the physical block address of the target data, determining that the target data is in the memory.
As described above for the hash chain, each hash value in the hash chain corresponds to a record storage area. In this embodiment, the physical block address corresponding to the target hash value refers to a physical block address in a record storage area corresponding to the target hash value. Taking fig. 2 as an example, if the target hash value is d1, the physical block address in the storage area 210a is recorded, i.e. the physical block address corresponding to the target hash value d 1.
As described above, the combination of the hash value and any physical block address in the record storage area corresponding to the hash value may point to a part of the memory data stored in the memory. Therefore, in the embodiment of the present application, if the target hash value exists in the hash chain table, and the physical block address corresponding to the target hash value includes the physical block address of the target data, it indicates that the target data is in the memory.
S103: and if the target data exists in the memory, reading the target data from the memory.
It is understood that, after determining that the target data is in the memory, the target data may be read from the memory by using the hash value of the target data and/or the physical block address of the target data.
Therefore, by using the data reading method provided by the embodiment of the application, whether the target data is in the memory can be judged firstly, if the target data is in the memory, the target data can be directly read from the memory without reading the target data from the storage device such as a magnetic disk, and the time spent on reading the target data from the memory is shorter than the time spent on reading the target data from the storage device, so that the efficiency of reading the target data is improved.
It is understood that in practical applications, the storage space of the memory is limited, and therefore, in order to increase the utilization rate of the memory and maximize the efficiency of data reading, it is preferable to store some data with high access frequency in the memory. In view of this, in a possible implementation manner of the embodiment of the present application, a Least Recently Used (LRU) queue may also be introduced. And managing the data stored in the memory so as to eliminate partial data in the memory in time when the memory storage space is insufficient.
First, a brief introduction is made to the LRU queue.
Referring to fig. 4, a schematic diagram of a LRU queue according to an embodiment of the present disclosure is shown.
Where 410 is the head of the LRU queue and 420 is the tail of the LRU queue. The LRU queue is used to store information of data stored in the memory, for example, in the embodiment of the present application, a hash value and a physical block address of the data may be stored. When data in the memory is accessed, the information of the data is inserted into the head 410 of the LRU queue, and when the data on the disk is accessed, the information of the data is also inserted into the head 410 of the LRU queue; if the LRU queue is full, the information stored at the tail of the queue is deleted. That is, the LRU queue deletes the memory data whose access time is farthest from the current time.
In the embodiment of the present application, the LRU queue stores the hash value of the memory data in the memory and the physical block address of the memory data. When the target data is in the memory, the hash value of the target data, i.e., the target hash value and the physical block address of the target data, may be moved to the head of the LRU queue to indicate that the target data is the most recently read data.
It is understood that in practical applications, it is possible that the target data is not in the memory, and for this case, in the embodiment of the present application, the target data may be read from a storage device such as a magnetic disk.
It can be understood that the currently read data is more likely to be read later, and therefore, in order to improve the reading efficiency when the target data is read again, in the embodiment of the present application, the target data may be written into the memory. Correspondingly, the hash value of the target data and the physical block address of the target data are stored in the hash chain table, so that the hash chain table can be used for determining that the target data is in the memory when the target data is read next time. Accordingly, in order to facilitate management of the data in the memory, the physical block address of the target data and the hash value of the target data (i.e., the target hash value) may be stored at the head of the LRU queue.
It can be understood that the memory space of the memory is limited, and if the memory space of the memory is full before the target data is written into the memory, a part of the memory space in the memory needs to be released so as to write the target data into the memory. At this point, the LRU queue may be utilized to determine which data in memory to delete. Specifically, since the access time of the memory data corresponding to the LRU queue tail is farthest from the current time, the frequency of accessing the memory data corresponding to the LRU queue tail later may be relatively low, and therefore, in a possible implementation manner of the embodiment of the present application, if the LRU queue is full, the data at the LRU queue tail may be deleted, the data corresponding to the data at the LRU queue tail in the hash chain table may be deleted, and the memory data corresponding to the data at the LRU queue tail may be deleted from the memory.
It should be noted that the LRU queue is full, which indicates that the memory space of the memory is full.
It can be understood that deleting the data corresponding to the data at the tail of the LRU queue in the hash chain table may determine that the deleted memory data is not in the memory by using the hash chain table when reading the deleted memory data again.
Exemplary device
Referring to fig. 5, a schematic structural diagram of a data reading apparatus according to an embodiment of the present application is shown.
The apparatus 500 may specifically include, for example: an acquisition unit 510, a determination unit 520, and a first reading unit 530.
An obtaining unit 510, configured to obtain a data read request for requesting target data;
a determining unit 520, configured to determine whether the target data is in the memory according to the data reading request by using a hash chain table;
a first reading unit 530, configured to read the target data from the memory if the target data is in the memory.
Optionally, the data reading request carries a logical block address of the target data and a physical block address of the target data; the determining unit 520 is specifically configured to:
calculating a target hash value by using a hash algorithm according to the logical block address;
and if the target hash value exists in the hash chain table and the physical block address corresponding to the target hash value in the hash chain table comprises the physical block address of the target data, determining that the target data is in the memory.
Optionally, if the target data is in the memory, the apparatus 500 further includes:
a moving unit for moving the target hash value and the physical block address of the target data from a least recently used LRU queue to a head of the LRU queue;
the LRU queue stores the hash value of the memory data in the memory and the physical block address of the memory data.
Optionally, the apparatus 500 further includes:
and the second reading unit is used for reading the target data from the storage device if the target data is not in the memory.
Optionally, the apparatus 500 further includes:
and the writing unit is used for writing the target data into the memory, storing the physical block address of the target data and the hash value of the target data to the head of the LRU queue, and storing the physical block address of the target data and the hash value of the target data into the hash chain table.
Optionally, the apparatus 500 further includes:
and the deleting unit is used for deleting the data at the tail part of the LRU queue if the LRU queue is full, deleting the data corresponding to the data at the tail part of the LRU queue in the hash chain table, and deleting the memory data corresponding to the data at the tail part of the LRU queue from the memory.
It should be noted that, since the apparatus 500 is an apparatus corresponding to the method provided in the above method embodiment, for specific implementation of each unit of the apparatus 500, reference may be made to the description part of the above method embodiment, and details are not described here again.
Therefore, by using the data reading device provided by the embodiment of the application, whether the target data is in the memory can be judged firstly, if the target data is in the memory, the target data can be directly read from the memory without reading the target data from the storage device such as a magnetic disk, and the time spent on reading the target data from the memory is shorter than the time spent on reading the target data from the storage device, so that the efficiency of reading the target data is improved.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice in the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It will be understood that the present application is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the attached claims
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the protection scope of the present application.

Claims (8)

1. A data reading method, comprising:
acquiring a data reading request for requesting target data;
determining whether the target data is in the memory by utilizing a hash chain table according to the data reading request;
if the target data is in the memory, reading the target data from the memory;
wherein the data reading request carries a logical block address of the target data and a physical block address of the target data; determining whether the target data is in the memory by using a hash chain table according to the data reading request, including:
calculating a target hash value by using a hash algorithm according to the logical block address;
if the target hash value exists in the hash chain table and the physical block address corresponding to the target hash value in the hash chain table comprises the physical block address of the target data, determining that the target data exists in the memory;
wherein, if the target data is in the memory, the method further comprises:
moving the target hash value and the physical block address of the target data from a least recently used LRU queue to a head of the LRU queue;
the LRU queue stores the hash value of the memory data in the memory and the physical block address of the memory data.
2. The method of claim 1, further comprising:
and if the target data is not in the memory, reading the target data from the storage equipment.
3. The method of claim 2, further comprising:
writing the target data into the memory, storing the physical block address of the target data and the hash value of the target data to the head of the LRU queue, and storing the physical block address of the target data and the hash value of the target data in the hash chain table.
4. The method of claim 3, further comprising:
if the LRU queue is full, deleting the data at the tail of the LRU queue, deleting the data corresponding to the data at the tail of the LRU queue in the hash chain table, and deleting the memory data corresponding to the data at the tail of the LRU queue from the memory.
5. A data reading apparatus, comprising:
an acquisition unit configured to acquire a data read request for requesting target data;
a determining unit, configured to determine whether the target data is in the memory by using a hash chain table according to the data reading request;
a first reading unit, configured to read the target data from the memory if the target data is in the memory;
wherein the data reading request carries a logical block address of the target data and a physical block address of the target data; the determining unit is specifically configured to:
calculating a target hash value by using a hash algorithm according to the logical block address;
if the target hash value exists in the hash chain table and the physical block address corresponding to the target hash value in the hash chain table comprises the physical block address of the target data, determining that the target data exists in the memory;
wherein, if the target data is in the memory, the apparatus further comprises:
a moving unit for moving the target hash value and the physical block address of the target data from a least recently used LRU queue to a head of the LRU queue;
the LRU queue stores the hash value of the memory data in the memory and the physical block address of the memory data.
6. The apparatus of claim 5, further comprising:
and the second reading unit is used for reading the target data from the storage device if the target data is not in the memory.
7. The apparatus of claim 6, further comprising:
and the writing unit is used for writing the target data into the memory, storing the physical block address of the target data and the hash value of the target data to the head of the LRU queue, and storing the physical block address of the target data and the hash value of the target data into the hash chain table.
8. The apparatus of claim 7, further comprising:
and the deleting unit is used for deleting the data at the tail part of the LRU queue if the LRU queue is full, deleting the data corresponding to the data at the tail part of the LRU queue in the hash chain table, and deleting the memory data corresponding to the data at the tail part of the LRU queue from the memory.
CN201810797726.0A 2018-07-19 2018-07-19 Data reading method and device Active CN108984128B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810797726.0A CN108984128B (en) 2018-07-19 2018-07-19 Data reading method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810797726.0A CN108984128B (en) 2018-07-19 2018-07-19 Data reading method and device

Publications (2)

Publication Number Publication Date
CN108984128A CN108984128A (en) 2018-12-11
CN108984128B true CN108984128B (en) 2022-03-08

Family

ID=64550422

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810797726.0A Active CN108984128B (en) 2018-07-19 2018-07-19 Data reading method and device

Country Status (1)

Country Link
CN (1) CN108984128B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102737064A (en) * 2011-04-15 2012-10-17 腾讯科技（深圳）有限公司 File caching method and file caching device
CN103139224A (en) * 2011-11-22 2013-06-05 腾讯科技（深圳）有限公司 Network file system and method for accessing network file system
CN104049918A (en) * 2014-07-03 2014-09-17 浪潮集团有限公司 Cache management method of double-control storage server
CN104156482A (en) * 2014-08-26 2014-11-19 天津市普迅电力信息技术有限公司 Map tile data publishing method
CN104991743A (en) * 2015-07-02 2015-10-21 西安交通大学 Wear-leveling method applied to cache of resistive random access memory of solid-state hard disk
EP3115904A1 (en) * 2015-07-06 2017-01-11 Alcatel Lucent Method for managing a distributed cache

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102737064A (en) * 2011-04-15 2012-10-17 腾讯科技（深圳）有限公司 File caching method and file caching device
CN103139224A (en) * 2011-11-22 2013-06-05 腾讯科技（深圳）有限公司 Network file system and method for accessing network file system
CN104049918A (en) * 2014-07-03 2014-09-17 浪潮集团有限公司 Cache management method of double-control storage server
CN104156482A (en) * 2014-08-26 2014-11-19 天津市普迅电力信息技术有限公司 Map tile data publishing method
CN104991743A (en) * 2015-07-02 2015-10-21 西安交通大学 Wear-leveling method applied to cache of resistive random access memory of solid-state hard disk
EP3115904A1 (en) * 2015-07-06 2017-01-11 Alcatel Lucent Method for managing a distributed cache

Also Published As

Publication number Publication date
CN108984128A (en) 2018-12-11

Similar Documents

Publication Publication Date Title
US9298384B2 (en) Method and device for storing data in a flash memory using address mapping for supporting various block sizes
CN108647151A (en) It is a kind of to dodge system metadata rule method, apparatus, equipment and storage medium entirely
KR101767710B1 (en) Card-based management of discardable files
EP3944556B1 (en) Block data storage method and apparatus, and block data access method and apparatus
WO2017148242A1 (en) Method for accessing shingled magnetic recording (smr) hard disk, and server
US9524238B2 (en) Systems and methods for managing cache of a data storage device
CN107817946B (en) Method and device for reading and writing data of hybrid storage device
CN103049224B (en) By the methods, devices and systems of data importing physical tape
KR20100065786A (en) Cache synchronization method and system for fast power-off
US11269783B2 (en) Operating method for data storage device
CN107239569A (en) A kind of distributed file system subtree storage method and device
CN113568582B (en) Data management method, device and storage equipment
CN109597580B (en) Flash operation method suitable for intelligent electric meter load curve storage
CN108710474A (en) A kind of date storage method, device and computer storage media
KR20170010810A (en) Method, device and user equipment for reading/writing data in nand flash
CN109471843A (en) A kind of metadata cache method, system and relevant apparatus
US20070174550A1 (en) Data area managing method in information recording medium and information processor employing data area managing method
CN111190537B (en) Method and system for managing sequential storage disk in additional writing scene
JP4347707B2 (en) Information recording medium formatting method and information recording medium
CN107506466A (en) A kind of small documents storage method and system
JP4130808B2 (en) Formatting method
CN115952110B (en) Data caching method, device, equipment and computer readable storage medium
CN108984128B (en) Data reading method and device
EP2381354A2 (en) Data recording device
CN108984432B (en) Method and device for processing IO (input/output) request

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