CN114327295A - Distributed data access method and system - Google Patents
Distributed data access method and system Download PDFInfo
- Publication number
- CN114327295A CN114327295A CN202111670839.2A CN202111670839A CN114327295A CN 114327295 A CN114327295 A CN 114327295A CN 202111670839 A CN202111670839 A CN 202111670839A CN 114327295 A CN114327295 A CN 114327295A
- Authority
- CN
- China
- Prior art keywords
- service node
- target
- data
- target data
- identification information
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 58
- 238000013507 mapping Methods 0.000 claims abstract description 17
- 230000015654 memory Effects 0.000 claims description 20
- 238000013500 data storage Methods 0.000 claims description 13
- 230000005540 biological transmission Effects 0.000 claims description 8
- 238000007726 management method Methods 0.000 claims description 6
- 238000012423 maintenance Methods 0.000 abstract description 7
- 230000008569 process Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 238000013528 artificial neural network Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013135 deep learning Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Images
Landscapes
- Information Transfer Between Computers (AREA)
Abstract
The invention provides a data access method and a system based on distribution, wherein the method comprises the following steps: when a data request command for target data is received, detecting whether a unique identifier of the target data exists in a record database; if the unique identifier exists, determining a first target service node storing target data based on the mapping relation between the unique identifier stored in the record database and the identifier information of the service node, and feeding back the identifier information of the first target service node to the current service node; and after receiving the identification information of the first target service node, the current service node sends a data request command to the first target service node to request target data. The scheme effectively reduces resource framework and saves resources. The operation and maintenance cost is reduced, and the distributed data access efficiency is improved.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a data access method and a data access system based on distribution.
Background
Distributed storage is a data storage technology, which uses disk space on each machine in an enterprise through a network and forms a virtual storage device with these distributed storage resources, and data is distributed and stored in each corner of the enterprise.
The inventor finds that, when the distributed file storage system in the prior art, such as GlusterFS, HDFS, Ceph, etc., or stores data by using an object storage mode, the following problems exist:
for some projects with small storage resources, the system architecture is huge, resource waste is easily caused, and large resources are consumed during operation and maintenance;
in the distributed access scheme in the prior art, a request is generally forwarded to the same node through a hash algorithm, and if the node needs to stretch and shrink empty, hash configuration needs to be performed again, so that operation and maintenance cost is increased, and efficiency of distributed data access is reduced.
The high-availability cluster uses a main/standby storage mode, so that the nodes are not fully utilized.
Disclosure of Invention
In view of the above, the present invention provides a distributed data access method and system.
In a first aspect, an embodiment of the present invention provides a data access method based on a distributed type, which is applied to a distributed service node, where the method includes the following steps:
when a data request command for target data is received, detecting whether a unique identifier of the target data exists in a record database;
if the unique identifier exists, determining a first target service node storing target data based on the mapping relation between the unique identifier stored in the record database and the identifier information of the service node, and feeding back the identifier information of the first target service node to the current service node;
and after receiving the identification information of the first target service node, the current service node sends a data request command to the first target service node to request target data.
In one embodiment, after receiving the identification information of the first target service node, the current service node sends a data request command to the first target service node to request target data, including:
if the identification information of the first target service node is the same as that of the current service node, reading the target data from the local storage of the current service node;
and if the identification information of the first target service node is different from the identification information of the current service node, starting a data acquisition thread, communicating with the first target service node, and generating a data transmission channel after receiving a feedback command of the first target server node so as to acquire the target data.
In one embodiment, if the identification information of the first target service node is different from the identification information of the current service node, but the target data cannot be obtained from the first target service node, the method further includes:
sending a target data request command to a corresponding resource source station;
after target data fed back by the resource source station reaches the equalizer, the equalizer determines a second target service node corresponding to the stored target data based on the data storage condition of each service node;
if the equalizer judges that the second target service node is the current service node, target data are sent to the current service node;
if the equalizer judges that the second target service node is not the current service node, the target data is sent to the second target service node, and the identification information of the second target service node is sent to the current service node;
and after receiving the target data, the second target node stores the mapping relation between the unique identifier corresponding to the target data and the identifier information of the second target node into the record database.
In one embodiment, the method further comprises:
if the target data does not exist, the current service node sends a target data request command to the corresponding resource source station after receiving feedback information of 'target data does not exist' fed back by the record database;
after target data fed back by the resource source station reaches the equalizer, the equalizer determines a third target service node corresponding to the stored target data based on the data storage condition of each service node;
if the third target service node is the current service node, the equalizer sends target data to the current service node;
and if the third target service node is not the current service node, sending the target data to the third target service node, and sending the identification information of the third target service node to the current service node.
In one embodiment, the method further comprises:
and after receiving the identification information of the third target service node, the current service node starts a data acquisition thread and communicates with the third target service node, and after receiving a feedback command of the third target service node, a data transmission channel is generated to acquire the target data.
In one embodiment, the method further comprises:
and after the third target service node receives the target data, updating the mapping relation between the identification information of the third target service node and the unique identification of the target data to a record database.
In a second aspect, an embodiment of the present invention further provides a distributed data access system, including:
the current service node receives a data request command aiming at target data and sends the target data request command to a record database;
the system comprises a record database, a database management module and a database management module, wherein the record database is used for detecting whether a unique identifier of target data exists in the record database when a data request command aiming at the target data is received; and
if the unique identifier of the target data exists, determining a first target service node for storing the target data based on the mapping relation between the unique identifier stored in the record database and the identification information of the service node, and feeding back the identification information of the first target service node to the current service node;
the current service node is also used for sending a data request command to the first target service node after receiving the identification information of the first target service node so as to request target data;
the first target service node stores target data.
In one embodiment, the distributed based data access system further comprises:
the resource source station is used for receiving a target data request command sent by the current service node after receiving feedback information of 'target data does not exist' fed back by the record database, and transmitting target data corresponding to the target data request command to the equalizer;
the equalizer is used for receiving target data sent by the resource source station and determining a third target service node corresponding to the stored target data based on the data storage condition of each service node; a
The equalizer is further configured to:
if the third target service node is the current service node, sending target data to the current service node;
and if the third target service node is not the current service node, sending the target data to the third target service node, and sending the identification information of the third target service node to the current service node.
In a third aspect, a distributed data access apparatus according to an embodiment of the present invention includes: a memory and a processor, the memory and the processor being communicatively connected to each other, the memory having stored therein computer instructions, and the processor implementing the distributed data access method according to any one of the first aspect by executing the computer instructions.
In a fourth aspect, a non-transitory computer-readable storage medium is provided according to an embodiment of the present invention, the non-transitory computer-readable storage medium storing computer instructions that, when executed by a processor, implement the distributed data access method according to any one of the first aspect.
The distributed data access method and system provided by the embodiment of the invention at least have the following beneficial effects:
according to the distributed data access method and system provided by the embodiment of the invention, the node where the corresponding target data is located is determined by inquiring the data storage record, and data access is carried out. Distributed data access can be performed without using a third-party management system, so that resource architecture is reduced, and resources are saved. The method is suitable for the distributed storage system with smaller project requirements. Each service node can request to access data, and the data access request does not need to be verified and forwarded through a unique node, so that the architecture of the distributed storage system is simplified, the data access process is simplified, and the data access efficiency is improved. The utilization rate of each service node is improved. When the node needs the scalable capacity, the hash configuration is not needed. The operation and maintenance cost is reduced, and the efficiency of distributed data access is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a flowchart of a distributed data access method according to an embodiment of the present invention;
FIG. 2 is a flow chart of another distributed-based data access method according to an embodiment of the present invention;
FIG. 3 is a flow chart of another distributed-based data access method according to an embodiment of the present invention;
FIG. 4 is a flowchart of another distributed-based data access method according to an embodiment of the present invention;
FIG. 5 is a block diagram of a distributed data access device according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a distributed data access apparatus according to an embodiment of the present invention.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to the accompanying drawings, and it should be understood that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In addition, the technical features involved in the different embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
Although the processes described below include multiple operations that occur in a particular order, it should be clearly understood that the processes may include more or fewer operations that are performed sequentially or in parallel.
Example 1
Fig. 1 is a flowchart of a distributed data access method according to an embodiment of the present invention, and referring to fig. 1, the embodiment of the present invention provides a distributed data access method, which is applied to a distributed service node, where the method includes the following steps:
step S101, when a data request command for target data is received, detecting whether a unique identifier of the target data exists in a record database;
step S102, if the mapping relation exists, determining a first target service node storing target data based on the mapping relation between the unique identifier stored in the record database and the identification information of the service node, and feeding back the identification information of the first target service node to the current service node;
step S103, after receiving the identification information of the first target service node, the current service node sends a data request command to the first target service node to request target data.
In the above embodiment, specifically, there may be some business scenarios of file storage and file reading in the web application or software, and if it is a single service node, the service node may directly read the file stored locally. However, in a scenario of multiple service nodes, when a current service node receives a data request command for target data, it is detected whether a unique identifier of the target data exists in the record database, that is, whether the target data exists in the distributed storage pool is determined, and if the unique identifier does not exist in the distributed storage pool, data should be acquired from a corresponding resource source station. If so, the corresponding target data may be retrieved from the corresponding node in the distributed storage pool. Specifically, whether the unique identifier of the target data exists in the record database is detected, and if the unique identifier of the target data exists in the record database, it indicates that the data exists in the distributed storage pool. And determining a first target service node for storing target data based on the mapping relation between the unique identifier stored in the record database and the identifier information of the service node. And after determining the corresponding first target service node, sending a data request command to the first target service node to request target data. When the distributed storage system deploys the corresponding service nodes, the ip information of all the service nodes is stored in a configuration file, and when the current service node is started, the configuration file is read so that the current service node and the corresponding first target node can establish connection. When each node receives data to be stored, the received data is stored locally, and after the data is stored, the mapping relation between the unique identifier of the stored data and the identifier of the corresponding node is stored in the record data book. In other words, each node stores the unique identifier of the stored data in the record data record in cooperation with the identifier information of the node, so as to query the unique identifier of the stored data and obtain the ip of the corresponding stored node. And then corresponding data is obtained according to the corresponding ip. In the above embodiment, the node where the corresponding target data is located is determined by querying the data storage record, and the data is accessed. Distributed data access can be performed without using a third-party management system, so that resource architecture is reduced, and resources are saved. Each service node can request to access data, and the data access request does not need to be verified and forwarded through a unique node, so that the architecture of the distributed storage system is simplified, the data access process is simplified, and the data access efficiency is improved. The utilization rate of each service node is improved. When the node needs the scalable capacity, the hash configuration is not needed. The operation and maintenance cost is reduced, and the efficiency of distributed data access is improved.
Referring to fig. 2, in an embodiment, after receiving the identification information of the first target service node, the current service node sends a data request command to the first target service node to request target data, including:
step S1031, if the identification information of the first target service node is the same as the identification information of the current service node, reading the target data from the local storage of the current service node;
step S1032, if the identification information of the first target service node is different from the identification information of the current service node, starting a data acquisition thread, communicating with the first target service node, and generating a data transmission channel after receiving a feedback command of the first target server node to acquire the target data.
In the foregoing embodiment, if the identification information of the first target service node is different from the identification information of the current service node, the data acquisition thread is started, the data acquisition thread communicates with the first target service node, and after receiving the feedback command of the first target server node, a data transmission channel is generated to acquire the target data. And improving the data interaction of another thread, and receiving data in a generated data transmission channel after receiving the feedback command of the first target server node. The data is read by another thread and another channel, the data is not interfered with other threads of the current service node, and the data is acquired by generating a professional channel after the feedback information is obtained, so that the data access efficiency is improved, and the efficiency of distributed data access is further improved. The performance of the distributed data storage access system is improved.
Referring to fig. 3, in an embodiment, if the identification information of the first target serving node is different from the identification information of the current serving node, but the target data cannot be obtained from the first target serving node, the method further includes:
step S104, sending a target data request command to a corresponding resource source station;
step S105, after the target data fed back by the resource source station reaches the equalizer, the equalizer determines a second target service node corresponding to the stored target data based on the data storage condition of each service node;
step S106, if the equalizer judges that the second target service node is the current service node, target data is sent to the current service node;
step S107, if the equalizer judges that the second target service node is not the current service node, the target data is sent to the second target service node, and the identification information of the second target service node is sent to the current service node;
and S108, after the second target node receives the target data, storing the mapping relation between the unique identifier corresponding to the target data and the identifier information of the second target node into a record database.
In the foregoing embodiment, specifically, if the first target service node does not feed back a response, or if a channel established between the current service node and the first target service node is damaged, and the current service node cannot acquire the target data from the first target service node, the data is correspondingly acquired from the resource source station. Specifically, through balance transition, resources are stored to service nodes with relatively low corresponding loads, so that the utilization efficiency of each resource node is improved, each service is fully utilized, resource waste is reduced, each storage node is utilized in a balanced manner, the operation and maintenance frequency is reduced, and the operation and maintenance cost is saved. Further improving the efficiency of distributed data access. Furthermore, the efficiency of data distributed access is improved when a certain service node is down or cannot access the connection, and the disaster recovery efficiency is improved.
Referring to fig. 4, in one embodiment, the method further comprises:
step S109, when the recording database detects that the first target service node is opened, delete the mapping relationship between the unique identifier corresponding to the target data and the identifier information of the first target node, and send a delete command to the first target service node, so that the first target service node deletes the stored target data.
In the foregoing embodiment, specifically, when multiple copies of the same data correspond to the current storage pool, sufficient data may be selectively deleted, so as to reduce resource occupation and further improve efficiency of distributed data access.
In one embodiment, the method further comprises:
if the target data does not exist, the current service node sends a target data request command to the corresponding resource source station after receiving feedback information of 'target data does not exist' fed back by the record database;
after target data fed back by the resource source station reaches the equalizer, the equalizer determines a third target service node corresponding to the stored target data based on the data storage condition of each service node;
if the third target service node is the current service node, the equalizer sends target data to the current service node;
and if the third target service node is not the current service node, sending the target data to the third target service node, and sending the identification information of the third target service node to the current service node.
In one embodiment, the method further comprises:
and after receiving the identification information of the third target service node, the current service node starts a data acquisition thread and communicates with the third target service node, and after receiving a feedback command of the third target service node, a data transmission channel is generated to acquire the target data.
In one embodiment, the method further comprises:
and after the third target service node receives the target data, updating the mapping relation between the identification information of the third target service node and the unique identification of the target data to a record database.
In the foregoing embodiment, specifically, when detecting data in the record database and determining that the unique identifier of the target data does not exist, the current node needs to acquire resources from the source station, and the process is consistent with the principle that the target data cannot be acquired from the first target service, which is not described herein again.
Example 2
Fig. 5 is a structural diagram of a distributed data access system according to an embodiment of the present invention, and the embodiment describes a distributed data access method according to an embodiment of a method applied by the apparatus. The distributed data access system comprises:
the current service node 511 receives a data request command for target data, and sends the target data request command to a record database;
the record database 520 is configured to detect whether a unique identifier of target data exists in the record database when a data request command for the target data is received; and
if the unique identifier of the target data exists, determining a first target service node for storing the target data based on the mapping relation between the unique identifier stored in the record database and the identification information of the service node, and feeding back the identification information of the first target service node to the current service node;
the current service node is also used for sending a data request command to the first target service node after receiving the identification information of the first target service node so as to request target data;
the first target service node 512 stores target data.
Referring to FIG. 5, in one embodiment, the distributed based data access system further comprises:
the resource source station 530 is configured to receive a target data request command sent by the current service node after receiving feedback information of "target data does not exist" fed back by the record database, and transmit target data corresponding to the target data request command to the equalizer;
the equalizer 540 is used for receiving the target data sent by the resource source station and determining a third target service node corresponding to the stored target data based on the data storage condition of each service node; a
The equalizer is further configured to:
if the third target service node is the current service node, sending target data to the current service node;
and if the third target service node is not the current service node, sending the target data to the third target service node, and sending the identification information of the third target service node to the current service node.
The distributed data access system provided in the embodiment of the present application may be used in the method performed in embodiment 1, and for details, reference is made to the above method embodiment, which has similar implementation principles and technical effects, and details are not repeated herein.
Example 3
In the distributed data access apparatus provided by the embodiment of the present invention, as shown in fig. 6, the electronic device includes a processor 601 and a memory 602, where the processor 601 and the memory 602 may be connected by a bus or by other means, and the illustrated example is a bus connection.
The Processor 601 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), a Graphics Processing Unit (GPU), an embedded Neural Network Processor (NPU), or other dedicated deep learning coprocessor, an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component, or the like, or a combination thereof.
The memory 602, which is a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the distributed data access based methods in the embodiments of the present invention. The processor 601 executes various functional applications and data processing of the processor by running non-transitory software programs, instructions and modules stored in the memory 602, that is, implements the distributed data access method in the above method embodiment 1.
The memory 602 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created by the processor 601, and the like. Further, the memory 602 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory 602 may optionally include memory located remotely from the processor 601, which may be connected to the processor 601 through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The one or more modules are stored in the memory 602 and, when executed by the processor 601, perform a distributed based data access method as shown in fig. 1.
Embodiments of the present invention further provide a non-transitory computer-readable storage medium, where computer-executable instructions are stored, where the computer-executable instructions may execute the distributed data access method in any of the above method embodiments. The non-transitory computer readable storage medium may be a magnetic Disk, an optical Disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a Flash Memory (Flash Memory), a Hard Disk (Hard Disk Drive, abbreviated as HDD), a Solid-State Drive (SSD), or the like; the non-transitory computer readable storage medium may also include a combination of memories of the above kind.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, apparatus or non-transitory computer readable storage medium, all relating to or comprising a computer program product.
Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
Obviously, the above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that various changes and modifications to the above description could be made by those skilled in the art without departing from the spirit of the present application. And are neither required nor exhaustive of all embodiments. And obvious variations or modifications therefrom are within the scope of the invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A distributed data access method is applied to distributed service nodes, and is characterized in that the method comprises the following steps:
when a data request command for target data is received, detecting whether a unique identifier of the target data exists in a record database;
if the unique identifier exists, determining a first target service node storing target data based on the mapping relation between the unique identifier stored in the record database and the identifier information of the service node, and feeding back the identifier information of the first target service node to the current service node;
and after receiving the identification information of the first target service node, the current service node sends a data request command to the first target service node to request target data.
2. The distributed data access method according to claim 1, wherein after receiving the identification information of the first target service node, the current service node sends a data request command to the first target service node to request the target data, including:
if the identification information of the first target service node is the same as that of the current service node, reading the target data from the local storage of the current service node;
and if the identification information of the first target service node is different from the identification information of the current service node, starting a data acquisition thread, communicating with the first target service node, and generating a data transmission channel after receiving a feedback command of the first target server node so as to acquire the target data.
3. The distributed based data access method of claim 2,
if the identification information of the first target service node is different from the identification information of the current service node, but the target data cannot be acquired from the first target service node, the method further comprises:
sending a target data request command to a corresponding resource source station;
after target data fed back by the resource source station reaches the equalizer, the equalizer determines a second target service node corresponding to the stored target data based on the data storage condition of each service node;
if the equalizer judges that the second target service node is the current service node, target data are sent to the current service node;
if the equalizer judges that the second target service node is not the current service node, the target data is sent to the second target service node, and the identification information of the second target service node is sent to the current service node;
and after receiving the target data, the second target node stores the mapping relation between the unique identifier corresponding to the target data and the identifier information of the second target node into the record database.
4. The distributed data access-based method of claim 1, wherein the method further comprises:
if the target data does not exist, the current service node sends a target data request command to the corresponding resource source station after receiving feedback information of 'target data does not exist' fed back by the record database;
after target data fed back by the resource source station reaches the equalizer, the equalizer determines a third target service node corresponding to the stored target data based on the data storage condition of each service node;
if the third target service node is the current service node, the equalizer sends target data to the current service node;
and if the third target service node is not the current service node, sending the target data to the third target service node, and sending the identification information of the third target service node to the current service node.
5. The distributed data access-based method of claim 4, wherein the method further comprises:
and after receiving the identification information of the third target service node, the current service node starts a data acquisition thread and communicates with the third target service node, and after receiving a feedback command of the third target service node, a data transmission channel is generated to acquire the target data.
6. The distributed data access-based method of claim 5, wherein the method further comprises:
and after the third target service node receives the target data, updating the mapping relation between the identification information of the third target service node and the unique identification of the target data to a record database.
7. A distributed based data access system, comprising:
the current service node receives a data request command aiming at target data and sends the target data request command to a record database;
the system comprises a record database, a database management module and a database management module, wherein the record database is used for detecting whether a unique identifier of target data exists in the record database when a data request command aiming at the target data is received; and
if the unique identifier of the target data exists, determining a first target service node for storing the target data based on the mapping relation between the unique identifier stored in the record database and the identification information of the service node, and feeding back the identification information of the first target service node to the current service node;
the current service node is also used for sending a data request command to the first target service node after receiving the identification information of the first target service node so as to request target data;
the first target service node stores target data.
8. The distributed based data access system of claim 7, further comprising:
the resource source station is used for receiving a target data request command sent by the current service node after receiving feedback information of 'target data does not exist' fed back by the record database, and transmitting target data corresponding to the target data request command to the equalizer;
the equalizer is used for receiving target data sent by the resource source station and determining a third target service node corresponding to the stored target data based on the data storage condition of each service node; a
The equalizer is further configured to:
if the third target service node is the current service node, sending target data to the current service node;
and if the third target service node is not the current service node, sending the target data to the third target service node, and sending the identification information of the third target service node to the current service node.
9. A distributed based data access apparatus, comprising: a memory and a processor, the memory and the processor being communicatively connected to each other, the memory having stored therein computer instructions, the processor executing the computer instructions to perform the distributed data access-based method of any of claims 1-6.
10. A non-transitory computer readable storage medium storing computer instructions which, when executed by a processor, implement the distributed based data access method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111670839.2A CN114327295A (en) | 2021-12-31 | 2021-12-31 | Distributed data access method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111670839.2A CN114327295A (en) | 2021-12-31 | 2021-12-31 | Distributed data access method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114327295A true CN114327295A (en) | 2022-04-12 |
Family
ID=81021820
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111670839.2A Pending CN114327295A (en) | 2021-12-31 | 2021-12-31 | Distributed data access method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114327295A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108667903A (en) * | 2018-04-03 | 2018-10-16 | 新华三技术有限公司 | Data transmission method for uplink, device and storage medium |
| CN110297766A (en) * | 2019-06-03 | 2019-10-01 | 合肥移瑞通信技术有限公司 | Method for testing software and software testing system based on distributed test node cluster |
| CN111385324A (en) * | 2018-12-28 | 2020-07-07 | 广州市百果园信息技术有限公司 | Data communication method, device, equipment and storage medium |
| CN111897638A (en) * | 2020-07-27 | 2020-11-06 | 广州虎牙科技有限公司 | Distributed task scheduling method and system |
| CN113296981A (en) * | 2021-05-25 | 2021-08-24 | 建信金融科技有限责任公司 | Data processing method and device, electronic equipment and storage medium |
-
2021
- 2021-12-31 CN CN202111670839.2A patent/CN114327295A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108667903A (en) * | 2018-04-03 | 2018-10-16 | 新华三技术有限公司 | Data transmission method for uplink, device and storage medium |
| CN111385324A (en) * | 2018-12-28 | 2020-07-07 | 广州市百果园信息技术有限公司 | Data communication method, device, equipment and storage medium |
| CN110297766A (en) * | 2019-06-03 | 2019-10-01 | 合肥移瑞通信技术有限公司 | Method for testing software and software testing system based on distributed test node cluster |
| CN111897638A (en) * | 2020-07-27 | 2020-11-06 | 广州虎牙科技有限公司 | Distributed task scheduling method and system |
| CN113296981A (en) * | 2021-05-25 | 2021-08-24 | 建信金融科技有限责任公司 | Data processing method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101752928B1 (en) | Swarm-based synchronization over a network of object stores | |
| EP3125501A1 (en) | File synchronization method, server, and terminal | |
| CN110018996B (en) | Snapshot rollback method and related device of distributed storage system | |
| WO2016095149A1 (en) | Data compression and storage method and device, and distributed file system | |
| CN111562889B (en) | Data processing method, device, system and storage medium | |
| CN103823807B (en) | A kind of method, apparatus and system for removing repeated data | |
| CN103888501A (en) | Virtual machine migration method and device | |
| CN110955704A (en) | Data management method, device, equipment and storage medium | |
| CN110855627B (en) | Application deployment method, device, equipment and medium | |
| US10853892B2 (en) | Social networking relationships processing method, system, and storage medium | |
| CN101483668A (en) | Network storage and access method, device and system for hot spot data | |
| CN107547605B (en) | message reading and writing method based on node queue and node equipment | |
| CN114327295A (en) | Distributed data access method and system | |
| CN114089924B (en) | Block chain account book data storage system and method | |
| CN103714059A (en) | Data updating method and device | |
| CN108173892B (en) | Cloud mirror image operation method and device | |
| CN111984196B (en) | File migration method, device, equipment and readable storage medium | |
| CN111431951A (en) | Data processing method, node equipment, system and storage medium | |
| CN105939278B (en) | Traffic processing method and device | |
| CN115599295A (en) | Node capacity expansion method and device of storage system | |
| CN114466004A (en) | File transmission method, system, electronic equipment and storage medium | |
| CN111125011B (en) | File processing method, system and related equipment | |
| CN111522873B (en) | Block generation method, device, computer equipment and storage medium | |
| CN113051143A (en) | Detection method, device, equipment and storage medium for service load balancing server | |
| CN116991333B (en) | Distributed data storage method, device, electronic equipment and storage medium |
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 |