CN111209336A

CN111209336A - Data distribution method and device based on block chain and server

Info

Publication number: CN111209336A
Application number: CN201911400652.3A
Authority: CN
Inventors: 殷建文; 倪向东
Original assignee: Guangzhou Doctor Information Technology Research Institute Co ltd
Current assignee: Guangzhou Doctor Information Technology Research Institute Co ltd
Priority date: 2019-12-30
Filing date: 2019-12-30
Publication date: 2020-05-29
Anticipated expiration: 2039-12-30
Also published as: CN111209336B

Abstract

The invention relates to the technical field of data processing, in particular to a data distribution method and device based on a block chain and a server. The data distribution method and the data distribution system fully consider the data distribution item difference between the first distribution strategy of the data service corresponding to the data to be distributed and the second distribution strategy of the block chain service corresponding to the block chain system, and when the data distribution item difference is not in the difference range of the set distribution items, after the node distribution control parameters of the block chain service aiming at the data distribution item difference are further determined according to the data distribution item difference, the target data distribution nodes for distributing the data to be distributed and the distribution control flow parameters aiming at each target data distribution node are determined, so that the data distribution operation is performed on the data to be distributed. The invention can avoid the condition that the user possibly masters a large amount of weights to cause great irrationality to the final data distribution, reduce the waste of computing resources in the subsequent verification process and improve the operation efficiency of the actual data service.

Description

Data distribution method and device based on block chain and server

Technical Field

The invention relates to the technical field of data processing, in particular to a data distribution method and device based on a block chain and a server.

Background

In a blockchain system, a data allocation policy of the blockchain system is usually configured for one unified blockchain service, and in an actual service scenario, corresponding data allocation policies are also configured for different data services, which results in that when data are specifically allocated, because the data allocation policies are not unified, the allocation policies of the data services are often referred to according to differences between the data allocation policies and the data services, at this time, users of some data services may master a large amount of weights, resulting in extreme irrationality in final data allocation, and may cause extreme waste of computing resources in a subsequent verification process due to inaccuracy of over-allocation, and cause delay influence on actual data services.

Disclosure of Invention

In order to overcome at least the above-mentioned deficiencies in the prior art, the present application aims to provide a data allocation method, device and server based on a block chain, which can avoid the situation that a user of some data services may master a large number of weights to cause great irrationality in final data allocation, reduce the waste of computing resources in the subsequent verification process, and improve the operation efficiency of actual data services.

In a first aspect, the present application provides a data distribution method based on a block chain, which is applied to a server, where the server is communicatively connected to at least one data distribution node, and the method includes:

acquiring a first allocation strategy of a data service corresponding to data to be allocated in a current blockchain system and a second allocation strategy of a blockchain service corresponding to the blockchain system;

comparing the data allocation item difference between the first allocation policy and the second allocation policy;

when the data distribution item difference is not in the difference range of the set distribution item, determining a node distribution control parameter of the block chain service aiming at the data distribution item difference according to the data distribution item difference;

determining target data distribution nodes for distributing the data to be distributed and distribution control flow parameters aiming at each target data distribution node according to the node distribution control parameters;

and executing data distribution operation on the data to be distributed according to the determined target data distribution nodes and the distribution control flow parameters aiming at each target data distribution node.

In one possible design of the first aspect, the determining, according to the data allocation item difference, a node allocation control parameter of the blockchain service for the data allocation item difference includes:

acquiring a current block chain link point sequence corresponding to the data distribution item difference from the block chain service according to the data distribution item difference;

calculating a first sub-expression distribution space where the current block chain link point sequence is located according to an initial node distribution control model, expanding the range of the first sub-expression distribution space, obtaining a second sub-expression distribution space where the current block chain link point sequence is located, and taking the second sub-expression distribution space as an initial distribution expression region of the next block chain link point sequence;

taking the next block chain link point sequence as the current block chain link point sequence, updating the initial node distribution control model to obtain an updated node distribution control model, dividing an initial distribution expression region corresponding to the current block chain link point sequence according to the updated node distribution control model to obtain an initial distribution expression region corresponding to the next block chain link point sequence, and obtaining an expression distribution result until all the block chain nodes in the block chain link point sequence are completely distributed;

calculating corresponding expression distribution coefficients according to initial distribution control parameters, the distribution times of each block chain link point in the block chain link point sequence, the accumulated times of each block chain node and the expression parameters of the initial distribution expression region;

and outputting the expression distribution coefficients, the expression distribution results and sequence parameters of the block chain link point sequences as the node distribution control parameters of the data distribution project difference.

In a possible design of the first aspect, the step of calculating a corresponding expression allocation coefficient according to an initial allocation control parameter, the number of times each block link point in the block link point sequence is allocated, the cumulative number of times each block link node is allocated, and an expression parameter of the initially allocated expression region includes:

acquiring a plurality of distribution control nodes according to the initial distribution control parameters, and acquiring a node expression parameter value of each distribution control node in the plurality of distribution control nodes;

acquiring the distribution control sequence expression information of each distribution control node according to the node expression parameter value of each distribution control node and the distribution control sequence range value of each distribution control node before distribution control, wherein the distribution control sequence expression information comprises the distribution control sequence range value and the distribution times and the accumulation times of each corresponding block chain link point;

calculating to obtain an initial value of a distribution control interval of each distribution control node according to the distribution control type of each distribution control node and the distribution control sequence range value of each distribution control node;

inquiring an allocation control information table to obtain target node expression parameters of the plurality of allocation control nodes according to the initial value of the allocation control interval of each allocation control node and the corresponding allocation times and accumulated times of each block link point;

determining expression parameter balance values between target node expression parameters of the distribution control nodes and expression parameters of the initial distribution expression region to obtain a plurality of expression parameter balance values;

calculating expression distribution results of a plurality of expression parameter balance values and corresponding expression distribution control parameters, and processing the expression distribution control parameters according to distribution process information in the expression distribution results to obtain a plurality of expression distribution control parameter sets; sequentially extracting expression distribution association processes in the expression distribution control parameter sets, taking expression association units in the expression distribution association processes as expression distribution units, and respectively and sequentially generating expression distribution sequences corresponding to the expression distribution units according to the expression distribution association processes;

matching the correlation strength between each expression correlation unit in the expression distribution correlation process with each expression distribution sequence, wherein the correlation strength corresponds to the sequence length of the expression distribution sequence;

setting corresponding expression distribution association nodes for each expression distribution sequence according to the association strength matched with each expression distribution sequence, performing expression association fusion on the expression distribution sequences provided with the expression distribution association nodes according to the expression distribution association process, and fusing the expression distribution sequences subjected to the expression association fusion into corresponding expression distribution models according to the category of an expression distribution control parameter set corresponding to the expression distribution sequences subjected to the expression association fusion to obtain target expression distribution models;

and combining the expression distribution coefficients of each target expression distribution model to obtain corresponding expression distribution coefficients.

In one possible design of the first aspect, the step of outputting the expression allocation coefficient, the expression allocation result, and a sequence parameter of a block link point sequence as the node allocation control parameter of the data allocation item difference includes:

performing node assignment on each expression distribution node in the expression distribution result according to the expression distribution coefficient, determining a node distribution flow of each expression distribution node, and acquiring a flow configuration file of the expression distribution node according to the node distribution flow;

determining father node control configuration information of the expression distribution nodes according to the process configuration file, searching child node control configuration information corresponding to the expression distribution nodes based on the father node control configuration information, and combining each expression distribution node into at least one node control process according to the child node control configuration information;

extracting expression distribution adjusting parameters corresponding to each node control flow and used for representing expression distribution of each node control flow from the expression distribution nodes based on each node control flow;

determining control calling information of each node control flow when the expression distribution node is controlled according to the expression distribution regulation parameters, and splicing each node control flow according to the expression distribution regulation logic relation of each control calling information to obtain a spliced polling flow team;

extracting corresponding process node service information according to the process nodes on the spliced polling process team, grouping the process node service information according to different service types, calculating a process node service information identifier of each service type, and selecting a process node service matching node according to the process node service information identifier;

when an analysis instruction for analyzing a node distribution control parameter is generated in the process node service information according to the process node service matching node, a node distribution control index file corresponding to the process node service matching node is obtained according to the analysis instruction;

generating an index coding space for recording the node allocation control index file, mapping the node allocation control index file to the index coding space, and setting the allocation state of the node allocation control index file according to the service type of the process node service information;

judging whether the process node service information is in a state of executing the node distribution control parameter according to the distribution state, and determining at least one analysis parameter and an analysis logic process for analyzing the node distribution control parameter according to the analysis instruction when the process node service information is not in the state of executing the node distribution control parameter;

and analyzing the node distribution control parameter according to the at least one analysis parameter and the analysis logic flow.

In a possible design of the first aspect, the step of determining, according to the node allocation control parameter, a target data allocation node to allocate the data to be allocated and an allocation control flow parameter for each target data allocation node includes:

according to the node distribution control parameters, index searching is carried out on each data distribution node related to the data to be distributed, and distribution business behaviors corresponding to the data to be distributed are determined;

determining a data distribution node queue according to the distribution business behavior, extracting behavior expression data of the distribution business behavior, taking a set threshold value as a distribution business index area, and extracting a behavior expression set of the behavior expression data associated with the data distribution node queue;

generating a plurality of logic association sections for expression logic blocks in the behavior expression nodes according to a logic association relation according to at least two associated behavior expression nodes in the behavior expression set, calculating expression logic differences between all expression logic blocks in the next behavior expression node and all expression logic blocks in the previous behavior expression node, and obtaining a corresponding logic association relation table according to each obtained expression logic difference;

according to the logic association relation table, acquiring a logic association section which is matched in logic expression relation and has the expression logic difference between each expression logic block of the two logic association sections smaller than the maximum continuous expression logic difference of the distributed business behavior in the expression logic difference to form an expression node space;

allocating nodes in each behavior expression node space to obtain an allocated interval of each allocated behavior expression node space, generating a corresponding allocated service behavior space according to the behavior expression data, and indexing the allocated service behavior space to obtain allocated intervals of a plurality of index nodes;

matching according to the distribution interval on the behavior expression node space and the distribution interval of the index node on the distribution service behavior space to obtain an expression logic matching interval;

and determining target data distribution nodes for distributing the data to be distributed and distribution control flow parameters aiming at each target data distribution node from the expression logic matching interval.

In a possible design of the first aspect, the step of performing, according to the determined target data distribution node and the distribution control flow parameter for each target data distribution node, a data distribution operation on the data to be distributed includes: generating a distribution path and distribution identification information when the target data distribution node distributes the corresponding distribution control flow parameters according to the determined target data distribution node;

performing channel identification processing on an allocation channel corresponding to the data to be allocated to obtain a plurality of channel identification fields, determining allocation identification parameters corresponding to each channel identification field, and determining a corresponding allocation identification space according to the allocation identification parameters; identifying the distribution path and the distribution identification information to the distribution identification space to obtain distribution identification parameters, determining distribution logic association strength between the distribution identification parameters and each distribution identification parameter in the distribution identification space, and determining path mapping parameters of the distribution identification parameters according to the distribution path of the distribution identification parameters corresponding to the maximum value of the distribution logic association strength;

determining a node distribution sequence and a node distribution logic relationship according to the path mapping parameters, and determining distribution mapping path priority parameters of each distribution mapping path in the node distribution sequence and distribution mapping strategy priority parameters of each distribution mapping strategy in the node distribution logic relationship according to the obtained node distribution sequence and the node distribution logic relationship;

obtaining the priority parameters of the distribution mapping paths and the priority coincidence results of the priority parameters of the distribution mapping strategies according to the priority parameters of the distribution mapping paths in the node distribution sequence and the priority parameters of the distribution mapping strategies in the node distribution logic relationship, and generating distribution mapping blocks for representing the priority coincidence results of the distribution mapping strategies and the distribution mapping paths according to the priority coincidence results;

determining an access queue of the node allocation sequence and the node allocation logical relationship according to each allocation mapping block, determining a first allocation queue of allocation tasks corresponding to each allocation task of the access queue in the node allocation sequence according to association parameters of association items of the allocation tasks corresponding to each allocation task of the access queue in the node allocation sequence, and determining a second allocation queue of allocation tasks corresponding to each allocation task of the access queue in the node allocation logical relationship according to node allocation logical relationship parameters of allocation tasks corresponding to each allocation task of the access queue in the node allocation logical relationship;

and executing data distribution operation on the data to be distributed according to the first distribution queue and the second distribution queue of each distribution task of the access queue.

In one possible design of the first aspect, the method further includes:

and updating a first allocation strategy of a data service and a second allocation strategy of the block chain service according to the data allocation operation result of the data to be allocated.

In a second aspect, an embodiment of the present application further provides a data distribution apparatus based on a block chain, where the data distribution apparatus is applied to a server, and the server is communicatively connected to at least one data distribution node, where the apparatus includes:

the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a first allocation strategy of a data service corresponding to data to be allocated in a current blockchain system and a second allocation strategy of a blockchain service corresponding to the blockchain system;

a comparison module for comparing the data allocation item difference between the first allocation policy and the second allocation policy;

a first determining module, configured to determine, according to the data allocation item difference, a node allocation control parameter of the blockchain service for the data allocation item difference when the data allocation item difference is not within a difference range of a set allocation item;

a second determining module, configured to determine, according to the node allocation control parameter, a target data allocation node to which the data to be allocated is allocated and an allocation control flow parameter for each target data allocation node;

and the data distribution module is used for executing data distribution operation on the data to be distributed according to the determined target data distribution nodes and the distribution control flow parameters aiming at each target data distribution node.

In a third aspect, an embodiment of the present application further provides a server, where the server includes a processor, a machine-readable storage medium, and a network interface, where the machine-readable storage medium, the network interface, and the processor are connected through a bus system, the network interface is configured to be communicatively connected to at least one data distribution node, the machine-readable storage medium is configured to store a program, an instruction, or code, and the processor is configured to execute the program, the instruction, or the code in the machine-readable storage medium to perform the method for data distribution based on a block chain in any one of the possible designs of the first aspect or the first aspect.

In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, where instructions are stored in the computer-readable storage medium, and when the instructions are detected on a computer, the instructions cause the computer to perform the block chain based data allocation method in the first aspect or any one of the possible designs of the first aspect.

Based on any one of the above aspects, the present application fully considers the data allocation item difference between the first allocation policy of the data service corresponding to the data to be allocated and the second allocation policy of the blockchain service corresponding to the blockchain system, and when the data allocation item difference is not within the difference range of the set allocation item, after further determining the node allocation control parameter of the blockchain service for the data allocation item difference according to the data allocation item difference, determines the target data allocation node to which the data to be allocated is allocated and the allocation control flow parameter for each target data allocation node, thereby performing a data allocation operation on the data to be allocated. Therefore, the situation that the final data distribution generates great irrationality due to the fact that some data service users possibly master a large number of weights can be avoided, the waste of computing resources in the subsequent verification process is reduced, and the operation efficiency of the actual data service is improved.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.

Fig. 1 is a schematic application scenario diagram of a data distribution system based on a block chain according to an embodiment of the present application;

fig. 2 is a schematic flowchart of a block chain-based data allocation method according to an embodiment of the present disclosure;

FIG. 3 is a flowchart illustrating the sub-steps included in step S130 shown in FIG. 2;

fig. 4 is a second flowchart of a data allocation method based on a block chain according to an embodiment of the present application;

fig. 5 is a functional block diagram of a data distribution apparatus based on a block chain according to an embodiment of the present application;

fig. 6 is a block diagram schematically illustrating a structure of a server for implementing the above data distribution method based on a block chain according to an embodiment of the present application.

Detailed Description

The present application will now be described in detail with reference to the drawings, and the specific operations in the method embodiments may also be applied to the apparatus embodiments or the system embodiments. In the description of the present application, "at least one" includes one or more unless otherwise specified. "plurality" means two or more. For example, at least one of A, B and C, comprising: a alone, B alone, a and B in combination, a and C in combination, B and C in combination, and A, B and C in combination. In this application, "/" means "or, for example, A/B may mean A or B; "and/or" herein is merely an association describing an association of devices, meaning that there may be three relationships, e.g., a and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone.

Fig. 1 is an interaction diagram of a block chain-based data distribution system 10 according to an embodiment of the present application. The blockchain-based data distribution system 10 may include a server 100 and a data distribution node 200 communicatively coupled to the server 100, and the server 100 may include a processor therein to perform instruction operations. The blockchain-based data distribution system 10 shown in fig. 1 is only one possible example, and in other possible embodiments, the blockchain-based data distribution system 10 may also include only a portion of the components shown in fig. 1 or may also include other components.

In some embodiments, the server 100 may be a single server or a group of servers. The set of operating servers may be centralized or distributed (e.g., the server 100 may be a distributed system). In some embodiments, the server 100 may be local or remote to the data distribution node 200. For example, the server 100 may access information stored in the data distribution node 200 and a database, or any combination thereof, via a network. As another example, the server 100 may be directly connected to at least one of the data distribution node 200 and a database to access information and/or data stored therein. In some embodiments, the server 100 may be implemented on a cloud platform; by way of example only, the cloud platform may include a private cloud, a public cloud, a hybrid cloud, a community cloud (community cloud), a distributed cloud, an inter-cloud, a multi-cloud, and the like, or any combination thereof.

In some embodiments, the server 100 may include a processor. The processor may process information and/or data related to the service request to perform one or more of the functions described herein. A processor may include one or more processing cores (e.g., a single-core processor (S) or a multi-core processor (S)). Merely by way of example, a Processor may include a Central Processing Unit (CPU), an Application Specific Integrated Circuit (ASIC), an Application Specific Instruction Set Processor (ASIP), a Graphics Processing Unit (GPU), a Physical Processing Unit (PPU), a Digital Signal Processor (DSP), a Field Programmable Gate Array (FPGA), a Programmable Logic Device (PLD), a controller, a microcontroller Unit, a reduced Instruction Set computer (reduced Instruction Set computer), a microprocessor, or the like, or any combination thereof.

The network may be used for the exchange of information and/or data. In some embodiments, one or more components (e.g., server 100, data distribution node 200, and a database) in blockchain-based data distribution system 10 may send information and/or data to other components. In some embodiments, the network may be any type of wired or wireless network, or combination thereof. Merely by way of example, Network 130 may include a wired Network, a Wireless Network, a fiber optic Network, a telecommunications Network, an intranet, the internet, a Local Area Network (LAN), a Wide Area Network (WAN), a Wireless Local Area Network (WLAN), a WLAN, a Metropolitan Area Network (MAN), a Wide Area Network (WAN), a Public Switched Telephone Network (PSTN), a bluetooth Network, a ZigBee Network, a Near Field Communication (NFC) Network, or the like, or any combination thereof. In some embodiments, the network may include one or more network access points. For example, the network may include wired or wireless network access points, such as base stations and/or network switching nodes, through which one or more components of the blockchain-based data distribution system 10 may connect to the network to exchange data and/or information.

The aforementioned database may store data and/or instructions. In some embodiments, a database may store data distributed to the data distribution node 200. In some embodiments, the database may store data and/or instructions for the exemplary methods described herein. In some embodiments, the database may include mass storage, removable storage, volatile Read-write Memory, or Read-Only Memory (ROM), among others, or any combination thereof. By way of example, mass storage may include magnetic disks, optical disks, solid state drives, and the like; removable memory may include flash drives, floppy disks, optical disks, memory cards, zip disks, tapes, and the like; volatile read-write memory may include Random Access Memory (RAM); the RAM may include Dynamic RAM (DRAM), Double data Rate Synchronous Dynamic RAM (DDR SDRAM); static RAM (SRAM), Thyristor-Based Random Access Memory (T-RAM), Zero-capacitor RAM (Zero-RAM), and the like. By way of example, ROMs may include Mask Read-Only memories (MROMs), Programmable ROMs (PROMs), Erasable Programmable ROMs (PERROMs), Electrically Erasable Programmable ROMs (EEPROMs), compact disk ROMs (CD-ROMs), digital versatile disks (ROMs), and the like. In some embodiments, the database may be implemented on a cloud platform. By way of example only, the cloud platform may include a private cloud, a public cloud, a hybrid cloud, a community cloud, a distributed cloud, across clouds, multiple clouds, or the like, or any combination thereof.

In some embodiments, a database may be connected to a network to communicate with one or more components in the blockchain based data distribution system 10 (e.g., server 100, data distribution node 200, etc.). One or more components in blockchain-based data distribution system 10 may access data or instructions stored in a database via a network. In some embodiments, the database may be directly connected to one or more components of the blockchain based data distribution system 10 (e.g., the server 100, the data distribution node 200, etc.; or, in some embodiments, the database may be part of the server 100.

To solve the technical problem in the foregoing background, fig. 2 is a schematic flowchart of a block chain-based data allocation method according to an embodiment of the present disclosure, where the block chain-based data allocation method according to the present disclosure may be executed by the server 100 shown in fig. 1, and the block chain-based data allocation method is described in detail below.

Step S110 is to obtain a first allocation policy of a data service corresponding to data to be allocated in the current blockchain system and a second allocation policy of a blockchain service corresponding to the blockchain system.

Step S120, comparing the data allocation item difference between the first allocation policy and the second allocation policy.

And step S130, when the data distribution item difference is not in the difference range of the set distribution item, determining the node distribution control parameter of the block chain service aiming at the data distribution item difference according to the data distribution item difference.

Step S140, determining target data distribution nodes to be distributed and distribution control flow parameters for each target data distribution node according to the node distribution control parameters.

Step S150, according to the determined target data distribution node and the distribution control flow parameter for each target data distribution node, performing a data distribution operation on the data to be distributed.

Based on the above design, in this embodiment, a difference of data allocation items between a first allocation policy of a data service corresponding to the data to be allocated and a second allocation policy of a blockchain service corresponding to the blockchain system is fully considered, and when the difference of the data allocation items is not within a difference range of the set allocation items, after node allocation control parameters of the blockchain service for the difference of the data allocation items are further determined according to the difference of the data allocation items, a target data allocation node to which the data to be allocated is allocated and an allocation control flow parameter for each target data allocation node are determined, so that a data allocation operation is performed on the data to be allocated. Therefore, the situation that the final data distribution generates great irrationality due to the fact that some data service users possibly master a large number of weights can be avoided, the waste of computing resources in the subsequent verification process is reduced, and the operation efficiency of the actual data service is improved.

In a possible design, for step S130, in order to further avoid the situation that the user of some data services may grasp a large amount of weights to cause great irrationality to the final data allocation, please refer to fig. 3, step S130 may specifically include the following sub-steps to further implement:

in the substep S131, a current sequence of block chain nodes corresponding to the data allocation item difference is obtained from the block chain service according to the data allocation item difference.

And a substep S132, calculating a first sub-expression distribution space where the current block chain link point sequence is located according to the initial node distribution control model, expanding the range of the first sub-expression distribution space, obtaining a second sub-expression distribution space where the current block chain link point sequence is located, and taking the second sub-expression distribution space as an initial distribution expression region of the next block chain link point sequence.

And a substep S133, taking the next block link point sequence as the current block link point sequence, updating the initial node distribution control model to obtain an updated node distribution control model, dividing the initial distribution expression region corresponding to the current block link point sequence according to the updated node distribution control model to obtain the initial distribution expression region corresponding to the next block link point sequence, and obtaining an expression distribution result until all the block link nodes in the block link point sequence are completely distributed.

And a substep S134, calculating corresponding expression distribution coefficients according to the initial distribution control parameters, the distribution times of each block chain link point in the block chain link point sequence, the cumulative times of each block chain node and the expression parameters of the initial distribution expression region.

In the substep S135, the expression allocation coefficient, the expression allocation result, and the sequence parameter of the block link point sequence are output as the node allocation control parameter of the data allocation item difference.

Based on the above design, the present embodiment changes the result of the node allocation control parameter by changing the range of the sub-expression allocation space during allocation, and makes the node allocation control model more capable of describing the data characteristics of data allocation project differences by continuously updating the node allocation control model, so as to further avoid the situation that a user of some data services may master a large amount of weights to cause great irrationality in final data allocation.

In one possible design, for sub-step S134, a plurality of allocation control nodes may be obtained according to the initial allocation control parameter, and a node expression parameter value of each allocation control node in the plurality of allocation control nodes is obtained, and then allocation control sequence expression information of each allocation control node is obtained according to the node expression parameter value of each allocation control node and an allocation control sequence range value before allocation control of each allocation control node, where the allocation control sequence expression information includes the allocation control sequence range value and the number of times and the cumulative number of times of allocation of each corresponding block link point.

Then, an initial value of the allocation control interval of each allocation control node can be calculated according to the allocation control type of each allocation control node and the allocation control sequence range value of each allocation control node.

Then, the allocation control information table may be queried to obtain target node expression parameters of the plurality of allocation control nodes according to the initial value of the allocation control interval of each allocation control node and the number of times and the cumulative number of times of allocation of each corresponding block link node.

Then, expression parameter balance values between the target node expression parameters of the plurality of allocation control nodes and the expression parameters of the initial allocation expression region can be determined, so as to obtain a plurality of expression parameter balance values.

Then, expression allocation results of the expression parameter balance values and corresponding expression allocation control parameters can be calculated, and the expression allocation control parameters are processed according to allocation flow information in the expression allocation results to obtain a plurality of expression allocation control parameter sets.

Then, the expression allocation associated processes in the plurality of expression allocation control parameter sets may be sequentially extracted, and the expression associated units in the plurality of expression allocation associated processes may be used as expression allocation units, and the expression allocation sequence corresponding to each expression allocation unit may be sequentially generated according to the expression allocation associated processes.

The strength of association between each expression association unit in the expression assignment association process can then be matched to each expression assignment sequence, respectively, the strength of association corresponding to the sequence length of the expression assignment sequence.

Then, a corresponding expression distribution association node may be set for each expression distribution sequence according to the association strength matched with each expression distribution sequence, expression association fusion may be performed on the expression distribution sequences with the expression distribution association nodes set according to the expression distribution association process, and the expression distribution sequences with the expression association fusion completed may be fused to the corresponding expression distribution model according to the category of the expression distribution control parameter set corresponding to the expression distribution sequence with the expression association fusion completed, so as to obtain a target expression distribution model.

Then, the expression distribution coefficients of each target expression distribution model may be combined to obtain a corresponding expression distribution coefficient.

Based on the above design, the present embodiment may determine the expression allocation coefficient according to the expression allocation process, and may further avoid a situation that some users of the data service may master a large amount of weights to cause great irrationality in final data allocation.

In a possible design, for step S135, node assignment may be specifically performed on each expression distribution node in the expression distribution result according to the expression distribution coefficient, a node distribution flow of each expression distribution node is determined, and a flow configuration file of the expression distribution node is obtained according to the node distribution flow.

Then, the father node control configuration information of the expression allocation nodes can be determined according to the process configuration file, the child node control configuration information corresponding to the expression allocation nodes is found out based on the father node control configuration information, and each expression allocation node is combined into at least one node control process according to the child node control configuration information.

Then, an expression allocation regulation parameter corresponding to each node control flow and used for representing expression allocation of each node control flow can be extracted from the expression allocation nodes based on each node control flow.

And then, determining control calling information of each node control flow when controlling the expression distribution nodes according to the expression distribution regulation parameters, and splicing each node control flow according to the expression distribution regulation logic relation of each control calling information to obtain a spliced polling flow team.

Then, corresponding process node service information can be extracted according to the process nodes on the splicing polling process team, the process node service information is grouped according to different service types, a process node service information identifier of each service type is calculated, and a process node service matching node is selected according to the process node service information identifier.

Then, when an analysis instruction for analyzing the node allocation control parameter is generated in the process node service information according to the process node service matching node, a node allocation control index file corresponding to the process node service matching node is obtained according to the analysis instruction.

Then, an index coding space for recording the node allocation control index file may be generated, the node allocation control index file is mapped to the index coding space, and the allocation state of the node allocation control index file is set according to the service type of the process node service information.

Then, it can be determined whether the process node service information is in a state of executing node allocation control parameters according to the allocation state, and when the process node service information is not in a state of executing node allocation control parameters, at least one analysis parameter for analyzing the node allocation control parameters and an analysis logic process are determined according to the analysis instruction.

Next, the node allocation control parameter may be parsed from the at least one parsing parameter and the parsing logic flow.

In a possible design, for step S140, in order to improve the accuracy of the process allocation, an index search may be performed on each data allocation node 200 related to the data to be allocated according to the node allocation control parameter, so as to determine an allocation service behavior corresponding to the data to be allocated.

Then, the data distribution node 200 queue may be determined according to the distribution service behavior, and the behavior expression data of the distribution service behavior may be extracted, and the behavior expression set of the data distribution node 200 queue associated with the behavior expression data may be extracted with the set threshold as the distribution service index region.

Then, according to at least two behavior expression nodes associated in the behavior expression set, a plurality of logic association segments are generated by expression logic blocks in the behavior expression nodes according to a logic association relationship, expression logic differences between all expression logic blocks in the next behavior expression node and all expression logic blocks in the previous behavior expression node are calculated, and a corresponding logic association relationship table is obtained according to each obtained expression logic difference.

Then, according to the logic association relationship table, a logic association segment is obtained, wherein the logic expression relationship is matched with each other, and the expression logic difference between each expression logic block of the two logic association segments is smaller than the maximum continuous expression logic difference of the distributed business behavior in the expression logic difference, so that an expression node space is formed.

Then, the nodes in each behavior expression node space can be distributed to obtain a distribution interval of each distributed behavior expression node space, a corresponding distribution business behavior space is generated according to the behavior expression data, and the distribution business behavior space is indexed to obtain distribution intervals of a plurality of index nodes.

Then, matching can be performed according to the distribution interval on the behavior expression node space and the distribution interval of the index node on the distribution business behavior space to obtain an expression logic matching interval.

Next, target data allocation nodes to be allocated with data and allocation control flow parameters for each target data allocation node may be determined from the expression logic matching interval.

In a possible design, in step S150, in the allocation process, specifically, according to the determined target data allocation node, an allocation path and allocation identification information when the target data allocation node allocates the corresponding allocation control flow parameter may be generated.

Then, the channel identification processing may be performed on the allocation channel corresponding to the data to be allocated to obtain a plurality of channel identification fields, and an allocation identification parameter corresponding to each channel identification field is determined, and a corresponding allocation identification space is determined according to the allocation identification parameter.

Then, the allocation path and the allocation identification information may be identified to an allocation identification space to obtain an allocation identification parameter, and an allocation logic association strength between the allocation identification parameter and each allocation identification parameter in the allocation identification space is determined, and a path mapping parameter of the allocation identification parameter is determined according to the allocation path of the allocation identification parameter corresponding to the maximum value of the allocation logic association strength.

Then, a node allocation sequence and a node allocation logic relationship can be determined according to the path mapping parameters, and an allocation mapping path priority parameter of each allocation mapping path in the node allocation sequence and an allocation mapping policy priority parameter of each allocation mapping policy in the node allocation logic relationship are determined according to the obtained node allocation sequence and node allocation logic relationship.

Then, according to the priority parameter of each allocation mapping path in the node allocation sequence and the priority parameter of each allocation mapping strategy in the node allocation logic relationship, the priority parameter of each allocation mapping path and the priority coincidence result between the priority parameters of the allocation mapping strategies of each allocation mapping path are obtained, and according to the priority coincidence result, an allocation mapping block for representing the priority coincidence result between each allocation mapping strategy and each allocation mapping path is generated.

Then, an access queue of the node allocation sequence and the node allocation logical relationship may be determined according to each allocation mapping block, a first allocation queue of allocation tasks corresponding to each allocation task of the access queue in the node allocation sequence may be determined according to association parameters of association items of the allocation tasks corresponding to each allocation task of the access queue in the node allocation sequence, and a second allocation queue of allocation tasks corresponding to each allocation task of the access queue in the node allocation logical relationship may be determined according to node allocation logical relationship parameters of allocation tasks corresponding to allocation tasks in the node allocation logical relationship of each allocation task of the access queue.

Then, data allocation operations may be performed on the data to be allocated according to the first allocation queue and the second allocation queue of each allocation task of the access queue.

In one possible design, in order to improve the rationality of the subsequent data allocation, please further refer to fig. 4, after step S150, the method may further include the following steps:

step S160, updating the first allocation policy of the data service and the second allocation policy of the blockchain service according to the data allocation operation result of the data to be allocated.

Fig. 5 is a schematic functional module diagram of the data distribution device 300 based on a block chain according to an embodiment of the present application, and the present embodiment may divide the functional module of the data distribution device 300 based on a block chain according to the foregoing method embodiment. For example, the functional blocks may be divided for the respective functions, or two or more functions may be integrated into one processing block. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. It should be noted that, the division of the modules in the present application is schematic, and is only a logical function division, and there may be another division manner in actual implementation. For example, in the case of dividing each function module by corresponding functions, the block chain-based data distribution apparatus 300 shown in fig. 5 is only an apparatus diagram. The device 300 for allocating data based on a block chain may include an obtaining module 310, a comparing module 320, a first determining module 330, a second determining module 340, and a data allocating module 350, where functions of the functional modules of the device 300 for allocating data based on a block chain are described in detail below.

The obtaining module 310 is configured to obtain a first allocation policy of a data service corresponding to data to be allocated in a current blockchain system and a second allocation policy of a blockchain service corresponding to the blockchain system.

A comparison module 320 for comparing the data allocation item difference between the first allocation policy and the second allocation policy.

A first determining module 330, configured to determine, according to the data allocation item difference, a node allocation control parameter of the blockchain service for the data allocation item difference when the data allocation item difference is not within the difference range of the set allocation item.

The second determining module 340 is configured to determine, according to the node allocation control parameter, a target data allocation node to which data to be allocated is to be allocated and an allocation control flow parameter for each target data allocation node.

And a data distribution module 350, configured to perform a data distribution operation on the data to be distributed according to the determined target data distribution node and the distribution control flow parameter for each target data distribution node.

Further, fig. 6 is a schematic structural diagram of a server 100 for executing the above data distribution method based on a blockchain according to an embodiment of the present application. As shown in FIG. 6, the server 100 may include a network interface 110, a machine-readable storage medium 120, a processor 130, and a bus 140. The processor 130 may be one or more, and one processor 130 is illustrated in fig. 6 as an example. The network interface 110, the machine-readable storage medium 120, and the processor 130 may be connected by a bus 140 or otherwise, as exemplified by the connection by the bus 140 in fig. 6.

The machine-readable storage medium 120 is a computer-readable storage medium, and can be used to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the data distribution method based on the block chain in the embodiment of the present application (for example, the obtaining module 310, the comparing module 320, the first determining module 330, the second determining module 340, and the data distributing module 350 of the data distribution apparatus 300 based on the block chain shown in fig. 5). The processor 130 detects the software program, instructions and modules stored in the machine-readable storage medium 120, so as to execute various functional applications and data processing of the terminal device, that is, to implement the above data distribution method based on the block chain, which is not described herein again.

The machine-readable storage medium 120 may mainly 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 according to the use of the terminal, and the like. Further, the machine-readable storage medium 120 may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The non-volatile memory may be a Read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash memory. Volatile Memory can be Random Access Memory (RAM), which acts as external cache Memory. By way of example, but not limitation, many forms of RAM are available, such as Static random access memory (Static RAM, SRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic random access memory (Synchronous DRAM, SDRAM), Double data rate Synchronous Dynamic random access memory (DDR SDRAM), Enhanced Synchronous SDRAM (ESDRAM), Synchronous link SDRAM (SLDRAM), and direct memory bus RAM (DR RAM). It should be noted that the memories of the systems and methods described herein are intended to comprise, without being limited to, these and any other suitable memory of a publishing node. In some examples, the machine-readable storage medium 120 may further include memory located remotely from the processor 130, which may be connected to the server 100 over 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 processor 130 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method embodiments may be performed by integrated logic circuits of hardware or instructions in the form of software in the processor 130. The processor 130 may be a general-purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, or discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor.

The server 100 may exchange information with other devices (e.g., the data distribution node 200) via the communication interface 110. Communication interface 110 may be a circuit, bus, transceiver, or any other device that may be used to exchange information. Processor 130 may send and receive information using communication interface 110.

In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.

Embodiments of the present application are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various changes and modifications may be made in the embodiments of the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the embodiments of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to encompass such modifications and variations.

Claims

1. A blockchain-based data distribution method, applied to a server, wherein the server is communicatively connected to at least one data distribution node, the method comprising:

2. The blockchain-based data distribution method according to claim 1, wherein the step of determining the node distribution control parameter of the blockchain service for the data distribution item difference according to the data distribution item difference comprises:

3. The method according to claim 2, wherein the step of calculating the corresponding expression distribution coefficients according to the initial distribution control parameter, the number of times each block link point in the block link point sequence is distributed, the cumulative number of times each block link node is distributed, and the expression parameters of the initial distribution expression region comprises:

calculating expression distribution results of a plurality of expression parameter balance values and corresponding expression distribution control parameters, and processing the expression distribution control parameters according to distribution process information in the expression distribution results to obtain a plurality of expression distribution control parameter sets;

sequentially extracting expression distribution association processes in the expression distribution control parameter sets, taking expression association units in the expression distribution association processes as expression distribution units, and respectively and sequentially generating expression distribution sequences corresponding to the expression distribution units according to the expression distribution association processes;

4. The method according to claim 1, wherein the step of outputting the expression allocation coefficient, the expression allocation result, and a sequence parameter of a block link point sequence as a node allocation control parameter of the data allocation item difference includes:

5. The method according to claim 1, wherein the step of determining target data distribution nodes for distributing the data to be distributed and distribution control flow parameters for each target data distribution node according to the node distribution control parameters comprises:

6. The method according to claim 1, wherein the step of performing a data distribution operation on the data to be distributed according to the determined target data distribution nodes and the distribution control flow parameters for each target data distribution node comprises:

generating a distribution path and distribution identification information when the target data distribution node distributes the corresponding distribution control flow parameters according to the determined target data distribution node;

performing channel identification processing on an allocation channel corresponding to the data to be allocated to obtain a plurality of channel identification fields, determining allocation identification parameters corresponding to each channel identification field, and determining a corresponding allocation identification space according to the allocation identification parameters;

identifying the distribution path and the distribution identification information to the distribution identification space to obtain distribution identification parameters, determining distribution logic association strength between the distribution identification parameters and each distribution identification parameter in the distribution identification space, and determining path mapping parameters of the distribution identification parameters according to the distribution path of the distribution identification parameters corresponding to the maximum value of the distribution logic association strength;

7. The method for block chain based data allocation according to any of claims 1-6, wherein said method further comprises:

8. A blockchain-based data distribution apparatus, for use in a server communicatively coupled to at least one data distribution node, the apparatus comprising:

9. A server, comprising a processor, a machine-readable storage medium, and a network interface, the machine-readable storage medium, the network interface, and the processor being connected by a bus system, the network interface being configured to communicatively connect to at least one data distribution node, the machine-readable storage medium being configured to store a program, instructions, or code, and the processor being configured to execute the program, instructions, or code in the machine-readable storage medium to perform the method of block chain based data distribution of any of claims 1-7.

10. A readable storage medium having stored therein machine executable instructions which when executed perform the method of blockchain based data allocation of any one of claims 1 to 7.