WO2021022714A1 - Procédé de traitement de message destiné à un nœud entre des chaînes de blocs, dispositif, appareil et support - Google Patents

Procédé de traitement de message destiné à un nœud entre des chaînes de blocs, dispositif, appareil et support Download PDF

Info

Publication number
WO2021022714A1
WO2021022714A1 PCT/CN2019/118085 CN2019118085W WO2021022714A1 WO 2021022714 A1 WO2021022714 A1 WO 2021022714A1 CN 2019118085 W CN2019118085 W CN 2019118085W WO 2021022714 A1 WO2021022714 A1 WO 2021022714A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
message
message queue
request
current
Prior art date
Application number
PCT/CN2019/118085
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 WO2021022714A1 publication Critical patent/WO2021022714A1/fr

Links

Images

Classifications

    • 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/13—File access structures, e.g. distributed indices
    • 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/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/54—Interprogram communication
    • G06F9/546—Message passing systems or structures, e.g. queues
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/54—Indexing scheme relating to G06F9/54
    • G06F2209/548—Queue

Definitions

  • the present disclosure relates to the field of computer technology, and in particular, to a message processing method across blockchain nodes, a message processing device across blockchain nodes, electronic equipment, and computer-readable storage media.
  • Blockchain technology distributed ledger technology
  • distributed ledger technology is a decentralized distributed database technology with many characteristics such as openness, transparency, non-tampering, and trustworthiness.
  • a blockchain node when a blockchain node processes a message queue, it usually starts a long connection process for processing. When a pending message is detected in the message queue, the message is processed. When a large number of messages enter the message queue at the same time, the messages in the message queue can be processed one by one through the long connection process.
  • the startup blockchain node will be set as the "current node” by default, and the input/output program (input/output, referred to as IO program) will use the "current node” to update the file
  • IO program input/output program
  • the node label field that is, regardless of the blockchain node that initiates the request message to the front-end server, the node label of the blockchain node that initiated the persistent connection process is always marked when the file is updated. Therefore, this MQ (message The queue) persistent connection scheme is only applicable to those cases where the requesting blockchain node that initiates the message is consistent with the blockchain node that initiates the persistent connection process.
  • the purpose of the embodiments of the present disclosure is to provide a cross-blockchain node message processing method and related equipment, so as to overcome at least to a certain extent the nodes in the prior art that request nodes to change and cannot update files when the long connection process processes the message queue.
  • the label field and node handle capacity is limited.
  • a message processing method across blockchain nodes includes: starting a message queue monitoring process according to a starting node in the blockchain, and creating a corresponding node index area through the message queue monitoring process; Obtain the current message in the message queue of the blockchain node through the message queue monitoring process; obtain the target parameter of the current message according to the node index area, so as to obtain the target parameter according to the target parameter and the corresponding current message
  • the request node configures the node attributes of the message queue monitoring process; the node label field of the target file corresponding to the request node is updated through the node attributes of the message queue monitoring process, so as to process the request node through the message queue monitoring process The current message in.
  • a message processing device across blockchain nodes including: a startup unit configured to start a message queue monitoring process according to the startup node in the blockchain, and create a corresponding message queue monitoring process through the message queue monitoring process The node index area of the node; an obtaining unit configured to obtain the current message in the message queue of the blockchain node through the message queue monitoring process; a modification unit configured to obtain the target of the current message according to the node index area Parameter to configure the node attribute of the message queue monitoring process according to the target parameter and the request node corresponding to the current message; the processing unit is configured to update the node attribute of the request node through the node attribute of the message queue monitoring process The node label field of the target file is used to process the current message in the requesting node through the message queue monitoring process.
  • an electronic device including: a processor; and a memory, on which computer-readable instructions are stored, and when the computer-readable instructions are executed by the processor, the above-mentioned cross-blockchain is implemented The node's message processing method.
  • a computer non-volatile readable storage medium on which a computer program is stored, and the computer program, when executed by a processor, realizes the message processing across blockchain nodes according to any one of the above method.
  • the technical solution provided by the embodiments of the present disclosure may include the following beneficial effects: through the method of the present disclosure, on the one hand, the target parameter of the current message is obtained in the node index area and the corresponding system interface is called through the target parameter to pass the request node corresponding to the current message
  • the node attribute configuration of the startup node avoids the problem that the requested blockchain node and the blockchain node that initiates the long connection process must be consistent, and improves the efficiency of processing the message queue in the long connection process; on the other hand, it realizes the processing of the long connection process In the message queue, the node label field of the file can be updated correctly even if the requesting node changes; on the other hand, by creating a node index area to store nodes and node handles, the node handles of the same node can be reused, which solves the limited capacity of node handles The problem.
  • Fig. 1 schematically shows a schematic diagram of a cross-blockchain interaction system according to some embodiments of the present disclosure
  • Fig. 2 shows a schematic diagram of a message processing method across blockchain nodes according to some embodiments of the present disclosure
  • Figure 3 shows a schematic diagram of a message processing flow across blockchain nodes according to some embodiments of the present disclosure
  • Fig. 4 shows a schematic diagram of a message processing device across blockchain nodes according to some embodiments of the present disclosure
  • Fig. 5 shows a schematic structural diagram of a computer system of an electronic device according to some embodiments of the present disclosure
  • Fig. 6 schematically shows a schematic diagram of a computer non-volatile readable storage medium according to some embodiments of the present disclosure.
  • Fig. 1 shows a schematic diagram of a cross-blockchain interaction system according to some embodiments of the present disclosure.
  • the subscription client corresponds to a blockchain node in the first blockchain, and is used to maintain a message queue corresponding to the blockchain node, and the message queue contains messages subscribed by the blockchain node.
  • the publishing client corresponds to the second blockchain and is used to obtain and publish messages generated by the second blockchain.
  • the cross-chain interaction terminal (cross-chain interaction terminal 1, cross-chain interaction terminal 2) is used to obtain the subscription conditions of the blockchain nodes in the first blockchain, and when the end of the message queue contains messages that meet the subscription conditions, the The publishing client requests a message that meets the subscription condition and sends it to the subscribing client to update it in the message queue, so that the blockchain node in the first blockchain can pull the message from the message queue.
  • the blockchain node subscribing to the client processes the message queue (MQ), it usually starts a long connection process for processing.
  • MQ message queue
  • the message is processed.
  • the messages in the message queue can be processed one by one through the long connection process.
  • the startup blockchain node is set as the "current node” by default when the persistent connection process is started, the input/output program (Input/Output, referred to as IO program) will use the "current node” to update the node label field of the file , That is, regardless of the blockchain node that initiates the request message to the front-end server, it is always set to the node label of the blockchain node that initiated the long connection process when the file is updated. Therefore, this message queue long connection scheme is only suitable for configuration The case where the requesting blockchain node that initiates the message is consistent with the blockchain node that initiated the long connection process.
  • the method for processing messages across blockchain nodes may include the following steps:
  • step S210 a message queue monitoring process is started according to the start node in the blockchain, and a corresponding node index area is created through the message queue monitoring process.
  • the startup node may refer to the node corresponding to the message queue monitoring process in the blockchain.
  • the startup node may be a client in the blockchain.
  • the blockchain node may correspond to the first zone.
  • the message queue monitoring process can refer to a process configured to monitor and process messages in the message queue.
  • the message queue monitoring process can be a long connection process.
  • starting a message queue monitoring process can be a long connection process corresponding to the message queue. .
  • the long connection process is relative to the short connection process, that is, the long connection process can continuously monitor the message queue. Once unprocessed messages are found, they will be taken out and processed until the messages in the message queue are processed. .
  • the message queue monitoring process may also be a short connection process, and a message queue monitoring process to be started may be one or more short connection processes corresponding to the message queue.
  • the short connection process is a processing process generated separately for a certain message, and it terminates after processing the message.
  • the node index area is used to store the correspondence between the request node of the message in the message queue and the node handle corresponding to the request node.
  • the node index area can be understood as a memory area.
  • step S210 includes: obtaining a preset system interface based on the message queue monitoring process; creating a corresponding node index area according to the system interface, wherein the node index area is configured to store the current message in the message queue The corresponding relationship between the request node and the node handle of the request node.
  • the system interface can be pre-stored in the storage device of the client corresponding to the startup node, or can be configured by the developer. After the system starts the message queue monitoring process on the node, it calls the system interface through the message queue monitoring process and creates a node index area through the system interface.
  • Requesting node A can create a node handle A
  • the requesting node B can create a node handle B correspondingly, and the corresponding relations between the requesting node A and the node handle A, and the requesting node B and the node handle B are respectively stored in the node index area.
  • step S220 the current message in the message queue of the blockchain node is obtained through the message queue monitoring process.
  • the current message refers to the message to be processed with the logical position at the top in the message queue, that is, the current message is not a fixed message, but changes dynamically.
  • a message queue has messages to be processed A, message B to be processed, and message C to be processed in order of priority.
  • the logical position of message A to be processed in the message queue is at the top. Therefore, it is considered that message A to be processed is Current message;
  • pending message C is at the top of the logical position in the message queue, so it is considered pending message C Is the current message.
  • Step S220 further includes: sorting the messages to be processed in the message queue according to preset rules to generate a sequence list; and obtaining the current messages in the message queue in sequence according to the sequence list through the message queue monitoring process.
  • the preset rule may refer to a rule set by the user in advance for sorting messages to be processed, such as the priority of messages to be processed in a message queue, or the order in which messages enter the message queue.
  • the messages to be processed in the message queue are sorted and processed according to preset rules (the persistent connection process can only process the messages in the message queue one by one), for example, the messages to be processed are processed according to the priority of the message to be processed. Of course, you can also directly process the messages one by one according to the order in which the messages to be processed enter the message queue.
  • the message queue monitoring process obtains the current message in the generated sequence list or obtains the current message according to the time sequence when the message to be processed enters the message queue.
  • step S230 the target parameter of the current message is obtained according to the node index area, and the corresponding system interface is called according to the target parameter to configure the startup node through the node attribute of the request node corresponding to the current message.
  • the target parameter refers to the input parameter that is associated with the current message and is configured to call the system interface, such as the node handle corresponding to the request node of the current message, or the request node of the current message (get it through the request node of the current message in the node index Corresponding node handle, and then take the node handle as the input parameter of calling the system interface).
  • the node attributes include at least one attribute information such as the name of the node, the value of the node, and the type of the node.
  • the system can allocate computing resources and other services to the node according to the node attribute.
  • the message queue monitoring process calls the corresponding system interface according to the target parameter, and the system interface configures the startup node through the node attribute of the request node corresponding to the current message.
  • the system uses the startup node in the blockchain to start a long connection process for message processing.
  • the messages in the message queue can be processed one by one through the long connection process.
  • the persistent connection process will set the startup node as the "current node” by default when the startup node is started, the IO program will use the "current node” to update the node label field of the file.
  • the persistent connection process will process the current message of the requesting node at the start node. Due to inconsistent node attributes, the persistent connection process may fail to process the current message or reduce the efficiency of processing the message.
  • the node attribute of the node updates the node label field in the target file corresponding to the request node to process the current message in the request node by starting the message queue monitoring process in the node.
  • the previous message may refer to a message that has been processed by the message queue monitoring process and is adjacent to the position of the current message in the message queue. For example, a message queue has pending message A, pending message B, and pending message C arranged in priority order. At this time, pending message A is the current message.
  • the target file may refer to the compiled code corresponding to the requested node, and the node label field is stored in the target file.
  • the node label field can include node attribute value, node label name, etc. According to the node attribute of the message queue monitoring process, changing the node label field of the target file of the request node can enable the start node and current message of the persistent connection process started by the message queue monitoring process. The request nodes are kept consistent, so that the long connection process can better process the current message.
  • the node attribute of the current node is considered to be the same as the node attribute of the previous message, so there is no need to monitor the message queue
  • the node attribute of the starting node corresponding to the process is updated, the node label field in the target file corresponding to the request node is directly updated through the node attribute of the starting node, and the current message in the request node is processed through the message queue monitoring process in the starting node.
  • the message queue monitoring process determines that the request node of the current message and the request node of the previous message in the message queue are not the same node, then it is considered that the node attributes of the request node of the current message and the request node of the previous message are different, Therefore, when processing the current message, it is first necessary to update the node attributes corresponding to the startup node corresponding to the message queue monitoring process. Therefore, the message queue monitoring process takes the request node of the current message as the target parameter (input parameter), calls the corresponding system interface to access the node index area to obtain the node handle of the current message request node, and calls the corresponding system interface according to the node handle.
  • the target parameter input parameter
  • Get the node attribute of the request node of the current message and configure the startup node through the node attribute of the request node, and then update the node label field in the target file corresponding to the request node through the node attribute of the startup node to pass the message queue in the startup node
  • the monitoring process processes the current message in the request node.
  • the message queue monitoring process determines whether there is a node handle corresponding to the request node of the current message in the node index area; if it is determined that there is a node handle corresponding to the request node of the current message in the node index area, the current message is directly obtained from the node index area.
  • the node handle corresponding to the request node of the message, and the request node of the current message (which may include node attributes) according to the node handle corresponding to the request node of the current message, and configure the message queue monitoring process corresponding to the node attribute of the request node of the current message Start the node so that the message queue monitoring process can correctly process the current messages in the message queue, and improve the efficiency of message processing.
  • the request node of the current message is used as the target parameter (input parameter), and the corresponding system interface is called to create a request for the current message.
  • the node handle corresponding to the node, and the node handle is stored in the node index area. Create a node handle corresponding to the request node of the current message that does not exist in the original node index area by calling the corresponding system interface in the node index area, and continuously improve the node index area to facilitate subsequent processing of messages of the same request node, and further improve the message processing effectiveness.
  • step S240 the node label field in the target file corresponding to the requesting node is updated by the node attribute of the initiating node to process the current message in the requesting node through the message queue monitoring process in the initiating node.
  • the node label field can include node attribute value, node label name, etc. According to the node attribute of the message queue monitoring process, changing the node label field of the target file of the request node can enable the start node and current message of the persistent connection process started by the message queue monitoring process.
  • the request nodes are kept consistent, so that the long connection process can better process the current message.
  • the target file refers to the compiled code corresponding to the requested node, and the node label field is stored in the target file.
  • the message queue monitoring process can determine whether there are still messages to be processed in the message queue, and if there are still messages to be processed in the message queue, then determine whether it is allowed to obtain messages in the message queue: if the messages to be processed are allowed, then The pending messages in the message queue are processed; if acquisition is not allowed, the message queue monitoring process is terminated; if there are no messages to be processed, the message queue monitoring process can enter an infinite waiting mode until messages to be processed appear in the message queue.
  • the target parameter of the current message is obtained in the node index area and the corresponding system interface is called through the target parameter to configure the startup node through the node attribute of the request node corresponding to the current message, which breaks the request block of the prior art
  • the chain node and the blockchain node that initiates the long connection process must be defined consistently, which improves the efficiency of the long connection process in processing the message queue;
  • the file can be updated correctly even if the requesting node changes
  • the node handles of the same node can be reused, which solves the problem of limited node handle capacity.
  • FIG. 3 schematically shows a schematic diagram of a message processing flow across blockchain nodes according to some embodiments of the present disclosure, including: step S301, initiating a message queue monitoring process at the startup node in the blockchain.
  • Step S302 After the message queue monitoring process is started, the message queue monitoring process calls the corresponding system interface to create a node index area, which can be stored in the storage area of the client corresponding to the blockchain node.
  • the message queue monitoring process can determine whether there are still messages to be processed in the message queue. If there are still messages to be processed in the message queue, it is determined whether it is allowed to obtain the messages in the message queue. If the messages to be processed are allowed to be obtained, then proceed to step S304: If acquisition is not allowed, end the message queue monitoring process.
  • Step S304 the message queue monitoring process reads the current message from the message queue.
  • Step S305 The message queue monitoring process judges whether the request node of the current message and the request node of the previous message in the message queue are the same node, if it is determined that the request node of the current message and the request node of the previous message in the message queue are the same node , Proceed to step S312; if it is determined that the request node of the current message and the request node of the previous message in the message queue are not the same node, proceed to step S306.
  • the message queue monitoring process takes the request node of the current message as an input parameter, and calls the corresponding system interface to access the node index area to obtain the node attribute of the current message request node.
  • Step S307 The message queue monitoring process determines whether there is a node handle corresponding to the requesting node of the current message in the node index area; if it is determined that there is a node handle corresponding to the requesting node of the current message in the node index area, proceed to step S308; if the node index is determined If there is no node handle corresponding to the request node of the current message in the area, step S309 is performed.
  • Step S308 The message queue monitoring process obtains the node handle corresponding to the current message request node from the node index area.
  • step S309 the message queue monitoring process calls the corresponding system interface with the request node of the current message as an input parameter, and creates a node handle corresponding to the request node of the current message according to the system interface.
  • step S310 the message queue monitoring process calls the corresponding system interface to store the message node and the created node handle in the node index area.
  • step S311 the message queue monitoring process uses the node handle as an input parameter, calls the corresponding system interface to obtain the node attribute of the request node corresponding to the current message, and configures the startup node through the node attribute of the request node.
  • step S312 the system calls the message queue monitoring process to process the message, and changes the node label field of the file according to the node attribute of the startup node corresponding to the message queue monitoring process.
  • the cross-blockchain node message processing device 400 includes: the activation unit 410 is configured to activate a message queue monitoring process according to the activation node in the blockchain, and create a corresponding node index through the message queue monitoring process
  • the obtaining unit 420 is configured to obtain the current message in the message queue of the blockchain node through the message queue monitoring process;
  • the modification unit 430 is configured to obtain the target parameter of the current message according to the node index area, so as to obtain the target parameter of the current message according to the target parameter and the current message
  • the request node configures the node attributes of the message queue monitoring process;
  • the processing unit 440 is configured to update the node label field of the target file corresponding to the request node through the node attributes of the message queue monitoring process, so as to process the current message in the request node through the message queue monitoring process.
  • the obtaining unit 420 is configured to: sort the messages to be processed in the message queue according to preset rules to generate a sequence list; and obtain the current messages in the message queue in sequence according to the sequence list through the message queue monitoring process.
  • the starting unit 410 is configured to: obtain a preset system interface based on the message queue monitoring process; create a node index area according to the system interface; the node index area is configured to store the request node and request of the current message in the message queue Correspondence between node and node handle.
  • the modification unit 430 includes: a judging unit configured to judge whether the request node of the current message and the request node of the previous message in the message queue are the same node; the node attribute modification unit is configured to determine whether the request node of the current message The request node and the request node of the previous message in the message queue are the same node, and the node label field in the target file corresponding to the request node is directly updated through the node attribute of the starting node to process the request through the message queue monitoring process in the starting node The current message in the node.
  • the node attribute modification unit includes: an access unit configured to, if it is determined that the request node of the current message and the request node of the previous message in the message queue are not the same node, call the corresponding system according to the request node of the current message
  • the interface accesses the node index area to obtain the node handle corresponding to the request node; calls the corresponding system interface according to the node handle to configure the startup node through the node attributes of the request node of the current message, and update the target file corresponding to the request node through the node attributes of the startup node
  • the node label field in the node to process the current message in the requesting node by starting the message queue monitoring process in the node.
  • the cross-blockchain node message processing device 400 is configured to: determine whether there is a node handle corresponding to the request node of the current message in the node index area; if there is a node handle corresponding to the request node of the current message in the node index area Node handle, the node handle of the requesting node of the current message is obtained from the node index area to call the corresponding system interface according to the node handle to configure the startup node through the node attribute configuration of the requesting node corresponding to the current message; if there is no current message in the node index area The node handle corresponding to the request node of the current message is called by the request node of the current message to call the corresponding system interface to create the node handle corresponding to the request node of the current message and store it in the node index area.
  • the processing unit 440 is configured to determine whether there is a current message to be processed in the message queue based on the message queue monitoring process; if there is a current message in the message queue, process the current message; if there is no current message in the message queue Message, the message queue monitoring process is ended.
  • modules or units of the message processing device across blockchain nodes are mentioned in the above detailed description, this division is not mandatory.
  • the features and functions of two or more modules or units described above may be embodied in one module or unit.
  • the features and functions of a module or unit described above can be further divided into multiple modules or units to be embodied.
  • the present disclosure also provides an electronic device capable of implementing the above-mentioned cross-blockchain node message processing method.
  • the electronic device 500 according to such an embodiment of the present disclosure will be described below with reference to FIG. 5.
  • the electronic device 500 shown in FIG. 5 is only an example, and should not bring any limitation to the function and scope of use of the embodiments of the present disclosure.
  • the electronic device 500 is represented in the form of a general-purpose computing device.
  • the components of the electronic device 500 may include but are not limited to: at least one processing unit 510, at least one storage unit 520, a bus 530 connecting different system components, and a display unit 540.
  • the storage unit stores program code, and the program code can be executed by the processing unit 510, so that the processing unit 510 executes the method in the foregoing method embodiment.
  • the processing unit 510 may perform steps S210-S240 as shown in FIG. 2.
  • the storage unit 520 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 521 and/or a cache storage unit 522, and may further include a read-only storage unit (ROM) 523.
  • the storage unit 520 may also include a program/utility tool 524 having a set of (at least one) program module 525.
  • program module 525 includes but is not limited to: an operating system, one or more application programs, other program modules, and program data, Each of these examples or some combination may include the implementation of a network environment.
  • the bus 530 may represent one or more of several types of bus structures, including a storage unit bus or a storage unit controller, a peripheral bus, a graphics acceleration port, a processing unit, or a local area using any bus structure among multiple bus structures. bus.
  • the electronic device 500 may also communicate with one or more external devices 570 (such as keyboards, pointing devices, Bluetooth devices, etc.), and may also communicate with one or more devices that enable a user to interact with the electronic device 500, and/or communicate with Any device (such as a router, modem, etc.) that enables the electronic device 500 to communicate with one or more other computing devices. This communication can be performed through an input/output (I/O) interface 550.
  • the electronic device 500 may also communicate with one or more networks (for example, a local area network (LAN), a wide area network (WAN), and/or a public network, such as the Internet) through the network adapter 560.
  • the network adapter 560 communicates with other modules of the electronic device 500 through the bus 530.
  • the exemplary embodiments described here can be implemented by software, or can be implemented by combining software with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure can be embodied in the form of a software product, and the software product can be stored in a computer non-volatile readable storage medium (which can be a CD-ROM, U disk, mobile hard disk, etc.) Or on the network, several instructions are included to make a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) execute the method according to the embodiments of the present disclosure.
  • a computing device which may be a personal computer, a server, a terminal device, or a network device, etc.
  • a computer non-volatile readable storage medium on which is stored a program product capable of implementing the above-mentioned method in this specification.
  • various aspects of the present disclosure may also be implemented in the form of a program product, which includes program code.
  • the program product runs on a terminal device, the program code is used to make the terminal device execute the foregoing ⁇ Example of the method.
  • Figure 6 shows a program product 600 for implementing the above-mentioned cross-blockchain node message processing method, which can adopt a portable compact disk read-only memory (CD-ROM) and include program code, and can be used in terminal devices, such as personal On the computer, run.
  • the program product of the present disclosure is not limited thereto, and the computer non-volatile readable storage medium may also be any tangible medium that contains or stores a program, and the program may be used by or in combination with an instruction execution system, apparatus, or device.
  • the program product can adopt any combination of one or more computer non-volatile readable storage media.
  • the computer non-volatile readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: electrical connections with one or more wires, portable disks, hard disks, random access memory (RAM), read only memory (ROM), erasable Type programmable read only memory (EPROM or flash memory), optical fiber, portable compact disk read only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the above.
  • the program code for performing the operations of the present disclosure can be written in any combination of one or more programming languages.
  • the programming languages include object-oriented programming languages-such as Java, C++, etc., as well as conventional procedural programming. Language-such as "C" language or similar programming language.
  • the program code can be executed entirely on the user's computing device, partly on the user's device, executed as an independent software package, partly on the user's computing device and partly executed on the remote computing device, or entirely on the remote computing device or server Executed on.
  • the remote computing device can be connected to a user computing device through any kind of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (for example, using Internet service providers) Business to connect via the Internet).
  • LAN local area network
  • WAN wide area network
  • Internet service providers Internet service providers
  • the exemplary embodiments described here can be implemented by software, or can be implemented by combining software with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, U disk, mobile hard disk, etc.) or on the network , Including several instructions to make a computing device (which may be a personal computer, a server, a touch terminal, or a network device, etc.) execute the method according to the embodiments of the present disclosure.
  • a computing device which may be a personal computer, a server, a touch terminal, or a network device, etc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • Human Computer Interaction (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

La présente invention concerne un procédé de traitement de message destiné à un nœud entre des chaînes de blocs, un dispositif, un appareil et un support, relevant du domaine technique des ordinateurs. Le procédé comprend les étapes consistant à : lancer un processus de surveillance de file d'attente de messages en fonction d'un nœud de départ dans une chaîne de blocs et créer une zone d'index de nœuds par l'intermédiaire du processus de surveillance de file d'attente de messages ; acquérir un message actuel dans une file d'attente de messages du nœud de chaîne de blocs par l'intermédiaire du processus de surveillance de file d'attente de messages ; acquérir un paramètre cible du message actuel en fonction de la zone d'index de nœuds et appeler une interface de système en fonction du paramètre cible de façon à configurer le nœud de départ en fonction d'un attribut d'un nœud de demande correspondant au message actuel ; et mettre à jour un champ d'étiquette de nœud dans un fichier cible correspondant au nœud de demande par l'intermédiaire de l'attribut du nœud de départ de manière à traiter le message actuel dans le nœud de demande par l'intermédiaire du processus de surveillance de file d'attente de messages dans le nœud de départ. La solution technique du mode de réalisation de la présente invention peut mettre à jour correctement le champ d'étiquette de nœud du fichier lorsque le nœud de demande est modifié, ce qui accroît l'efficacité de traitement de message du long processus de connexion.
PCT/CN2019/118085 2019-08-02 2019-11-13 Procédé de traitement de message destiné à un nœud entre des chaînes de blocs, dispositif, appareil et support WO2021022714A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910713843.9A CN110609755A (zh) 2019-08-02 2019-08-02 跨区块链节点的消息处理方法及装置、设备、介质
CN201910713843.9 2019-08-02

Publications (1)

Publication Number Publication Date
WO2021022714A1 true WO2021022714A1 (fr) 2021-02-11

Family

ID=68890909

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/118085 WO2021022714A1 (fr) 2019-08-02 2019-11-13 Procédé de traitement de message destiné à un nœud entre des chaînes de blocs, dispositif, appareil et support

Country Status (2)

Country Link
CN (1) CN110609755A (fr)
WO (1) WO2021022714A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11212371B2 (en) * 2018-12-25 2021-12-28 Advanced New Technologies Co., Ltd. Operation request allocation methods, apparatuses, and devices

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111510484B (zh) * 2020-04-10 2023-07-04 金蝶软件（中国）有限公司 区块链处理方法、系统、装置、计算机设备和存储介质
CN111967229A (zh) * 2020-09-01 2020-11-20 申建常 一种高效标签式数据分析方法及分析系统
CN111934990B (zh) * 2020-09-25 2021-02-09 支付宝(杭州)信息技术有限公司 消息传输方法及装置
CN111930443B (zh) * 2020-10-15 2020-12-18 杭州云链趣链数字科技有限公司 基于区块链的运维方法、系统、计算机设备和存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107609010A (zh) * 2017-07-27 2018-01-19 北京瑞卓喜投科技发展有限公司 基于区块链技术的信息处理方法和装置
CN107632893A (zh) * 2016-08-11 2018-01-26 泰康保险集团股份有限公司 消息队列处理方法及装置
CN108415784A (zh) * 2018-02-27 2018-08-17 阿里巴巴集团控股有限公司 跨区块链的交互方法及装置、系统、电子设备
US20190197130A1 (en) * 2017-12-21 2019-06-27 Microsoft Technology Licensing, Llc Ensuring consistency in distributed incremental content publishing
CN109995666A (zh) * 2019-04-12 2019-07-09 深圳市元征科技股份有限公司 一种消息传输方法及相关装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108985757B (zh) * 2017-11-27 2021-03-30 京东数字科技控股有限公司 信息处理方法、装置及系统、存储介质、电子设备
CN109634800A (zh) * 2018-10-19 2019-04-16 深圳平安财富宝投资咨询有限公司 数据处理方法、系统、终端及可读存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107632893A (zh) * 2016-08-11 2018-01-26 泰康保险集团股份有限公司 消息队列处理方法及装置
CN107609010A (zh) * 2017-07-27 2018-01-19 北京瑞卓喜投科技发展有限公司 基于区块链技术的信息处理方法和装置
US20190197130A1 (en) * 2017-12-21 2019-06-27 Microsoft Technology Licensing, Llc Ensuring consistency in distributed incremental content publishing
CN108415784A (zh) * 2018-02-27 2018-08-17 阿里巴巴集团控股有限公司 跨区块链的交互方法及装置、系统、电子设备
CN109995666A (zh) * 2019-04-12 2019-07-09 深圳市元征科技股份有限公司 一种消息传输方法及相关装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11212371B2 (en) * 2018-12-25 2021-12-28 Advanced New Technologies Co., Ltd. Operation request allocation methods, apparatuses, and devices

Also Published As

Publication number Publication date
CN110609755A (zh) 2019-12-24

Similar Documents

Publication Publication Date Title
WO2021022714A1 (fr) Procédé de traitement de message destiné à un nœud entre des chaînes de blocs, dispositif, appareil et support
US10467232B2 (en) Searching documentation across interconnected nodes in a distributed network
US7716061B2 (en) Method and apparatus for obtaining status information in a grid
US20210149687A1 (en) Methods for processing mini program, and related devices
KR101618476B1 (ko) 휴대용 컴퓨팅 디바이스에서 분산 리소스 관리
WO2021238271A1 (fr) Procédé et appareil de création d'application basée sur un nuage de conteneurs, dispositif électronique et support d'enregistrement
US11237888B2 (en) Message processing method and system, storage medium and electronic device
JP4233635B2 (ja) アプリケーション・インタフェースに持続性を提供するための装置および方法
WO2021022710A1 (fr) Procédé de traitement de file d'attente de messages, dispositif, appareil électronique et support d'informations non volatile lisible par ordinateur
JP2017535842A (ja) データソースからデータターゲットにデータを転送するためのインポート手順の呼出しの単純化
CN112506854B (zh) 页面模板文件的存储和页面生成方法、装置、设备及介质
CN113448756B (zh) 一种进程间通信系统、方法及计算设备
CN112395107A (zh) 税控设备控制的方法、装置、存储介质及电子设备
US20220012050A1 (en) Mini program batch processing method and apparatus, electronic device, and readable storage medium
JP4336363B2 (ja) ビジネスプロセス実行方法、ビジネスプロセス実行システムおよびプログラム
CN111694620A (zh) 第三方业务的交互方法、装置、设备及计算机存储介质
CN114726789A (zh) 流量管理、配置流量管理策略的方法、装置、设备及介质
EP2751687B1 (fr) Procédé et système de gestion de demandes de ressources parallèles dans un dispositif de calcul portable
WO2023169193A1 (fr) Procédé et dispositif de génération de contrat intelligent
US12001458B2 (en) Multi-cloud object store access
EP3995973A2 (fr) Procédé, appareil et support pour le déplacement de fichiers
CN107632893B (zh) 消息队列处理方法及装置
CN115145652A (zh) 一种数据处理任务的创建方法、装置、设备及介质
WO2021232860A1 (fr) Procédé, appareil et système de communication
WO2021243665A1 (fr) Procédé de compilation, appareil de compilation, système de compilation, support de stockage et dispositif électronique

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: 19940638

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: 19940638

Country of ref document: EP

Kind code of ref document: A1