WO2016101759A1 - Procédé d'acheminement de données, dispositif de gestion de données et système de stockage distribué - Google Patents

Procédé d'acheminement de données, dispositif de gestion de données et système de stockage distribué Download PDF

Info

Publication number
WO2016101759A1
WO2016101759A1 PCT/CN2015/095507 CN2015095507W WO2016101759A1 WO 2016101759 A1 WO2016101759 A1 WO 2016101759A1 CN 2015095507 W CN2015095507 W CN 2015095507W WO 2016101759 A1 WO2016101759 A1 WO 2016101759A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
node
information
data node
message
Prior art date
Application number
PCT/CN2015/095507
Other languages
English (en)
Chinese (zh)
Inventor
陈营
李明昊
宋昭
陈宗志
王超
Original Assignee
北京奇虎科技有限公司
奇智软件（北京）有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 北京奇虎科技有限公司, 奇智软件（北京）有限公司 filed Critical 北京奇虎科技有限公司
Publication of WO2016101759A1 publication Critical patent/WO2016101759A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/18—File system types
    • G06F16/182—Distributed file systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/40—Support for services or applications

Definitions

  • the present invention relates to the field of distributed storage technologies, and in particular, to a data routing method, a data management apparatus, and a distributed storage system.
  • GFS Google File System
  • MapReduce Map Simplification
  • GFS divides nodes of the entire system into three types of roles: Client (Client), Master (Master Server), and Chunk Server (Data Block Server); Client is the access interface provided by GFS to the application; Master is the management node of GFS, there is only one logic, it saves the metadata of the system and is responsible for the management of the entire file system; Chunk Server is responsible for the specific storage work, the data is filed. The form is stored on the Chunk Server, and the number of Chunk Servers can be multiple.
  • the client When the client accesses the GFS, the client first sends a metadata routing request to the master, where the metadata routing request carries key (keyword) information, and the master obtains the Chunk Server information corresponding to the key according to the stored metadata table, and then directly Access these Chunk Servers to complete data access.
  • This design method of GFS realizes the separation of control flow and data flow. There is only control flow between the Client and the Master, and there is no data flow, which greatly reduces the load of the Master, so that it does not become a bottleneck of system performance.
  • the client and the Chunk Server directly transmit data streams.
  • the Client can access multiple Chunk Servers at the same time, so that the I/O of the entire system is highly parallel and the overall performance of the system is improved.
  • the present invention has been made in order to provide a data routing method, a data management apparatus, and a distributed storage system that overcome the above problems or at least partially solve the above problems.
  • a data routing method including:
  • the data node obtains data node information corresponding to the first keyword information according to the first keyword information matching the metadata table of the first keyword information; wherein the metadata table stores data node information corresponding to the keyword,
  • the metadata table is maintained based on communication between data nodes;
  • the data node returns the data node information to the client.
  • a computer program comprising computer readable code that, when executed on a computing device, causes the computing device to perform a data routing method as described above.
  • a computer readable medium storing a computer program as described above.
  • a data management apparatus including:
  • a first receiving module configured to receive a metadata routing request from the client, where the metadata routing request carries first keyword information of the data
  • the first matching module is configured to obtain data node information corresponding to the first keyword information according to the first keyword information matching the metadata table of the first keyword information, where the metadata table stores data corresponding to the keyword Node information, which is obtained based on communication maintenance between data nodes;
  • a first return module configured to return the data node information to the client.
  • a data node can process metadata of a client by using a metadata table stored by itself. Routing request; since the data node can maintain the metadata table based on the communication between the data nodes, the maintained metadata table can reflect the change of the node state in time, thereby ensuring that the correct data node information is fed back to the client, thereby improving The accuracy of the metadata routing; and the use of the dedicated master to store and maintain the metadata table acquisition in the prior art, the embodiment of the present invention reduces the role of the master, thereby reducing the operation and maintenance deployment of the distributed storage system. cost.
  • FIG. 1 is a schematic structural view of a prior art GFS
  • FIG. 2 is a flow chart showing the steps of a data routing method according to an embodiment of the present invention.
  • FIG. 3 is a block diagram showing the structure of a distributed storage system according to an example of the present invention.
  • FIG. 4 is a flow chart showing the steps of a data routing method according to an embodiment of the present invention.
  • FIG. 5 is a flow chart showing the steps of a data routing method according to an embodiment of the present invention.
  • FIG. 6 is a flow chart showing the steps of maintaining a data table based on communication between data nodes according to an embodiment of the present invention
  • FIG. 7 is a flow chart showing the steps of a data routing method according to an embodiment of the present invention.
  • FIG. 8 is a schematic structural diagram of a data management apparatus according to an embodiment of the present invention.
  • FIG. 9 is a schematic structural diagram of a data management apparatus according to an embodiment of the present invention.
  • FIG. 10 is a schematic structural diagram of a data management apparatus according to an embodiment of the present invention.
  • FIG. 11 is a schematic structural diagram of a distributed storage system according to an embodiment of the present invention.
  • Figure 12 schematically shows a block diagram of a computing device for performing the method according to the invention
  • Fig. 13 schematically shows a storage unit for holding or carrying program code implementing the method according to the invention.
  • FIG. 2 a schematic flowchart of a step of a data routing method according to an embodiment of the present invention is shown, which may include the following steps:
  • Step 201 The data node receives a metadata routing request from the client, where the metadata routing request carries the first keyword information of the data.
  • Step 202 The data node matches the metadata table of the first keyword information to obtain data node information corresponding to the first keyword information, where the metadata table stores data corresponding to the keyword. Node information, which is obtained based on communication maintenance between data nodes;
  • Step 203 The data node returns the data node information to the client.
  • the embodiments of the present invention can be applied to distributed storage systems of various services for improving the accuracy of metadata routing.
  • the method includes: a client 301 and a data node 302.
  • the client 301 serves as an initiator of a service request and can pass the element.
  • the data routing request acquires the data node information corresponding to the metadata routing request from the data node 302, so that the data node information corresponding data node 302 can be accessed to complete the data access operation; the data node 302 can store the metadata.
  • Table, And the data nodes 302 can communicate with each other, so that the metadata table can be maintained based on communication between the data nodes 302 to ensure that the metadata table can reflect changes in node status in time.
  • the step of the data node obtaining the data node information corresponding to the first keyword information according to the first keyword information matching the metadata table of the first keyword information may specifically include :
  • Sub-step A1 calculating a hash value of the first keyword information
  • Sub-step A2 matching the metadata table according to the hash value, to obtain the hash value corresponding data node information.
  • a hash algorithm such as a one-way hash algorithm may be used to calculate a hash value of the first keyword information, and the specific hash algorithm is not limited in the embodiment of the present invention.
  • the data node information may specifically include one or more of the following information: node number information, node attribute information, and node communication rate information.
  • the node attribute information may specifically include: information that the node is available or the node is unavailable, and the node communication rate information may be a communication rate value of the node or the like.
  • the node number information of the data node corresponding to the hash value may be the number of the data node itself, or may be the number of other data nodes, whichever is the case, the data node
  • the hash value corresponding to the node number of the data node may be returned to the client to satisfy the client's further node access request.
  • the data node can use its stored metadata table to process the client's metadata routing request; since the data node can maintain the metadata table based on the communication between the data nodes, the maintained metadata table can reflect the node in time.
  • the change of the state therefore, can ensure that the correct data node information is fed back to the client, and the accuracy of the metadata routing is improved; and the implementation of the present invention is implemented by using a dedicated Master to store and maintain the metadata table acquisition in the prior art. This reduces the role of the Master, thus reducing the operating and deployment costs of distributed storage systems.
  • FIG. 4 a schematic flowchart of a step of a data routing method according to an embodiment of the present invention is shown, which may include the following steps:
  • Step 401 The data node receives a metadata routing request from a client, where the element The data routing request carries the first keyword information of the data;
  • Step 402 The data node matches the metadata table of the first keyword information to obtain data node information corresponding to the first keyword information, where the metadata table stores data corresponding to the keyword. Node information, which is obtained based on communication maintenance between data nodes;
  • Step 403 The data node returns the data node information to the client.
  • Step 404 When the data node information corresponding to the first keyword information is not the data node itself, the data node returns the metadata table to the client.
  • the data node when the data node information corresponding to the first keyword information is not the data node itself, the data node may further return the metadata table to the client. End, that is, the current metadata table can be provided to the client, so that the client can query the metadata by querying its own metadata table.
  • the metadata can be routed in the following two ways: the first method is to perform metadata routing by sending a metadata routing request to the data node, and the second method is to query the metadata table of the user by querying its own metadata table.
  • the routing of metadata in which the first method has the advantage of high accuracy, the second method has the advantage of saving traffic. It can be understood that any one or both of the above two methods may be determined by a person skilled in the art according to actual needs. For example, when the accuracy requirement is strict, the foregoing method 1 may be adopted, and, for example, the traffic demand is strict. In the above manner, the second method may be adopted, or in order to ensure the success rate of the route, the foregoing manners 1 and 2 may be simultaneously adopted.
  • FIG. 5 a schematic flowchart of a step of a data routing method according to an embodiment of the present invention is shown, which may specifically include the following steps:
  • Step 501 The data node receives a metadata routing request from the client, where the metadata routing request carries the first keyword information of the data.
  • Step 502 The data node matches the metadata table of the first keyword information to obtain data node information corresponding to the first keyword information.
  • the metadata table stores data corresponding to the keyword. Node information, which is based on communication maintenance between data nodes get;
  • Step 503 The data node returns the data node information to the client.
  • Step 504 The data node performs maintenance on the metadata table based on communication between data nodes.
  • a flow chart of steps for maintaining a data table based on communication between data nodes is performed according to an embodiment of the present invention, which may specifically include the following steps:
  • Sub-step 541 the coordinator node sends a preparation message to all participant nodes executing the transaction T;
  • each participant node determines whether to submit a transaction T, and if so, returns a ready message to the coordinator node; otherwise, returns an abnormal abort message to the coordinator node;
  • Sub-step 543 when the messages obtained from all participant nodes are ready messages, the coordinator node sends a formal commit message to all participant nodes;
  • Sub-step 544 after receiving the formal submission message, each participant node officially completes the transaction T, releases the occupation during the entire transaction T, and sends a completion message to the coordinator node;
  • Sub-step 545 the coordinator node completes the transaction after receiving the completion message fed back by all the participant nodes;
  • Sub-step 546 when the coordinator node has an abnormal abort message in the message obtained from all the participant nodes, or when the response message of all the participant nodes cannot be acquired before the timeout, the coordinator node to all the participant nodes Issue a rollback message;
  • the timeout can indicate that the official submission message has been issued until the preset period is exceeded.
  • Sub-step 547 after receiving the rollback message, each participant node performs a rollback operation on the transaction T, releases the resources occupied during the entire T transaction, and sends a rollback completion message to the coordinator node;
  • Sub-step 548 after the coordinator node receives the rollback completion message fed back by all the participant nodes, cancels the transaction T.
  • the data node of this embodiment may specifically include: a coordinator node and a participant node, and adding that the data node maintains the metadata table based on communication between data nodes.
  • the metadata maintenance involved in the above sub-step 541 - sub-step 548 The process specifically guarantees the consistency and integrity of the metadata tables maintained by all participant nodes through a two-phase commit protocol.
  • the main idea of the two-phase commit protocol can be: when a transaction T is to operate on multiple databases, it must be ensured that the database of the multiple participant nodes is successfully submitted, and the transaction T can succeed. Therefore, the coordination node can firstly The participant node issues a pre-submission, and the multiple participant nodes return whether they can submit. If all the participant nodes can submit, the coordination node can formally submit the transaction T.
  • sub-step 541 - sub-step 542 is the first stage step
  • sub-step 543 - sub-step 548 is the second stage step.
  • the coordinator node will notify the participant node of the transaction to prepare to commit or cancel the transaction, and the participant node informs the coordinator node of its decision: consent (ready message) or cancellation (abnormal abort message);
  • the coordinator node will make decisions based on information fed back by all participant nodes: commit or cancel, and the coordinator node notifies all participant nodes to commit the transaction if and only if all participant nodes agree to commit the transaction. Otherwise, the coordinator node will notify all participant nodes to cancel the transaction.
  • FIG. 7 a flow chart of steps of a data routing method according to an embodiment of the present invention is shown, which may specifically include the following steps:
  • Step 701 The data node receives a metadata routing request from the client, where the metadata routing request carries the first keyword information of the data.
  • Step 702 The data node matches the metadata table of the first keyword information to obtain data node information corresponding to the first keyword information, where the metadata table stores Data node information corresponding to the keyword, the metadata table is obtained based on communication maintenance between the data nodes;
  • Step 703 The data node returns the data node information to the client.
  • Step 704 The data node receives a read request from a client, where the read request carries second keyword information of data.
  • Step 705 The data node matches its own metadata table according to the second keyword information carried by the read request, to obtain data node information corresponding to the second keyword information.
  • Step 706 The data node determines, according to the data node information corresponding to the second keyword information, whether the read request corresponding data is in the data node itself;
  • Step 707 When the data node information corresponding to the second keyword information is the data node itself, the data node queries its own data engine according to the read request, and returns the data obtained by the query to the client. end;
  • Step 708 When the data node information corresponding to the second keyword information is not the data node itself, forwarding the read request to the first data node corresponding to the data node information corresponding to the second keyword information;
  • Step 709 Receive data corresponding to the read request returned by the first data node, and return the data to the client.
  • the embodiment may also process the read request from the client through steps 704-step 709, in particular, In the process of processing the read request, when the data node information corresponding to the second keyword information carried in the read request is not the data node itself, the data node may also play the role of a network proxy, that is, And forwarding the read request to the first data node corresponding to the data node information corresponding to the second keyword information, and the data corresponding to the read request returned by the first data node is returned to the client;
  • the process in which the proxy client forwards the read request and returns the read data to the client can prevent the client from attempting to send a read request to multiple different data nodes, thereby saving the traffic of the client.
  • the data node may also forward the write request to the client and return the response result to the client.
  • the process of forwarding the write request to the proxy client is similar to the process of forwarding the read request by the proxy client, so it will not be described here and cross-referenced.
  • FIG. 8 is a schematic structural diagram of a data management apparatus according to an embodiment of the present invention, which may specifically include the following modules:
  • the first receiving module 801 is configured to receive a metadata routing request from the client, where the metadata routing request carries the first keyword information of the data;
  • the first matching module 802 is configured to obtain data node information corresponding to the first keyword information according to the first keyword information matching the metadata table of the first keyword information, where the metadata table stores a keyword corresponding Data node information obtained based on communication maintenance between data nodes;
  • the first returning module 803 is configured to return the data node information to the client.
  • the data management device may be a data node itself or a device for managing each data node.
  • the specific location of the data management device is not limited in the embodiment of the present invention.
  • the first matching module 802 may specifically include:
  • a hash calculation submodule configured to calculate a hash value of the first keyword information
  • the hash matching submodule is configured to match the metadata table according to the hash value to obtain the hash value corresponding data node information.
  • the data node may further include:
  • a second returning module configured to: when the data node information corresponding to the first keyword information is not the data node itself, the data node returns the metadata table to the client.
  • FIG. 9 is a schematic structural diagram of a data management apparatus according to an embodiment of the present invention, which may specifically include: a coordinator node 901 and a participant node 902;
  • the coordinator node 901 may specifically include: a first maintenance module 911 configured to perform maintenance on the metadata table based on communication between data nodes;
  • the participant node 902 may specifically include the following modules:
  • the first receiving module 921 is configured to receive a metadata routing request from the client, where the metadata routing request carries the first keyword information of the data;
  • the first matching module 922 is configured to obtain the data node information corresponding to the first keyword information according to the first keyword information matching the metadata table of the first keyword information, where the metadata table stores the keyword corresponding Data node information, which is obtained based on communication maintenance between data nodes;
  • a first returning module 923 configured to return the data node information to the client
  • the second maintenance module 924 is configured to perform maintenance on the metadata table based on communication between data nodes;
  • the first maintenance module 911 may specifically include:
  • the formal submission sending sub-module 9112 is configured to issue a formal submission message to all participant nodes when the messages obtained from all the participant nodes are ready messages;
  • the transaction completion sub-module 9113 is configured to complete the transaction after receiving the completion message fed back by all the participant nodes;
  • Rollback sending sub-module 9114 configured to have an abort message in a message obtained from all participant nodes, or to obtain a response message of all participant nodes before timing out, the coordinator node to all participant nodes Issue a rollback message;
  • the transaction cancellation sub-module 9115 is configured to cancel the transaction T after receiving the rollback completion message fed back by all the participant nodes;
  • the second maintenance module 924 may specifically include:
  • Preparing a response sub-module 9241 configured to determine whether to submit a transaction T, and if so, to the association
  • the caller node returns a ready message, otherwise, returns an abort message to the coordinator node;
  • the transaction execution sub-module 9242 is configured to formally complete the transaction T after receiving the formal submission message, release the occupation during the entire transaction T, and send the completion message to the coordinator node;
  • the rollback submodule 9243 is configured to perform, by each participant node, a rollback operation on the transaction T after receiving the rollback message, release the resources occupied during the entire T transaction, and send back to the coordinator node. Roll the completion message.
  • FIG. 10 a schematic structural diagram of a data management apparatus according to an embodiment of the present invention is shown, which may specifically include the following modules:
  • the first receiving module 1001 is configured to receive a metadata routing request from the client, where the metadata routing request carries first keyword information of the data;
  • the first matching module 1002 is configured to obtain data node information corresponding to the first keyword information according to the first keyword information matching the metadata table of the first keyword information, where the metadata table stores a keyword corresponding Data node information, which is obtained based on communication maintenance between data nodes;
  • the first returning module 1003 is configured to return the data node information to the client
  • the second receiving module 1004 is configured to receive a read request from the client, where the read request carries the second keyword information of the data;
  • the second matching module 1005 is configured to match the metadata table of the second keyword information carried by the read request to obtain the data node information corresponding to the second keyword information;
  • the determining module 1006 is configured to determine, according to the data node information corresponding to the second keyword information, whether the read request corresponding data is in the data node itself;
  • the query module 1007 is configured to: when the data node information corresponding to the second keyword information is the data node itself, the data node queries its own data engine according to the read request, and returns the data obtained by the query to The client;
  • the forwarding module 1008 is configured to: when the data node information corresponding to the second keyword information is not the data node itself, forward the read request to the first data corresponding to the data node information corresponding to the second keyword information Node;
  • the third returning module 1009 is configured to receive data corresponding to the read request returned by the first data node, and return the data to the client.
  • the present invention also provides a distributed storage system, which may specifically include: a client and the foregoing data management device.
  • FIG. 11 is a schematic structural diagram of a distributed storage system according to an embodiment of the present invention, which may specifically include: a client 1101 and a plurality of data nodes 1102;
  • the data node 1102 may specifically include the following modules:
  • the first receiving module 1121 is configured to receive a metadata routing request from the client, where the metadata routing request carries the first keyword information of the data;
  • the first matching module 1122 is configured to obtain data node information corresponding to the first keyword information according to the first keyword information matching the metadata table of the first keyword information, where the metadata table stores a keyword corresponding Data node information obtained based on communication maintenance between data nodes;
  • the first return module 1123 is configured to return the data node information to the client.
  • the description is relatively simple, and the relevant parts can be referred to the description of the method embodiment.
  • the various component embodiments of the present invention may be implemented in hardware, or in a software module running on one or more processors, or in a combination thereof.
  • a microprocessor or digital signal processor may be used in practice to implement some or all of the components of the data routing method, data management apparatus, and distributed storage system in accordance with embodiments of the present invention. Some or all of the features.
  • the invention can also be implemented as a device or device program (e.g., a computer program and a computer program product) for performing some or all of the methods described herein.
  • a program implementing the invention may be stored on a computer readable medium or may be in the form of one or more signals.
  • Such signals may be downloaded from an internet platform, provided on a carrier signal, or provided in any other form.
  • Figure 12 illustrates a computing device, such as a search, that can implement the above method in accordance with the present invention.
  • the computing device conventionally includes a processor 1210 and a computer program product or computer readable medium in the form of a memory 1230.
  • the memory 1230 may be an electronic memory such as a flash memory, an EEPROM (Electrically Erasable Programmable Read Only Memory), an EPROM, a hard disk, or a ROM.
  • Memory 1230 has a storage space 1250 that stores program code 1251 for performing any of the method steps described above.
  • storage space 1250 storing program code may include various program codes 1251 for implementing various steps in the above methods, respectively.
  • the program code can be read from or written to one or more computer program products.
  • Such computer program products include program code carriers such as hard disks, compact disks (CDs), memory cards or floppy disks.
  • Such a computer program product is typically a portable or fixed storage unit such as that shown in FIG.
  • the storage unit may have storage segments, storage spaces, and the like that are similarly arranged to memory 1230 in the computing device of FIG.
  • the program code can be compressed, for example, in an appropriate form.
  • the storage unit comprises computer readable code 1251' for performing the steps of the method according to the invention, ie code that can be read by a processor such as 1210, which when executed by the server causes the server to execute Each step in the described method.

Abstract

L'invention concerne un procédé d'acheminement de données, un dispositif de gestion de données et un système de stockage distribué. Le procédé comprend spécifiquement les étapes suivantes : un nœud de données reçoit une demande d'acheminement de métadonnées provenant d'un client, la demande d'acheminement de métadonnées transportant des premières informations de mot-clé concernant des données ; le nœud de données obtient des informations de nœud de données correspondant aux premières informations de mot-clé d'après une table de métadonnées correspondant aux premières informations de mot-clé elles-mêmes, les informations de nœud de données correspondant au mot-clé étant stockées dans la table de métadonnées, et la table de métadonnées étant obtenue selon le maintien de la communication entre les nœuds de données ; et le nœud de données renvoie les informations de nœud de données au client. Les modes de réalisation de la présente invention permettent de garantir que les informations de nœud de données renvoyées au client sont correctes, ce qui augmente le degré de précision de l'acheminement des métadonnées tout en réduisant les coûts de fonctionnement et de maintenance d'un système de stockage distribué.
PCT/CN2015/095507 2014-12-27 2015-11-25 Procédé d'acheminement de données, dispositif de gestion de données et système de stockage distribué WO2016101759A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410832192.2A CN104580428B (zh) 2014-12-27 2014-12-27 一种数据路由方法、数据管理装置和分布式存储系统
CN201410832192.2 2014-12-27

Publications (1)

Publication Number Publication Date
WO2016101759A1 true WO2016101759A1 (fr) 2016-06-30

Family

ID=53095585

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/095507 WO2016101759A1 (fr) 2014-12-27 2015-11-25 Procédé d'acheminement de données, dispositif de gestion de données et système de stockage distribué

Country Status (2)

Country Link
CN (1) CN104580428B (fr)
WO (1) WO2016101759A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110119388A (zh) * 2019-05-14 2019-08-13 深信服科技股份有限公司 文件读写方法、装置、系统、设备及计算机可读存储介质
CN112702270A (zh) * 2020-12-18 2021-04-23 深圳赛安特技术服务有限公司 基于事件分发机制的节点调用方法、系统及存储介质

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020037625A1 (fr) * 2018-08-23 2020-02-27 袁振南 Système de stockage réparti et procédé de lecture/écriture de données associé, et terminal de stockage et support d'informations
CN109783204A (zh) * 2018-12-28 2019-05-21 咪咕文化科技有限公司 一种分布式事务处理方法、装置及存储介质
CN115904253B (zh) * 2023-01-09 2023-06-13 苏州浪潮智能科技有限公司 一种数据传输方法、装置、一种存储系统及设备和介质

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102984280A (zh) * 2012-12-18 2013-03-20 北京工业大学 针对社交类云存储网络应用的数据备份系统和方法
CN103019960A (zh) * 2012-12-03 2013-04-03 华为技术有限公司 分布式缓存方法及系统

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080209007A1 (en) * 2007-02-27 2008-08-28 Tekelec Methods, systems, and computer program products for accessing data associated with a plurality of similarly structured distributed databases
CN100576809C (zh) * 2007-08-21 2009-12-30 北京航空航天大学 大规模动态异构混合无线自组织网络中的接入及路由计算方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103019960A (zh) * 2012-12-03 2013-04-03 华为技术有限公司 分布式缓存方法及系统
CN102984280A (zh) * 2012-12-18 2013-03-20 北京工业大学 针对社交类云存储网络应用的数据备份系统和方法

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110119388A (zh) * 2019-05-14 2019-08-13 深信服科技股份有限公司 文件读写方法、装置、系统、设备及计算机可读存储介质
CN110119388B (zh) * 2019-05-14 2023-07-11 深信服科技股份有限公司 文件读写方法、装置、系统、设备及计算机可读存储介质
CN112702270A (zh) * 2020-12-18 2021-04-23 深圳赛安特技术服务有限公司 基于事件分发机制的节点调用方法、系统及存储介质

Also Published As

Publication number Publication date
CN104580428B (zh) 2018-09-04
CN104580428A (zh) 2015-04-29

Similar Documents

Publication Publication Date Title
US10733176B2 (en) Detecting phantom items in distributed replicated database
WO2016101759A1 (fr) Procédé d'acheminement de données, dispositif de gestion de données et système de stockage distribué
US9183271B2 (en) Big-fast data connector between in-memory database system and data warehouse system
JP6539677B2 (ja) トランザクションミドルウェアマシン環境におけるドメイン間メッセージ通信のためにバイパスドメインモデルおよびプロキシモデルをサポートし、かつサービス情報を更新するためのシステムおよび方法
WO2019001017A1 (fr) Procédé et système de transfert de données entre groupes, serveur et support de stockage informatique
CN110543448A (zh) 数据同步方法、装置、设备及计算机可读存储介质
EP3188051B1 (fr) Systèmes et procédés de production de modèle de recherche
CN105516284B (zh) 一种集群数据库分布式存储的方法和装置
KR20160147909A (ko) 트랜잭셔널 환경에서 리소스 관리자(rm) 인스턴스 인지에 기초하여 공통 트랜잭션 식별자(xid) 최적화 및 트랜잭션 친화성을 지원하기 위한 시스템 및 방법
JP6700308B2 (ja) データ・コピー方法及びデバイス
US20170161352A1 (en) Scalable snapshot isolation on non-transactional nosql
US20110016349A1 (en) Replication in a network environment
CN110633046A (zh) 一种分布式系统的存储方法、装置、存储设备及存储介质
TW201727517A (zh) 資料儲存與業務處理的方法及裝置
WO2016101662A1 (fr) Procédé de traitement de données et serveur approprié
US20160034191A1 (en) Grid oriented distributed parallel computing platform
US9684668B1 (en) Systems and methods for performing lookups on distributed deduplicated data systems
CN105574010B (zh) 数据查询方法及装置
US11093477B1 (en) Multiple source database system consolidation
CN111352938B (zh) 数据处理方法、计算机设备及存储介质
EP3349416B1 (fr) Procédé et système de traitement de chaîne de relations et support d'informations
US20230185559A1 (en) Managing a federated software repository across multiple devices
US8862544B2 (en) Grid based replication
CN109389271B (zh) 应用性能管理方法及系统
CN114553521A (zh) 一种远端内存访问方法、装置、设备及介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15871828

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15871828

Country of ref document: EP

Kind code of ref document: A1