WO2020113941A1

WO2020113941A1 - Data access method, apparatus and system based on mining computer, and readable storage medium

Info

Publication number: WO2020113941A1
Application number: PCT/CN2019/092004
Authority: WO
Inventors: 郭韶呈
Original assignee: 深圳市网心科技有限公司
Priority date: 2018-12-06
Filing date: 2019-06-20
Publication date: 2020-06-11
Also published as: CN109582246A

Abstract

A data access method, apparatus and system based on a mining computer, and a readable storage medium. The method comprises: receiving a data access request sent by a service system; determining whether a solid state drive stores target data corresponding to the data access request, wherein the solid state drive stores data with the number of times of access exceeding a first predetermined threshold value in a hard disk drive; if the solid state drive stores target data corresponding to the data access request, sending the target data stored in the solid state drive to the service system; and if the solid state drive does not store target data corresponding to the data access request, sending the target data stored in the hard disk drive to the service system. Therefore, the solid state drive and the hard disk drive in the present solution are combined to realize a data access mode of the mining computer. The solid state drive with high IO performance is used for storing data with high access frequency, and the hard disk drive with high capacity is used for storing all written data. By combining the advantages of the solid state drive and the hard disk drive, the cache acceleration performance of the mining computer is improved.

Description

Data access method, device, system and readable storage medium based on mining machine

This application requires the priority of the Chinese patent application filed on December 06, 2018 in the Chinese Patent Office with the application number 201811488094.6 and the invention titled "Data Access Method, Device, System and Readable Storage Media Based on Mining Machines". The entire contents are incorporated by reference in this application.

Technical field

The invention relates to the field of cache acceleration, in particular to a data access method, device, system and computer-readable storage medium based on a mining machine.

Background technique

Miners are small computer equipment deployed in the homes of individual users. They are connected to the Internet through a home gateway to provide computing, storage, and bandwidth resources for cloud services. The cache acceleration scheme based on the small mining machine is to use the mechanical disk (HDD) or solid state disk (SSD) mounted on the mining machine as the cache, and download the file to the mining machine's disk for caching in advance. When the user requests resources, according to The user requests to find the data storage directory, reads the file and responds to the user.

The current cache acceleration solution has many problems, such as: high-performance solid-state disks are not fully utilized, resulting in waste of resources; insufficient IO output of mechanical disks, and cannot reach the expected output IO; the situation that mechanical disks are too concentrated in hot spots, There will be IO output bottlenecks, heat generation, and disk service life decline; furthermore, the requested data is in the mechanical disk. Because the mechanical disk IO performance is not high, the user response time increases, which affects the user experience. If all solid-state disks are used, the cost of user expenditure will increase.

Therefore, how to improve the cache acceleration performance of the miner is a problem that those skilled in the art need to solve.

Summary of the invention

The main purpose of the present invention is to provide a data access method, device, system and computer-readable storage medium based on a mining machine, aiming to solve the technical problem of how to improve the cache acceleration performance of the mining machine.

In order to achieve the above object, a data access method based on a mining machine provided by the present invention includes:

Receive data access requests sent by business systems;

Determine whether the target data corresponding to the data access request is stored in the solid state disk; wherein, the solid state disk stores data in the mechanical disk that the number of times of access exceeds the first predetermined threshold;

If yes, the target data stored in the solid state disk is sent to the business system; if not, the target data stored in the mechanical disk is sent to the business system.

Preferably, before receiving the data access request sent by the service system, the method further includes:

Detect whether there is data in the mechanical disk that the number of access times exceeds the first predetermined threshold;

If it exists, copy the data whose access times exceed the first predetermined threshold to the solid state disk, and add the pointer corresponding to the first data to the cache linked list of the solid state disk.

Preferably, before adding the pointer corresponding to the first data to the cache linked list of the solid state disk, the method further includes:

Detecting whether the number of pointers in the cache linked list exceeds a second predetermined threshold;

If not, continue to perform the step of adding the pointer corresponding to the first data to the cache linked list of the solid state disk; if yes, determine whether there are hits in the cache linked list that are less than a third predetermined threshold within a predetermined duration pointer;

If it exists, the pointer whose number of hits within the predetermined time duration is less than the third predetermined threshold is used as the pointer to be moved; if it does not exist, the pointer to be moved is determined from the cache linked list through the LRU strategy;

Move the pointer to be moved to the history cache linked list.

Preferably, before moving the pointer to be moved to the history cache linked list, the method further includes:

Determine whether the number of pointers in the history cache linked list exceeds a fourth predetermined threshold;

If not, continue to perform the step of moving the pointer to be moved to the history cache linked list; if yes, determine the pointer to be deleted from the history cache linked list through the LRU strategy;

Delete the pointer to be deleted and the data corresponding to the pointer to be deleted.

Preferably, the determining whether target data corresponding to the data access request is stored in the solid state disk includes:

Use a cache linked list to determine whether the target data is stored in the solid state disk;

If yes, continue to perform the step of sending the target data stored in the solid state disk to the business system; if not, use a history cache linked list to determine whether the target data is stored in the solid state disk;

If yes, continue to perform the step of sending the target data stored in the solid-state disk to the business system; if not, continue to execute the sending of the target data stored in the mechanical disk to the business system A step of.

Preferably, if the historical cache linked list is used to determine that the solid-state disk stores the target data, the method further includes:

Move the pointer corresponding to the target data in the historical cache linked list to the cache linked list.

To achieve the above object, the present invention further provides a data access device based on a mining machine, the device includes a memory and a processor, and the memory stores a data access program that can run on the processor, the data When the access program is executed by the processor, any data access method described above is implemented.

Preferably, the device is a node constituting a CDN network or a blockchain network.

To achieve the above object, the present invention further provides a data access system based on a mining machine, the system includes:

The request receiving unit is used to receive the data access request sent by the business system;

The judging unit is used to judge whether the target data corresponding to the data access request is stored in the solid-state disk; the solid-state disk stores the data of the number of times the access in the mechanical disk exceeds the first predetermined threshold;

A first data sending unit, configured to send the target data stored in the solid state disk to the business system when the target data corresponding to the data access request is stored in the solid state disk;

The second data sending unit is configured to send the target data stored in the mechanical disk to the business system when the target data corresponding to the data access request is not stored in the solid state disk.

In order to achieve the above object, the present invention further provides a computer-readable storage medium having a data access program stored on the computer-readable storage medium, which can be executed by one or more processors to implement any of the above Data access method.

It can be known from the above solution that a data access method based on a mining machine provided by an embodiment of the present invention includes: receiving a data access request sent by a business system; and determining whether a solid state disk corresponding to the data access request is stored Target data; wherein, the solid-state disk stores data that the number of accesses in the mechanical disk exceeds a first predetermined threshold; if so, the target data stored in the solid-state disk is sent to the business system; if not, then Sending target data stored in the mechanical disk to the business system;

It can be seen that in this solution, since the solid-state disk has high IO performance, it only stores data with high access frequency, so that when receiving the data access request sent by the business system, the target data is preferentially obtained from the solid-state disk. If the target data does not exist in the solid state disk, it is obtained from the mechanical disk. That is to say, this scheme combines the solid state disk and the mechanical disk to realize the data access method of the miner, uses the solid state disk with high IO performance to store data with high access frequency, and stores the mechanical disk with large capacity to store all The written data improves the cache acceleration performance of the miner through the combination of the two advantages.

The invention also discloses a data access device, system and computer readable storage medium based on the mining machine, which can also achieve the above technical effects.

BRIEF DESCRIPTION

FIG. 1 is a schematic flowchart of an embodiment of the present invention;

2 is a logic flow chart of an overall solution according to an embodiment of the invention;

3 is a schematic flowchart of another embodiment of the present invention;

4 is a schematic flowchart of a method for managing a cache linked list disclosed in an embodiment of the present invention;

5 is a schematic schematic diagram of updating an LRU linked list disclosed in an embodiment of the present invention;

6 is a schematic structural diagram of a data access system based on a mining machine disclosed in an embodiment of the present invention;

7 is a schematic structural diagram of a data access device based on a mining machine disclosed in an embodiment of the present invention.

detailed description

In order to make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention. Based on the embodiments of the present invention, all other embodiments obtained by a person of ordinary skill in the art without making creative efforts fall within the protection scope of the present invention.

The terms "first", "second", "third", "fourth", etc. (if any) in the description and claims of this application and the above drawings are used to distinguish similar objects without using To describe a specific order or sequence. It should be understood that the data used in this way can be interchanged under appropriate circumstances so that the embodiments described herein can be implemented in an order other than what is illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, processes, methods, systems, products or devices that contain a series of steps or units need not be limited to those clearly listed Those steps or units, but may include other steps or units not explicitly listed or inherent to these processes, methods, products, or equipment.

It should be noted that the descriptions related to "first", "second", etc. in the present invention are for descriptive purposes only, and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of technical features indicated . Thus, the features defined with "first" and "second" may include at least one of the features either explicitly or implicitly. In addition, the technical solutions between the various embodiments can be combined with each other, but they must be based on the ability of those skilled in the art to realize. When the combination of technical solutions contradicts or cannot be realized, it should be considered that the combination of such technical solutions does not exist , Nor within the protection scope claimed by the present invention.

The embodiment of the invention discloses a data access method based on a mining machine.

Referring to FIG. 1, FIG. 1 is a schematic flowchart of an embodiment of the present invention. In this embodiment, the method includes:

S101. Receive a data access request sent by a business system;

Specifically, the miner applying the data access method described in this embodiment must have at least one mechanical disk (HDD) and one solid state disk (SSD). The mechanical disk serves as a storage layer to store all written data. The solid state disk As a cache layer to provide high-performance IO output medium. Therefore, in terms of overall logic, the data method is mainly divided into a business layer, a cache layer, and a storage layer. Referring to FIG. 2, it is a logic flow chart of the overall solution of an embodiment of the present invention. As can be seen from FIG. 2, the business layer Provided to users with different needs, each user has their own different business needs, that is to say, users realize the storage and reading of data through different business systems; the cache layer is mainly responsible for reading data in the business layer according to Information such as the frequency of user data reads maintains the data in the solid-state disk to provide high-performance cache functions; when the business layer writes data to the storage layer, the storage layer is responsible for writing the data safely and accurately to the mechanical disk Medium storage, to complete the data storage function, the mechanical disk has a larger capacity than the solid state disk, the solid state disk capacity is relatively small.

It should be noted that the data access method provided in this embodiment is described based on the perspective of the cache layer. The data access request in this embodiment can be specifically understood as a data acquisition request. If the request sent by the user through the business system is a data write request, the request is directly sent to the storage layer, and the data is directly stored to the mechanical disk through the storage layer. The mechanical disk realizes the storage of data.

S102: Determine whether the target data corresponding to the data access request is stored in the solid state disk; wherein, the solid state disk stores data in the mechanical disk that the number of times of access exceeds the first predetermined threshold; if yes, perform S103; if not , Execute S104;

S103: Send the target data stored in the solid state disk to the business system;

S104. Send the target data stored in the mechanical disk to the business system.

All data in this solution is written to the mechanical disk, but the IO performance of the mechanical disk is not high, and there may be a problem of large user response time. Therefore, in this solution, the data in the mechanical disk that is accessed more than the first predetermined threshold At the same time, it is stored in the solid state disk, that is to say, the data with higher access frequency is not only stored in the mechanical disk, but also stored in the solid state disk, so that when users access the data, they can first search from the solid state disk, if found, then The data in the solid state disk is directly returned. If it cannot be found, it is searched from the mechanical disk and the search result is returned. If the data is not found in the solid state disk and the mechanical disk, the prompt message that the search fails is returned.

It should be noted that, in order to find data from the solid state disk, cache index information is stored in the solid state disk, and data is retrieved from the solid state disk through the cache index information. In the initial situation, there is no cache information in the solid state disk. The cache information includes cache index information and corresponding data; therefore, the cache information will be gradually established according to the user's request during the cold start of the program. In order to ensure the cache information For security, the cache information can be periodically flushed to the mechanical disk for persistent operation when necessary. The cache information is reloaded when the program starts. The index information structure is defined as follows:

It should be noted that, because the data stored in the solid-state disk is the data in the mechanical disk that the number of accesses exceeds the first predetermined threshold, in the initial process, the solid-state disk is in a state where there is no cache data or there is less cache data If you still get the data from the solid state drive first, it will cause a problem that the access hit rate of the solid state drive is low. In order to avoid the above problem, before performing S102, first determine whether the data in the solid state drive exceeds a predetermined threshold. If it is, The data is first read from the solid state disk, otherwise, the data is directly read from the mechanical disk until the data cached in the solid state disk exceeds a predetermined threshold, and the data is preferentially obtained from the solid state disk.

In summary, when the mining machine in this embodiment accelerates the cache, the mechanical disk and the solid state disk are mixed. The mechanical disk has a large capacity and is responsible for storing data. The solid state disk has high IO performance and is responsible for data caching, thereby improving the mining performance. The overall IO performance of the computer; in actual use, the hotspot data is about 20%, so that the solid state disk can completely cover the storage of hotspot data; and for the business layer, the business layer does not perceive whether the data comes from the storage layer or the cache In this way, the high IO performance of the solid state disk is maximized, which can solve the difficult problems of mechanical disk heating in high hot spots, shortened disk life, and low IO output. It can also provide users with better Playing and downloading experience.

Further, the embodiment of the present invention discloses another data access method based on a mining machine.

Referring to FIG. 3, FIG. 3 is a schematic flowchart of another embodiment of the present invention. In this embodiment, the method includes:

S201. Receive a data access request sent by a business system;

S202: Determine whether the target data is stored in the solid-state disk by using a cache linked list; wherein, the solid-state disk stores data that the number of accesses in the mechanical disk exceeds the first predetermined threshold; if yes, execute S204; if no, then Perform S203;

S203. Determine whether the target data is stored in the solid state disk by using a history cache linked list;

If yes, execute S204; if no, execute S205;

S204: Send the target data stored in the solid state disk to the business system;

S205. Send the target data stored in the mechanical disk to the business system.

Specifically, in this embodiment, the cache index information may include cache linked list cacheing and historical cache linked list cache_history, and each linked list includes a pointer key corresponding to the data, and the pointer is used to point to the data stored in the solid state disk. Under normal circumstances, the data in the mechanical disk that has been accessed more than the first predetermined threshold will be added to the cache list first. If the number of pointers in the cache list reaches the upper limit, you need to match the cache list according to the predetermined list movement rule. The pointer of is moved to the history cache linked list. If the number of pointers in the history cache linked list also reaches the upper limit, the corresponding pointer and corresponding data need to be deleted from the history cache list according to the predetermined list deletion rule.

Therefore, in this solution, after receiving the data access request sent by the business system, you first need to find from the cache linked list whether the target data corresponding to the request is stored in the solid state disk; if it is stored in the solid state disk, the target in the solid state disk The data is sent to the business system; if the target data is not found in the cache linked list, continue to search for the target data from the historical cache linked list, if found, the target data in the solid state disk is sent to the business system; if not found, then The target data can only be searched from the mechanical disk. If the target data is not found in the mechanical disk, it means that the data is not stored in the mining machine, and then a prompt message that the search fails is fed back to the business system.

It can be seen from the above that in this solution, through the cache linked list and the historical cache linked list, the corresponding target data can be quickly found according to the pointers in the linked list, and the pointers eliminated in the cache linked list are not directly deleted, but instead The pointer is added to the historical cache linked list, so that when searching for the target data, if the data is not found from the cache linked list with a high hit rate, it will continue to find from the historical cache linked list, thereby improving the data hit rate and realizing the mining machine's hit rate. Cache acceleration performance.

Further, based on any of the above method embodiments, this embodiment discloses a method for managing a cache linked list.

It should be noted that the cache linked list management method described in this embodiment may not limit the execution order between the steps of the data access method described in any of the above embodiments, but in order to improve the data access hit rate, this implementation In the example, it may be set to be executed before the step of receiving the data access request sent by the service system. For the detailed process of the data access method, reference may be made to any of the above embodiments, which is not specifically described in this embodiment.

Referring to FIG. 4, FIG. 4 is a schematic flowchart of a method for managing a cache linked list disclosed in an embodiment of the present invention. In this embodiment, the method includes:

S301. Detect whether there is data in the mechanical disk that the number of access times exceeds the first predetermined threshold;

If yes, execute S302; if no, continue to execute S301;

S302: Detect whether the number of pointers in the cache linked list exceeds a second predetermined threshold;

If not, execute S309; if yes, execute S303;

S303. Determine whether there is a pointer in the cache linked list that has a hit count less than a third predetermined threshold within a predetermined duration; if yes, execute S304; if not, execute S305;

S304. Use a pointer whose number of hits within a predetermined duration is less than a third predetermined threshold as a pointer to be moved, and execute S306;

S305. Determine the pointer to be moved from the cache linked list through the LRU (recently used recently) strategy, and execute S306;

S306. Determine whether the number of pointers in the history cache linked list exceeds a fourth predetermined threshold;

If yes, execute S307; if no, execute S308;

S307: Determine the pointer to be deleted from the history cache linked list through the LRU strategy, and delete the pointer to be deleted and the data corresponding to the pointer to be deleted;

S308. Move the pointer to be moved to the history cache linked list, and execute S309;

S309. Copy the data whose access times exceed the first predetermined threshold to the solid state disk, and add the pointer corresponding to the first data to the cache linked list of the solid state disk.

Specifically, when the program starts, the two linked list chains, the cache list cacheing and the history cache list cache_history, are both empty. When the user's request comes, if the data can be read from the mechanical disk of the storage layer, and the number of hits exceeds At the first predetermined threshold, the data is copied to the solid state disk, and the pointer corresponding to the data is added to the cache linked list cacheing.

It should be noted that the cache linked list has an upper limit of the number of pointers, and the upper limit is the second predetermined threshold. If a new pointer is added to the cache linked list, it is detected that the number of pointers in the cache linked list reaches the second predetermined threshold, At this time, a part of the linked list needs to be moved from the cache linked list according to the linked list moving rule. The linked list moving rule may include the following two types: a pointer to be hit less than a third predetermined threshold within a predetermined duration is used as a pointer to be moved, and moved to the historical cache linked list; if The number of pointer hits in the linked list is not less than the third predetermined threshold, at this time, the pointer to be moved can be determined from the cache linked list through the LRU strategy. As the number of requests continues to increase, the number of pointers in the history cache linked list will also reach the upper limit. When new pointer data is added at this time, the corresponding pointers need to be deleted according to the linked list deletion rule, which is an LRU strategy That is to say, the pointer to be deleted is determined from the history cache linked list according to the LRU strategy, and the pointer to be deleted and the data corresponding to the pointer to be deleted are both deleted.

Referring to FIG. 5, it is a schematic schematic diagram of the LRU linked list update disclosed by an embodiment of the present invention. As can be seen from the figure, the new pointer data needs to be inserted into the head position of the linked list. When the pointer key hits, the pointer data is moved to The head position of the linked list; if the entire chain reaches the upper limit of data and new pointer data is added, the data at the tail of the linked list needs to be eliminated directly; for the cached linked list, the eliminated pointer data is moved to the historical cache linked list, for the historical cache linked list , The deleted pointer data will be deleted directly.

Wherein, if the historical cache linked list is used to determine that the solid-state disk stores the target data, the method further includes: moving a pointer corresponding to the target data in the historical cache linked list to the cache linked list .

That is to say, because the history cache linked list cache_history stores data that has been hit or eliminated, but if the data located in the historical cache linked list happens to be hit in a certain request, then the hit pointer key needs to be re-added to the cache linked list In the cacheing chain, similarly, the cache linked list cacheing needs to eliminate a key to the historical cache linked list cache_history according to the above linked list movement rules.

To sum up, it can be seen that this solution uses the above-mentioned cache linked list management method to keep the cache linked list cacheing chain and historical cache linked list cache_history in a balanced state of writing and elimination, while keeping the hot data of the mechanical disk gradually copied to the solid state disk for Cache acceleration will also delete the data eliminated by cache_history from the cache of the solid state disk. In this way, the probability of the business system hitting the data in the solid state disk can be increased, and the cache acceleration performance of the miner can be improved.

Further, this embodiment also discloses a data access system based on a mining machine.

Referring to FIG. 6, it is a schematic structural diagram of a data access system based on a mining machine disclosed in an embodiment of the present invention. The system includes:

The request receiving unit 100 is used to receive the data access request sent by the business system;

The judging unit 200 is used to judge whether the target data corresponding to the data access request is stored in the solid state disk; the solid state disk stores the data that the number of times of access in the mechanical disk exceeds the first predetermined threshold;

The first data sending unit 300 is configured to send the target data stored in the solid state disk to the service system when the target data corresponding to the data access request is stored in the solid state disk;

The second data sending unit 400 is configured to send the target data stored in the mechanical disk to the business system when the target data corresponding to the data access request is not stored in the solid state disk.

Among them, this plan also includes:

A first detection unit, configured to detect whether there is data in the mechanical disk that the number of times of access exceeds a first predetermined threshold;

A data copying unit, used to copy the data whose access times exceed the first predetermined threshold to the solid state disk when there is data in the mechanical disk whose access times exceed the first predetermined threshold;

The pointer adding unit is used to add the pointer corresponding to the first data to the cache linked list of the solid state disk.

Among them, this plan also includes:

A second detection unit, configured to detect whether the number of pointers in the cache linked list exceeds the second predetermined threshold; if not, trigger the pointer addition unit; if yes, trigger the hit count determination unit;

The hit count judging unit is used to judge whether there is a pointer in the cache linked list that has a hit count less than a third predetermined threshold within a predetermined duration; if it exists, it triggers the first pointer-to-be-moved determination unit; if it does not exist, it triggers the second wait Move the pointer to determine the unit;

A first pointer-to-be-moved determination unit, configured to use a pointer whose number of hits within a predetermined time period is less than a third predetermined threshold as a pointer to be moved;

A second pointer-to-be-moved determination unit, configured to determine a pointer to be moved from the cache linked list through an LRU strategy;

The first pointer moving unit is used to move the pointer to be moved to the history cache linked list.

Among them, this plan also includes:

A pointer number judging unit, used to judge whether the number of pointers in the history cache linked list exceeds the fourth predetermined threshold; if not, trigger the pointer moving unit; if yes, trigger the pointer determination unit to be deleted;

A pointer-to-be-deleted determination unit, configured to determine a pointer to be deleted from the historical cache linked list through an LRU strategy;

The pointer deleting unit is used to delete the pointer to be deleted and the data corresponding to the pointer to be deleted.

Among them, the judgment unit includes:

The first judgment subunit is used to judge whether the target data is stored in the solid state disk by using a cache linked list; if it is, trigger the first data sending unit; if not, trigger the second judgment subunit;

The second judgment subunit is used to judge whether the target data is stored in the solid state disk by using a history cache linked list; if it is, the first data sending unit is triggered; if not, the second data sending unit is triggered.

Among them, this plan also includes:

A second pointer moving unit, configured to move a pointer corresponding to the target data in the historical cache linked list to the cache linked list when using the historical cache linked list to determine that the solid-state disk stores the target data .

Further, an embodiment of the present invention further provides a computer-readable storage medium, and a data access program is stored on the computer-readable storage medium, and the data access program may be executed by one or more processors to implement any of the above The data access method described in the method embodiment.

Further, this embodiment also discloses a data access device 1 based on a mining machine.

7 is a schematic structural diagram of a data access device based on a mining machine disclosed in an embodiment of the present invention. The device includes a memory 11 and a processor 12, and the memory 11 stores data access that can run on the processor. Program 01. When the data access program 01 is executed by the processor, the data access method implemented by any of the foregoing method embodiments is implemented.

In this embodiment, the data access device 1 may be a PC (Personal Computer) or a smart phone, tablet computer, palmtop computer, portable computer, smart router, mining machine, and network storage device terminal device.

The device 1 may be a node constituting a CDN network or a blockchain network.

The data access device 1 may include a memory 11, a processor 12, and a bus 13.

Wherein, the memory 11 includes at least one type of readable storage medium, and the readable storage medium includes flash memory, hard disk, multimedia card, card-type memory (for example, SD or DX memory, etc.), magnetic memory, magnetic disk, optical disk, and the like. The memory 11 may be an internal storage unit of the data access device 1 in some embodiments, such as a hard disk of the data access device 1. In other embodiments, the memory 11 may also be an external storage device of the data access device 1, such as a plug-in hard disk equipped on the data access device 1, a smart memory card (Smart Media, Card, SMC), and a secure digital (Secure Digital, SD) card, flash card (Flash Card), etc. Further, the memory 11 may also include both the internal storage unit of the data access device 1 and the external storage device. The memory 11 can be used not only to store application software and various types of data installed in the data access device 1, such as codes of the data access program 01, but also to temporarily store data that has been or will be output.

In some embodiments, the processor 12 may be a central processing unit (CPU), controller, microcontroller, microprocessor, or other data processing chip for running the program code or processing stored in the memory 11 Data, for example, data access program 01 is executed.

The bus 13 may be a peripheral component interconnection (peripheral component interconnection, PCI for short) bus or an extended industry standard architecture (extended industry standard architecture, EISA) bus, or the like. The bus can be divided into address bus, data bus, control bus and so on. For ease of representation, only a thick line is used in FIG. 7, but it does not mean that there is only one bus or one type of bus.

Further, the data access device may further include a network interface 14, and the network interface 14 may optionally include a wired interface and/or a wireless interface (such as a WI-FI interface, a Bluetooth interface, etc.), which is generally used in the device 1 to communicate with other electronic devices. Establish a communication connection between devices.

Optionally, the device 1 may further include a user interface. The user interface may include a display and an input unit such as a keyboard. The optional user interface may also include a standard wired interface and a wireless interface. Optionally, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode, organic light emitting diode) touch device, or the like. Among them, the display may also be appropriately referred to as a display screen or a display unit, for displaying information processed in the data access device 1 and for displaying a visual user interface.

7 only shows the data access device 1 having the components 11-14 and the data access program 01. Those skilled in the art can understand that the structure shown in FIG. 7 does not constitute a limitation on the data access device 1, and may include There are fewer or more components than shown, or some components are combined, or different components are arranged.

Further, an embodiment of the present invention further provides a computer program product, including computer instructions, which, when run on a computer, enable the computer to execute the data access method described in any of the above method embodiments.

In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product.

The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on the computer, all or part of the processes or functions according to the embodiments of the present invention are generated. The computer may be a general-purpose computer, a dedicated computer, a computer network, or other programmable devices. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be from a website site, computer, server or data center Transmission to another website, computer, server or data center via wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.). The computer-readable storage medium may be any available medium that can be stored by a computer or a data storage device such as a server, a data center, or the like that includes one or more available medium integrations. The available media may be magnetic media (eg, floppy disk, hard disk, magnetic tape), optical media (eg, DVD), or semiconductor media (eg, Solid State Disk (SSD)), etc.

Those skilled in the art can clearly understand that for the convenience and conciseness of the description, the specific working process of the system, device and unit described above can refer to the corresponding process in the foregoing method embodiments, which will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed system, device, and method may be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a division of logical functions. In actual implementation, there may be other divisions, for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented. In addition, the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit. The above integrated unit may be implemented in the form of hardware or software functional unit.

If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application essentially or part of the contribution to the existing technology or all or part of the technical solution can be embodied in the form of a software product, the computer software product is stored in a storage medium , Including several instructions to enable a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program code .

It should be noted that the sequence numbers of the above embodiments of the present invention are only for description, and do not represent the advantages and disadvantages of the embodiments. And the terms "include", "include", or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, device, article, or method that includes a series of elements includes not only those elements, but also unclear The other elements listed may also include elements inherent to this process, device, article, or method. Without more restrictions, the element defined by the sentence "include one..." does not exclude that there are other identical elements in the process, device, article or method that includes the element.

The above are only preferred embodiments of the present invention and do not limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made by the description and drawings of the present invention, or directly or indirectly used in other related technical fields The same reason is included in the patent protection scope of the present invention.

Claims

A data access method based on a mining machine, characterized in that the method includes:

Receive data access requests sent by business systems;

Determine whether the target data corresponding to the data access request is stored in the solid state disk; wherein, the solid state disk stores data in the mechanical disk that the number of times of access exceeds the first predetermined threshold;

If yes, the target data stored in the solid state disk is sent to the business system; if not, the target data stored in the mechanical disk is sent to the business system.
The data access method according to claim 1, wherein before receiving the data access request sent by the service system, the method further comprises:

Detect whether there is data in the mechanical disk that the number of access times exceeds the first predetermined threshold;

If it exists, copy the data whose access times exceed the first predetermined threshold to the solid state disk, and add the pointer corresponding to the first data to the cache linked list of the solid state disk.
The data access method according to claim 2, wherein before adding the pointer corresponding to the first data to the cache linked list of the solid state disk, further comprising:

Detecting whether the number of pointers in the cache linked list exceeds a second predetermined threshold;

If not, continue to perform the step of adding the pointer corresponding to the first data to the cache linked list of the solid state disk; if yes, determine whether there are hits in the cache linked list that are less than a third predetermined threshold within a predetermined duration pointer;

If it exists, the pointer whose number of hits within the predetermined time duration is less than the third predetermined threshold is used as the pointer to be moved; if it does not exist, the pointer to be moved is determined from the cache linked list through the LRU strategy;

Move the pointer to be moved to the history cache linked list.
The data access method according to claim 3, wherein before moving the pointer to be moved to the history cache linked list, the method further comprises:

Determine whether the number of pointers in the history cache linked list exceeds a fourth predetermined threshold;

If not, continue to perform the step of moving the pointer to be moved to the history cache linked list; if yes, determine the pointer to be deleted from the history cache linked list through the LRU strategy;

Delete the pointer to be deleted and the data corresponding to the pointer to be deleted.
The data access method according to any one of claims 1 to 4, wherein the determining whether target data corresponding to the data access request is stored in the solid state disk includes:

Use a cache linked list to determine whether the target data is stored in the solid state disk;

If yes, continue to perform the step of sending the target data stored in the solid state disk to the business system; if not, use a history cache linked list to determine whether the target data is stored in the solid state disk;

If yes, continue to perform the step of sending the target data stored in the solid-state disk to the business system; if not, continue to execute the sending of the target data stored in the mechanical disk to the business system A step of.
The data access method according to claim 5, wherein if the history cache linked list is used to determine that the solid-state disk stores the target data, the method further comprises:

Move the pointer corresponding to the target data in the historical cache linked list to the cache linked list.
A data access device based on a mining machine, characterized in that the device includes a memory and a processor, and the memory stores a data access program that can run on the processor,

When the data access program is executed by the processor, the method according to any one of claims 1-6 is implemented.
The device according to claim 7, wherein the device is a node constituting a CDN network or a blockchain network.
A data access system based on a mining machine, characterized in that the system includes:

The request receiving unit is used to receive the data access request sent by the business system;

The judging unit is used to judge whether the target data corresponding to the data access request is stored in the solid-state disk; the solid-state disk stores the data of the number of times the access in the mechanical disk exceeds the first predetermined threshold;

A first data sending unit, configured to send the target data stored in the solid state disk to the business system when the target data corresponding to the data access request is stored in the solid state disk;

The second data sending unit is configured to send the target data stored in the mechanical disk to the business system when the target data corresponding to the data access request is not stored in the solid state disk.
A computer-readable storage medium, characterized in that a data access program is stored on the computer-readable storage medium, and the data access program can be executed by one or more processors to implement claims 1 to 6 The data access method as described in any one.