CN112866374A - Communication data processing method combined with block chain payment network and big data server - Google Patents

Communication data processing method combined with block chain payment network and big data server Download PDF

Info

Publication number
CN112866374A
CN112866374A CN202110048604.3A CN202110048604A CN112866374A CN 112866374 A CN112866374 A CN 112866374A CN 202110048604 A CN202110048604 A CN 202110048604A CN 112866374 A CN112866374 A CN 112866374A
Authority
CN
China
Prior art keywords
track
data
target
state
block chain
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
CN202110048604.3A
Other languages
Chinese (zh)
Inventor
吴春香
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
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 Individual filed Critical Individual
Priority to CN202110048604.3A priority Critical patent/CN112866374A/en
Publication of CN112866374A publication Critical patent/CN112866374A/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/2866Architectures; Arrangements
    • H04L67/30Profiles
    • H04L67/306User profiles
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/44Arrangements for executing specific programs
    • G06F9/445Program loading or initiating
    • G06F9/44505Configuring for program initiating, e.g. using registry, configuration files
    • G06F9/4451User profiles; Roaming
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/2866Architectures; Arrangements
    • H04L67/30Profiles

Abstract

According to the communication data processing method and the big data server combined with the block chain payment network, firstly, target state data of each block chain node and an update log corresponding to the target state data are extracted, state attribute information is determined, secondly, a plurality of resource configuration lists corresponding to the node state data of each block chain node are determined based on the update log and the state attribute information, then, a resource configuration list is calibrated according to data description values corresponding to the target state data and mapping description values corresponding to the data description values included in the resource configuration list to obtain a resource configuration list to be processed, then, the target block chain node is determined according to the resource configuration list to be processed, and finally, network parameter repairing instructions corresponding to the target block chain node are generated and issued one by one. Therefore, reliable repair of network environment disturbance of the blockchain payment network can be ensured, and accuracy of payment behaviors in the blockchain payment network is further ensured.

Description

Communication data processing method combined with block chain payment network and big data server
Technical Field
The present application relates to the field of blockchain communication technologies, and in particular, to a communication data processing method and a big data server in combination with a blockchain payment network.
Background
With the rapid development of blockchain technology, various banks and financial-technology enterprises have started to arrange blockchain payment business, and blockchain payment is becoming a reality step by step. In blockchain payments, the payer node and the payee node are directly interfaced and each transaction between the payer node and the payee node is not tamperproof. If a transaction between the payer node and the payee node is unsuccessful, the payer node will not perform a deduction action. In some scenarios, the payee node also has no authority to tamper with the transaction record that has been finalized at a time. This can guarantee the payer's normal rights and interests. However, as the number of payer nodes and payee nodes in the blockchain payment network increases, the network environment of the blockchain payment network may be disturbed to different degrees, which may affect the accuracy of the payment behavior in the blockchain payment network.
Disclosure of Invention
The application provides a communication data processing method and a big data server combined with a block chain payment network, so as to solve the technical problems in the prior art.
In a first aspect of the embodiments of the present invention, a communication data processing method in conjunction with a blockchain payment network is provided, which is applied to a big data server in communication with a plurality of blockchain nodes, where the method at least includes the following steps:
extracting each group of target state data with data updating behavior in a set time length from the node state data corresponding to each block chain node, determining an updating log corresponding to each group of target state data from a preset database, and determining state attribute information of each group of target state data with a unique state identifier in the corresponding updating log;
determining a plurality of resource configuration lists corresponding to the node state data of each block chain node based on the update logs corresponding to each group of target state data of the node state data and the correlation coefficient between each two groups of target state data determined according to the state attribute information; each resource configuration list comprises data description values corresponding to at least one group of target state data;
for each resource configuration list of each block chain node, determining a mapping description value of a data description value corresponding to target state data included in the resource configuration list in a target resource configuration list with the maximum similarity value with the list structure of the resource configuration list, and calibrating at least part of the resource configuration list in each block chain node according to a difference coefficient between the data description value and the mapping description value corresponding to the data description value to obtain a resource configuration list to be processed;
counting the occupation ratio of the resource allocation list to be processed corresponding to each block link point in all the resource allocation lists of the block link node, and determining the block link point with the occupation ratio reaching a set value as a target block link node with a protocol verification-free function between the block link point and the big data server;
and generating network parameter repairing instructions corresponding to the link points of the target block and issuing the network parameter repairing instructions one by one.
In a second aspect of the embodiments of the present invention, a big data server is provided, where the big data server is in communication with a plurality of block link points, and the big data server is configured to:
extracting each group of target state data with data updating behavior in a set time length from the node state data corresponding to each block chain node, determining an updating log corresponding to each group of target state data from a preset database, and determining state attribute information of each group of target state data with a unique state identifier in the corresponding updating log;
determining a plurality of resource configuration lists corresponding to the node state data of each block chain node based on the update logs corresponding to each group of target state data of the node state data and the correlation coefficient between each two groups of target state data determined according to the state attribute information; each resource configuration list comprises data description values corresponding to at least one group of target state data;
for each resource configuration list of each block chain node, determining a mapping description value of a data description value corresponding to target state data included in the resource configuration list in a target resource configuration list with the maximum similarity value with the list structure of the resource configuration list, and calibrating at least part of the resource configuration list in each block chain node according to a difference coefficient between the data description value and the mapping description value corresponding to the data description value to obtain a resource configuration list to be processed;
counting the occupation ratio of the resource allocation list to be processed corresponding to each block link point in all the resource allocation lists of the block link node, and determining the block link point with the occupation ratio reaching a set value as a target block link node with a protocol verification-free function between the block link point and the big data server;
and generating network parameter repairing instructions corresponding to the link points of the target block and issuing the network parameter repairing instructions one by one.
In a third aspect of the embodiments of the present invention, a big data server is provided, including:
the system comprises a processor, a memory and a network interface, wherein the memory and the network interface are connected with the processor; the network interface is connected with a nonvolatile memory in the big data server; when the processor is operated, the computer program is called from the nonvolatile memory through the network interface, and the computer program is operated through the memory so as to execute the method.
The communication data processing method and the big data server combined with the block chain payment network, provided by the embodiment of the invention, firstly extract target state data of each block chain node and an update log corresponding to the target state data, determine state attribute information, secondly determine a plurality of resource configuration lists corresponding to the node state data of each block chain node based on the update log and the state attribute information, then calibrate the resource configuration lists according to data description values corresponding to the target state data and mapping description values corresponding to the data description values, which are included in the resource configuration lists, to obtain resource configuration lists to be processed, further determine the target block chain nodes according to the resource configuration lists to be processed, and finally generate network parameter repairing instructions corresponding to the target block chain nodes and issue the network parameter repairing instructions one by one. Therefore, the coordination of each blockchain node on the network environment parameter restoration can be realized, the conflict caused by the independent operation of each blockchain node by the self-adaptive restoration program is avoided, the reliable restoration of the network environment disturbance of the blockchain payment network is ensured, and the accuracy of the payment behavior in the blockchain payment network is further ensured.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application.
Fig. 1 is a flowchart illustrating a communication data processing method in conjunction with a blockchain payment network according to an exemplary embodiment of the present application.
Fig. 2 is a block chain payment network integrated communication data processing system architecture diagram according to an example embodiment of the present application.
Fig. 3 is a block diagram illustrating one embodiment of a communication data processing apparatus incorporating a blockchain payment network according to one illustrated embodiment.
Fig. 4 is a hardware configuration diagram of a big data server in which the apparatus shown in fig. 3 is located.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It is to be understood that although the terms first, second, third, etc. may be used herein to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the present application. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
When the inventor analyzes the existing block chain payment network, it is found that, in order to ensure the non-tamper property of the payment behavior, the existing block chain payment network usually deploys an adaptive recovery procedure of the network environment parameters in each block chain node. Therefore, if the network environment of the blockchain payment network is disturbed, the blockchain nodes can run an adaptive recovery program to repair and adjust the network environment of the blockchain payment network.
However, the plurality of blockchain nodes in the blockchain payment network are equal, and when the network environment is repaired and adjusted, if the plurality of blockchain nodes simultaneously and independently run respective adaptive recovery programs, thread conflicts among different adaptive recovery programs may be caused, which may cause that network environment parameters of the blockchain payment network are difficult to be accurately recovered, thereby causing confusion of the blockchain nodes when subsequently processing operation data corresponding to a payment behavior, and affecting the accuracy of the payment behavior.
In order to solve the above problem, embodiments of the present invention provide a communication data processing method and a big data server in combination with a blockchain payment network, which can perform cloud processing on a network parameter repair behavior of the blockchain payment network. In detail, the big data server can allocate a corresponding network parameter repair instruction to each blockchain link point according to the state data of each blockchain node in the blockchain payment network, so that the coordination of each blockchain node on the network environment parameter repair is realized. Therefore, reliable repair of network environment disturbance of the blockchain payment network can be ensured, and accuracy of payment behaviors in the blockchain payment network is further ensured.
On the basis of the above, please refer to fig. 1 in combination, a flow chart of a communication data processing method in combination with a blockchain payment network is provided, and the method can be applied to the big data server 210 in fig. 2, which communicates with a plurality of blockchain nodes 220. Further, the big data server 210 implements the communication data processing method described above by performing the following steps S210 to S250.
Step S210, extracting each set of target state data with data updating behavior in a set duration from the node state data corresponding to each block chain node, determining an update log corresponding to each set of target state data from a preset database, and determining state attribute information of each set of target state data having a unique state identifier in the corresponding update log.
In this embodiment, the node state data is used to characterize the communication interaction state of the blockchain node. The set time duration can be adjusted appropriately according to the number of blockchain nodes communicating with the big data server. The data updating behavior is used for representing the switching behavior of the interactive link existing in the block link point. Different interaction links are used to characterize different payment behaviors. The preset database may be a database of a big data server for storing a communication record with each blockchain node. The database may be a mySQL database or a hive database, which is not limited herein. The update log is used for recording data update logic and data update results of the target state data, the state identifier is used for representing the irreproducibility of the target state data in the block link point, and the state attribute information can be an information field composed of a plurality of attribute tags.
Step S220, determining a plurality of resource configuration lists corresponding to the node state data of each block chain node based on the update logs corresponding to each group of target state data of the node state data and the correlation coefficient between each two groups of target state data determined according to the state attribute information; and each resource configuration list comprises data description values corresponding to at least one group of target state data.
In this embodiment, the correlation coefficient is used to characterize the similarity between each two sets of target status data, and the resource allocation list is used to characterize the communication priority of the blockchain node in the whole blockchain payment network.
Step S230, for each resource allocation list of each block chain node, determining a mapping description value of a data description value corresponding to target state data included in the resource allocation list in a target resource allocation list having a maximum similarity value with a list structure of the resource allocation list, and calibrating at least a part of the resource allocation list in each block chain node according to a difference coefficient between the data description value and the mapping description value corresponding thereto, to obtain a resource allocation list to be processed.
Step S240, counting the ratio of the resource allocation list to be processed corresponding to each block link point in all resource allocation lists of the block link node, and determining the block link point with the ratio reaching a set value as a target block link node with which a protocol verification-free exists between the block link point and the big data server.
And step S250, generating network parameter repair instructions corresponding to the link points of the target block and issuing the network parameter repair instructions one by one.
Specifically, the network parameter repair instructions corresponding to the target block link points are generated and issued one by one, and the network parameter repair instructions can be obtained through the following substeps:
extracting network state characteristics in node state data of each target block chain node, and generating a network parameter repairing instruction corresponding to the target block chain node according to the network state characteristics and a parameter change track determined from an interface parameter record corresponding to the target block chain node;
issuing the network parameter repairing instruction to a corresponding target block chain node so that the target block chain node can repair the network environment parameter when the network environment of the block chain payment network is disturbed based on the network parameter repairing instruction; and each target block chain node is pre-configured with a self-adaptive recovery program, and the weight grades of the network parameter repair instructions corresponding to different target block chain nodes are different.
In specific implementation, if the network environment of the blockchain payment network is disturbed, the target blockchain nodes share respective network parameter repair instructions, and determine the executed target network parameter repair instructions through voting, so that the target blockchain nodes corresponding to the target network parameter repair instructions execute the repair of the network environment parameters. Therefore, the coordination of each blockchain node on the network environment parameter restoration can be realized, and the conflict caused by the independent operation of each blockchain node on the self-adaptive recovery program is avoided. Therefore, reliable repair of network environment disturbance of the blockchain payment network can be ensured, and accuracy of payment behaviors in the blockchain payment network is further ensured.
It can be understood that, by executing the contents described in the above steps S210 to S250, first, the target state data of each block chain node and the update log corresponding to the target state data are extracted, and the state attribute information is determined, then, a plurality of resource configuration lists corresponding to the node state data of each block chain node are determined based on the update log and the state attribute information, then, the resource configuration lists are calibrated according to the data description values corresponding to the target state data included in the resource configuration lists and the mapping description values corresponding thereto to obtain resource configuration lists to be processed, then, the target block chain node is determined according to the resource configuration lists to be processed, and finally, the network parameter repair instructions corresponding to the target block chain node are generated and issued one by one. Therefore, the coordination of each blockchain node on the network environment parameter restoration can be realized, the conflict caused by the independent operation of each blockchain node by the self-adaptive restoration program is avoided, the reliable restoration of the network environment disturbance of the blockchain payment network is ensured, and the accuracy of the payment behavior in the blockchain payment network is further ensured.
In specific implementation, the inventor finds that when a network parameter repair instruction corresponding to each target block link point is generated, the heterogeneity and compatibility between network state features and parameter change tracks need to be considered, otherwise, the determined weight level of the network parameter repair instruction is deviated, and the target block link point may not identify the network parameter repair instruction. In order to solve the above problem, in step S250, a network parameter repair instruction corresponding to the target block link point is generated according to the network state feature and a parameter change trajectory determined from the interface parameter record corresponding to the target block link point, which may specifically include the contents described in steps S251 to S253 below.
Step S251, based on the first state feature array and the second state feature array of the network state feature, determines the interval identification information of a plurality of track intervals of the parameter change track to be split, and the interval association degree between different track intervals.
Step S252, based on the determined section identification information of the plurality of track sections and the section association degrees between different track sections, removing the plurality of track sections, so that the confidence of the section identification information of the reserved track sections is greater than a first preset value, and the section association degrees between the reserved track sections are greater than a second preset value.
Step S253, splitting the parameter change track according to the reserved track interval to obtain a plurality of sub tracks, extracting track change influence factors corresponding to each sub track, combining the track change influence factors into a track change influence sequence, and generating a network parameter restoration instruction corresponding to the target block link point based on the track change influence sequence; wherein different track change influence sequences correspond to different weight levels.
When the method described in the above steps S251 to S253 is applied, by removing the track interval, the heterogeneity and compatibility between the network state characteristics and the parameter change track can be taken into consideration, and it is ensured that the weight level of the determined network parameter repair instruction does not deviate, so that the target block chain node can accurately identify the network parameter repair instruction.
In a specific implementation process, in order to implement fast and accurate analysis of the target block link point on the network parameter repair instruction and reduce time consumption for identifying the network parameter repair instruction, in step S253, a trajectory change influence factor corresponding to each sub-trajectory is extracted and combined into a trajectory change influence sequence, and the network parameter repair instruction corresponding to the target block link point is generated based on the trajectory change influence sequence, which may specifically include the contents described in the following steps S2531 to S2535.
Step S2531, importing the track description information of each sub-track into a preset list, extracting the track change characteristics of each sub-track based on the list structure of the preset list and the position of the description information corresponding to each sub-track in the preset list, and adding a characteristic identifier for each track change characteristic according to the track weight of each sub-track relative to the parameter change track; the feature identifiers have a hierarchical relationship from large to small.
Step S2532, sequentially determining track change characteristics corresponding to a second characteristic identifier with highest identifier association degree between first characteristic identifiers of each track change characteristic according to the sequence of the characteristic identifiers from large to small aiming at each track change characteristic, and determining the track change characteristics corresponding to the first characteristic identifiers and the track change characteristics corresponding to the second characteristic identifiers to be a group of track change characteristic combinations; and the track change features which are determined to be the track change feature combination are not judged according to the sequence of the feature identifications from large to small, wherein the track change features corresponding to the second feature identification with the highest identification association degree between the first feature identifications of each track change feature are determined in turn.
Step S2533, judging whether each sub-track has a reserved track change characteristic; if the evaluation coefficient exists, calculating a feature value of one reserved track change feature and generating the evaluation coefficient of the sub-track based on the feature value; performing characteristic correlation calculation on each track change characteristic combination corresponding to each sub-track by adopting the evaluation coefficient to obtain a track change influence factor corresponding to each characteristic change track; and if not, determining a track change influence factor corresponding to each sub-track according to the cosine distance between the two track change characteristics in each track change characteristic combination corresponding to each sub-track.
S2534, sequencing each group of determined track change influence factors in a sequence from small to large to obtain a track change influence sequence; and determining text information of instruction parsing logic for representing the corresponding target block chain node based on the difference value of two adjacent track change influence factors in each track change influence sequence.
Step S2535, generating a network parameter repairing instruction corresponding to the link point of the target block according to at least two word vectors in the extracted text information; in the process of generating the network parameter repairing instruction, the weight level of the network parameter repairing instruction is determined by the average value of the vector dimension of the word vector in parallel.
When the content described in the step S2535 is applied, the network parameter repair instruction corresponding to each target block link point can be generated according to at least two word vectors in the determined text information, so that the instruction analysis logic of the target block link point can be taken into account, thereby realizing fast and accurate analysis of the network parameter repair instruction, and reducing the time consumption for identifying the network parameter repair instruction by the target block link point.
In an alternative embodiment, in order to ensure the accuracy of the determined state attribute information, the state attribute information described in step S210 for determining that each set of target state data has a unique state identifier in the corresponding update log may specifically include the contents described in step S211 to step S213 below.
Step S211, generating a first state list corresponding to each group of target state data and used for representing the state change degree of the target state data and a second state list used for representing the data reliability of the target state data; the first state list and the second state list respectively comprise a plurality of data packets with the same quantity, compression coefficients of the data packets are different, and the compression coefficients are used for representing data concentration of the data packets.
Step S212, determining data distribution information of one data packet from the first state list corresponding to each group of target state data, and when determining the data distribution information, determining, in parallel, a data packet having a maximum compression coefficient in the second state list corresponding to each group of target state data as a reference data packet.
Step S213, mapping the data distribution information to the reference data packet and determining target distribution information of the data distribution information in the reference data packet; determining a data packet mapping matrix between the first state list and the second state list according to the target distribution information and the data distribution information; mapping one attribute field in each group of target state data to a corresponding update log according to the data packet mapping matrix to obtain a mapping field, and if the mapping field has a unique corresponding log text in the update log, determining state attribute information corresponding to the target state data and having a unique state identifier according to the log text; and if the mapping field does not have the only corresponding log text in the updating log, returning to the step of mapping one attribute field in each group of target state data to the corresponding updating log according to the data packet mapping matrix to obtain the mapping field.
It is understood that the accuracy of the determined state attribute information can be ensured through the above steps S211 to S213.
In an alternative embodiment, in order to ensure the integrity of the resource configuration list and avoid omission in determining the resource configuration list corresponding to the node state data of each blockchain node, in step S220, a plurality of resource configuration lists corresponding to the node state data of each blockchain node are determined based on the update log corresponding to each set of target state data of the node state data and the correlation coefficient between each two sets of target state data determined according to the state attribute information, which may specifically include the contents described in steps S221 to S227 below.
Step S221, determining event record information and record generation time period of each update log, where the event record information is an information set in which reference data of each set of target state data is used as an event trigger point and a record identifier is a set format character string.
Step S222, determining a plurality of queue priorities based on a plurality of event queues in each group of event record information; and extracting event identifiers according to effective recording time periods corresponding to the record generation time periods in the event record information by the event queues corresponding to the queue priorities to obtain a plurality of event identifiers respectively corresponding to the queue priorities, and taking the queue logic information of the queue priorities corresponding to the event identifiers as the directional logic information of the event identifiers.
Step S223, determining a directional matrix between the event record information and the record generation time period according to the plurality of event identifiers, and obtaining an activity coefficient of a corresponding update log represented by each directional logic information in a plurality of directional logic information corresponding to each update log; wherein the activity coefficient is used to characterize an update frequency of the update log.
Step S224, determining an active variable between each active coefficient of each update log under the non-calibration coefficient classification and each active coefficient of each update log under the calibration coefficient classification according to the active coefficient of each update log under the calibration coefficient classification and the coefficient evaluation factor of the active coefficient under the condition that it is determined that each update log contains the calibration coefficient classification based on the directivity matrix.
Step S225, according to the active variable, transferring the active coefficient of each update log under the non-calibration coefficient classification and matched with the active coefficient under the calibration coefficient classification to the calibration coefficient classification; under the condition that a plurality of active coefficients are contained in the non-calibration coefficient classification corresponding to each update log, determining active variables among the active coefficients of each update log in the non-calibration coefficient classification according to the active coefficients in the calibration coefficient classification of each update log and coefficient evaluation factors of the active coefficients; marking each active coefficient under the non-calibration coefficient classification based on active variables among the active coefficients to obtain at least one target active coefficient, and transferring the target active coefficient to the calibration coefficient classification.
Step S226, matching each active coefficient classified by the calibration coefficient with the determined correlation coefficient to obtain a plurality of matching results, extracting resource allocation information of each matching result relative to the node state data of the corresponding block chain node, and extracting a plurality of resource configuration lists corresponding to the node state data of each block chain node from the resource allocation information.
In specific implementation, through the contents described in the above steps S221 to S226, omission can be avoided when determining the resource configuration list corresponding to the node state data of each blockchain node, so as to ensure the integrity of the resource configuration list.
In another alternative embodiment, in order to calibrate the resource configuration list to be processed accurately so as to ensure accurate generation of the subsequent repair instruction, the mapping description value of the data description value corresponding to the target state data included in the resource configuration list in the target resource configuration list having the largest value similar to the list structure of the resource configuration list is determined as described in step S230, and at least a part of the resource configuration list in each block chain node is calibrated according to a difference coefficient between the data description value and the mapping description value corresponding thereto, so as to obtain the resource configuration list to be processed, which may further be implemented by the following steps S231 to S235.
Step S231, sequentially listing the character codes of the target state data included in the resource configuration list according to time sequence, and inquiring the code field with the formatting identification from the character codes; and sequencing the coded fields according to the sequence of the field widths from large to small to obtain the data description values corresponding to the target state data.
Step S232, serializing the data description values to obtain a target sequence corresponding to the data description values, and importing the target sequence into a target list unit in a target resource configuration list having a maximum list structure similarity value to the resource configuration list to obtain mapping description values corresponding to the data description values.
Step S233, calculating a consistency comparison result of the data description value and the mapping description value at each identical character position, and determining a difference coefficient between the data description value and the mapping description value according to a ratio of the consistency comparison result representing a comparison result that the data description value and the mapping description value are different at each identical character position.
Step S234, determining the target quantity for calibrating the block chain link points according to the value interval of the difference coefficient; wherein the numerical range includes a plurality of successive sub-ranges.
Step S235, determining the list concentration of each resource configuration list corresponding to each block link point, calculating the average value of the list concentration, and calibrating the corresponding resource configuration lists in sequence from small to large according to the difference value of each list concentration and the average value until the calibrated accumulated number of the resource configuration lists to be processed reaches the target number.
When the contents described in the above steps S231 to S235 are executed, the pending resource configuration list can be accurately calibrated so as to ensure the accurate generation of the subsequent repair instruction.
Based on the same inventive concept, there is also provided a big data server, the big data server being in communication with a plurality of block link points, the big data server being configured to:
extracting each group of target state data with data updating behavior in a set time length from the node state data corresponding to each block chain node, determining an updating log corresponding to each group of target state data from a preset database, and determining state attribute information of each group of target state data with a unique state identifier in the corresponding updating log;
determining a plurality of resource configuration lists corresponding to the node state data of each block chain node based on the update logs corresponding to each group of target state data of the node state data and the correlation coefficient between each two groups of target state data determined according to the state attribute information; each resource configuration list comprises data description values corresponding to at least one group of target state data;
for each resource configuration list of each block chain node, determining a mapping description value of a data description value corresponding to target state data included in the resource configuration list in a target resource configuration list with the maximum similarity value with the list structure of the resource configuration list, and calibrating at least part of the resource configuration list in each block chain node according to a difference coefficient between the data description value and the mapping description value corresponding to the data description value to obtain a resource configuration list to be processed;
counting the occupation ratio of the resource allocation list to be processed corresponding to each block link point in all the resource allocation lists of the block link node, and determining the block link point with the occupation ratio reaching a set value as a target block link node with a protocol verification-free function between the block link point and the big data server;
and generating network parameter repairing instructions corresponding to the link points of the target block and issuing the network parameter repairing instructions one by one.
Optionally, the generating, by the big data server, network parameter repair instructions corresponding to the target block link points and issuing the network parameter repair instructions one by one specifically includes:
extracting network state characteristics in node state data of each target block chain node, and generating a network parameter repairing instruction corresponding to the target block chain node according to the network state characteristics and a parameter change track determined from an interface parameter record corresponding to the target block chain node;
issuing the network parameter repairing instruction to a corresponding target block chain node so that the target block chain node can repair the network environment parameter when the network environment of the block chain payment network is disturbed based on the network parameter repairing instruction; and each target block chain node is pre-configured with a self-adaptive recovery program, and the weight grades of the network parameter repair instructions corresponding to different target block chain nodes are different.
Optionally, the generating, by the big data server, a network parameter repair instruction corresponding to the target block link point according to the network state feature and the parameter change trajectory determined from the interface parameter record corresponding to the target block link point specifically includes:
determining interval identification information of a plurality of track intervals of the parameter change track to be split and interval association degrees among different track intervals based on the first state feature array and the second state feature array of the network state features;
based on the determined section identification information of the plurality of track sections and the section association degrees between different track sections, removing the plurality of track sections, so that the confidence degree of the section identification information of the reserved track sections is greater than a first preset value, and the section association degrees between the reserved track sections are greater than a second preset value;
splitting the parameter change track according to the reserved track interval to obtain a plurality of sub tracks, extracting a track change influence factor corresponding to each sub track, combining the track change influence factors into a track change influence sequence, and generating a network parameter restoration instruction corresponding to the link point of the target block based on the track change influence sequence; wherein different track change influence sequences correspond to different weight levels.
Optionally, the extracting, by the big data server, a trajectory change influence factor corresponding to each sub-trajectory and combining the trajectory change influence factors into a trajectory change influence sequence, where generating the network parameter repair instruction corresponding to the target block link point based on the trajectory change influence sequence specifically includes:
the track description information of each sub-track is imported into a preset list, the track change characteristic of each sub-track is extracted based on the list structure of the preset list and the position of the description information corresponding to each sub-track in the preset list, and a characteristic identifier is added to each track change characteristic according to the track weight of each sub-track relative to the parameter change track; the feature identifiers have a hierarchical relationship from large to small;
for each track change feature, sequentially determining track change features corresponding to second feature identifiers with highest identifier association degree between first feature identifiers of each track change feature according to the sequence of the feature identifiers from large to small, and determining the track change features corresponding to the first feature identifiers and the track change features corresponding to the second feature identifiers to be a group of track change feature combinations; the track change features which are determined to be the track change feature combination are not judged according to the sequence of the feature identifications from large to small, and the track change features corresponding to the second feature identifications with the highest identification association degree between the first feature identifications of each track change feature are determined in sequence;
judging whether each sub-track has a reserved track change characteristic or not; if the evaluation coefficient exists, calculating a feature value of one reserved track change feature and generating the evaluation coefficient of the sub-track based on the feature value; performing characteristic correlation calculation on each track change characteristic combination corresponding to each sub-track by adopting the evaluation coefficient to obtain a track change influence factor corresponding to each characteristic change track; if not, determining a track change influence factor corresponding to each sub-track according to the cosine distance between two track change features in each track change feature combination corresponding to each sub-track;
sequencing each group of determined track change influence factors according to a sequence from small to large to obtain a track change influence sequence; determining text information of instruction analysis logic for representing corresponding target block chain nodes based on the difference value of two adjacent track change influence factors in each track change influence sequence;
generating a network parameter repairing instruction corresponding to the link point of the target block according to at least two word vectors in the extracted text information; in the process of generating the network parameter repairing instruction, the weight level of the network parameter repairing instruction is determined by the average value of the vector dimension of the word vector in parallel.
On the basis of the above, please refer to fig. 3 in combination, a functional block diagram of a communication data processing apparatus 300 incorporating a block chain payment network is provided, and a detailed description of the apparatus is as follows.
A1. A communication data processing apparatus 300 incorporating a blockchain payment network, applied to a big data server communicating with a plurality of blockchain nodes, the apparatus at least comprises the following functional modules:
the data determining module 310 is configured to extract each set of target state data with data updating behavior in a set duration from the node state data corresponding to each blockchain node, determine an update log corresponding to each set of target state data from a preset database, and determine state attribute information of each set of target state data with a unique state identifier in the corresponding update log;
a list determining module 320, configured to determine, based on the update logs corresponding to each set of target state data of the node state data and a correlation coefficient between each two sets of target state data determined according to the state attribute information, a plurality of resource configuration lists corresponding to the node state data of each block chain node; each resource configuration list comprises data description values corresponding to at least one group of target state data;
a list calibration module 330, configured to determine, for each resource configuration list of each block chain node, a mapping description value of a data description value corresponding to target state data included in the resource configuration list in a target resource configuration list having a maximum similarity value to a list structure of the resource configuration list, and calibrate at least part of the resource configuration list in each block chain node according to a difference coefficient between the data description value and a mapping description value corresponding thereto, to obtain a resource configuration list to be processed;
the list counting module 340 is configured to count the ratio of the resource configuration list to be processed corresponding to each block link point in all the resource configuration lists of the block link node, and determine the block link point with the ratio reaching a set value as a target block link node with which a protocol verification-free protocol exists between the target block link node and the big data server;
and the instruction generating module 350 is configured to generate network parameter repair instructions corresponding to the link points of the target block and issue the network parameter repair instructions one by one.
A2. The apparatus of a1, the instruction generation module 350 to:
extracting network state characteristics in node state data of each target block chain node, and generating a network parameter repairing instruction corresponding to the target block chain node according to the network state characteristics and a parameter change track determined from an interface parameter record corresponding to the target block chain node;
issuing the network parameter repairing instruction to a corresponding target block chain node so that the target block chain node can repair the network environment parameter when the network environment of the block chain payment network is disturbed based on the network parameter repairing instruction; and each target block chain node is pre-configured with a self-adaptive recovery program, and the weight grades of the network parameter repair instructions corresponding to different target block chain nodes are different.
A3. The apparatus of a2, the instruction generation module 350 to:
determining interval identification information of a plurality of track intervals of the parameter change track to be split and interval association degrees among different track intervals based on the first state feature array and the second state feature array of the network state features;
based on the determined section identification information of the plurality of track sections and the section association degrees between different track sections, removing the plurality of track sections, so that the confidence degree of the section identification information of the reserved track sections is greater than a first preset value, and the section association degrees between the reserved track sections are greater than a second preset value;
splitting the parameter change track according to the reserved track interval to obtain a plurality of sub tracks, extracting a track change influence factor corresponding to each sub track, combining the track change influence factors into a track change influence sequence, and generating a network parameter restoration instruction corresponding to the link point of the target block based on the track change influence sequence; wherein different track change influence sequences correspond to different weight levels.
A4. The apparatus of a3, the instruction generation module 350 to:
the track description information of each sub-track is imported into a preset list, the track change characteristic of each sub-track is extracted based on the list structure of the preset list and the position of the description information corresponding to each sub-track in the preset list, and a characteristic identifier is added to each track change characteristic according to the track weight of each sub-track relative to the parameter change track; the feature identifiers have a hierarchical relationship from large to small;
for each track change feature, sequentially determining track change features corresponding to second feature identifiers with highest identifier association degree between first feature identifiers of each track change feature according to the sequence of the feature identifiers from large to small, and determining the track change features corresponding to the first feature identifiers and the track change features corresponding to the second feature identifiers to be a group of track change feature combinations; the track change features which are determined to be the track change feature combination are not judged according to the sequence of the feature identifications from large to small, and the track change features corresponding to the second feature identifications with the highest identification association degree between the first feature identifications of each track change feature are determined in sequence;
judging whether each sub-track has a reserved track change characteristic or not; if the evaluation coefficient exists, calculating a feature value of one reserved track change feature and generating the evaluation coefficient of the sub-track based on the feature value; performing characteristic correlation calculation on each track change characteristic combination corresponding to each sub-track by adopting the evaluation coefficient to obtain a track change influence factor corresponding to each characteristic change track; if not, determining a track change influence factor corresponding to each sub-track according to the cosine distance between two track change features in each track change feature combination corresponding to each sub-track;
sequencing each group of determined track change influence factors according to a sequence from small to large to obtain a track change influence sequence; determining text information of instruction analysis logic for representing corresponding target block chain nodes based on the difference value of two adjacent track change influence factors in each track change influence sequence;
generating a network parameter repairing instruction corresponding to the link point of the target block according to at least two word vectors in the extracted text information; in the process of generating the network parameter repairing instruction, the weight level of the network parameter repairing instruction is determined by the average value of the vector dimension of the word vector in parallel.
A5. The apparatus of any of A1-A4, the data determination module 310 to:
generating a first state list which is corresponding to each group of target state data and used for representing the state change degree of the target state data and a second state list which is used for representing the data reliability of the target state data; the first state list and the second state list respectively comprise a plurality of data packets with the same quantity, the compression coefficient of each data packet is different, and the compression coefficient is used for representing the data concentration of the data packets;
determining data distribution information of one data packet from a first state list corresponding to each group of target state data, and determining the data packet with the maximum compression coefficient in a second state list corresponding to each group of target state data as a reference data packet in parallel when determining the data distribution information;
mapping the data distribution information to the reference data packet and determining target distribution information of the data distribution information in the reference data packet; determining a data packet mapping matrix between the first state list and the second state list according to the target distribution information and the data distribution information; mapping one attribute field in each group of target state data to a corresponding update log according to the data packet mapping matrix to obtain a mapping field, and if the mapping field has a unique corresponding log text in the update log, determining state attribute information corresponding to the target state data and having a unique state identifier according to the log text; and if the mapping field does not have the only corresponding log text in the updating log, returning to the step of mapping one attribute field in each group of target state data to the corresponding updating log according to the data packet mapping matrix to obtain the mapping field.
A6. The apparatus of a1, the list determination module 320 to:
determining event recording information and a record generation time period of each update log, wherein the event recording information takes reference data of each group of target state data as an event trigger point and records an information set with identification as a set format character string;
determining a plurality of queue priorities based on a plurality of event queues in each set of event record information; extracting event identifiers according to effective recording time periods corresponding to the record generation time periods in the event record information by the event queues corresponding to the queue priorities to obtain a plurality of event identifiers corresponding to the queue priorities respectively, and taking the queue logic information of the queue priorities corresponding to the event identifiers as the directional logic information of the event identifiers;
determining a directional matrix between the event record information and the record generation time period according to the event identifiers, and acquiring an active coefficient of a corresponding update log represented by each directional logic information in a plurality of directional logic information corresponding to each update log; wherein the activity coefficient is used to characterize an update frequency of the update log;
under the condition that each updating log is determined to contain calibration coefficient classification based on the directivity matrix, determining active variables between each active coefficient of each updating log under the non-calibration coefficient classification and each active coefficient of each updating log under the calibration coefficient classification according to the active coefficient of each updating log under the calibration coefficient classification and the coefficient evaluation factor of the active coefficient;
transferring the active coefficient of each update log under the non-calibration coefficient classification, which is matched with the active coefficient under the calibration coefficient classification, to the calibration coefficient classification according to the active variable; under the condition that a plurality of active coefficients are contained in the non-calibration coefficient classification corresponding to each update log, determining active variables among the active coefficients of each update log in the non-calibration coefficient classification according to the active coefficients in the calibration coefficient classification of each update log and coefficient evaluation factors of the active coefficients; marking each active coefficient under the non-calibration coefficient classification based on active variables among the active coefficients to obtain at least one target active coefficient, and transferring the target active coefficient to the calibration coefficient classification;
and matching each active coefficient classified by the calibration coefficients with the determined correlation coefficient to obtain a plurality of matching results, extracting resource allocation information of each matching result relative to the node state data of the corresponding block chain node, and extracting a plurality of resource allocation lists corresponding to the node state data of each block chain node from the resource allocation information.
A7. The apparatus of a2, the list calibration module 330, configured to:
sequentially listing character codes of target state data included in the resource configuration list according to time sequence, and inquiring a code field with a formatting identification from the character codes; sequencing the coding fields according to the sequence of field widths from large to small to obtain data description values corresponding to the target state data;
serializing the data description values to obtain target sequences corresponding to the data description values, and importing the target sequences into target list units in a target resource configuration list with the maximum list structure similarity value of the resource configuration list to obtain mapping description values corresponding to the data description values;
calculating a consistency comparison result of the characters of the data description value and the mapping description value on each same character bit, and determining a difference coefficient of the data description value and the mapping description value according to a proportion of the consistency comparison result, which represents a comparison result that the characters of the data description value and the mapping description value on each same character bit are different;
determining the target quantity for calibrating the block link points according to the numerical value interval of the difference coefficient; wherein the numerical interval comprises a plurality of consecutive sub-intervals;
determining the list concentration of each resource configuration list corresponding to each block chain link point, calculating the mean value of the list concentration, and calibrating the corresponding resource configuration lists in sequence according to the sequence from small to large of the difference value of each list concentration and the mean value until the calibrated accumulated number of the resource configuration lists to be processed reaches the target number.
Based on the same inventive concept, a communication data processing system incorporating a blockchain payment network is also provided, and a detailed description of the system is as follows.
B1. A communication data processing system in conjunction with a blockchain payment network, comprising a big data server and a plurality of blockchain nodes, the big data server in communication with the plurality of blockchain nodes, the big data server to:
extracting each group of target state data with data updating behavior in a set time length from the node state data corresponding to each block chain node, determining an updating log corresponding to each group of target state data from a preset database, and determining state attribute information of each group of target state data with a unique state identifier in the corresponding updating log;
determining a plurality of resource configuration lists corresponding to the node state data of each block chain node based on the update logs corresponding to each group of target state data of the node state data and the correlation coefficient between each two groups of target state data determined according to the state attribute information; each resource configuration list comprises data description values corresponding to at least one group of target state data;
for each resource configuration list of each block chain node, determining a mapping description value of a data description value corresponding to target state data included in the resource configuration list in a target resource configuration list with the maximum similarity value with the list structure of the resource configuration list, and calibrating at least part of the resource configuration list in each block chain node according to a difference coefficient between the data description value and the mapping description value corresponding to the data description value to obtain a resource configuration list to be processed;
counting the occupation ratio of the resource allocation list to be processed corresponding to each block link point in all the resource allocation lists of the block link node, and determining the block link point with the occupation ratio reaching a set value as a target block link node with a protocol verification-free function between the block link point and the big data server;
and generating network parameter repairing instructions corresponding to the link points of the target block and issuing the network parameter repairing instructions one by one.
B2. The system as set forth in claim B1,
the big data server is specifically configured to:
extracting network state characteristics in node state data of each target block chain node, and generating a network parameter repairing instruction corresponding to the target block chain node according to the network state characteristics and a parameter change track determined from an interface parameter record corresponding to the target block chain node;
sending the network parameter repairing instruction to a corresponding target block chain node;
the target block chain node is specifically configured to:
repairing the network environment parameters when the network environment of the blockchain payment network is disturbed based on the network parameter repairing instruction; and each target block chain node is pre-configured with a self-adaptive recovery program, and the weight grades of the network parameter repair instructions corresponding to different target block chain nodes are different.
B3. The system according to B2, wherein the big data server is specifically configured to:
determining interval identification information of a plurality of track intervals of the parameter change track to be split and interval association degrees among different track intervals based on the first state feature array and the second state feature array of the network state features;
based on the determined section identification information of the plurality of track sections and the section association degrees between different track sections, removing the plurality of track sections, so that the confidence degree of the section identification information of the reserved track sections is greater than a first preset value, and the section association degrees between the reserved track sections are greater than a second preset value;
splitting the parameter change track according to the reserved track interval to obtain a plurality of sub tracks, extracting a track change influence factor corresponding to each sub track, combining the track change influence factors into a track change influence sequence, and generating a network parameter restoration instruction corresponding to the link point of the target block based on the track change influence sequence; wherein different track change influence sequences correspond to different weight levels.
B4. The system according to B3, wherein the big data server is specifically configured to:
the track description information of each sub-track is imported into a preset list, the track change characteristic of each sub-track is extracted based on the list structure of the preset list and the position of the description information corresponding to each sub-track in the preset list, and a characteristic identifier is added to each track change characteristic according to the track weight of each sub-track relative to the parameter change track; the feature identifiers have a hierarchical relationship from large to small;
for each track change feature, sequentially determining track change features corresponding to second feature identifiers with highest identifier association degree between first feature identifiers of each track change feature according to the sequence of the feature identifiers from large to small, and determining the track change features corresponding to the first feature identifiers and the track change features corresponding to the second feature identifiers to be a group of track change feature combinations; the track change features which are determined to be the track change feature combination are not judged according to the sequence of the feature identifications from large to small, and the track change features corresponding to the second feature identifications with the highest identification association degree between the first feature identifications of each track change feature are determined in sequence;
judging whether each sub-track has a reserved track change characteristic or not; if the evaluation coefficient exists, calculating a feature value of one reserved track change feature and generating the evaluation coefficient of the sub-track based on the feature value; performing characteristic correlation calculation on each track change characteristic combination corresponding to each sub-track by adopting the evaluation coefficient to obtain a track change influence factor corresponding to each characteristic change track; if not, determining a track change influence factor corresponding to each sub-track according to the cosine distance between two track change features in each track change feature combination corresponding to each sub-track;
sequencing each group of determined track change influence factors according to a sequence from small to large to obtain a track change influence sequence; determining text information of instruction analysis logic for representing corresponding target block chain nodes based on the difference value of two adjacent track change influence factors in each track change influence sequence;
generating a network parameter repairing instruction corresponding to the link point of the target block according to at least two word vectors in the extracted text information; in the process of generating the network parameter repairing instruction, the weight level of the network parameter repairing instruction is determined by the average value of the vector dimension of the word vector in parallel.
B5. The system of any one of B1-B4, the big data server, in particular, to:
generating a first state list which is corresponding to each group of target state data and used for representing the state change degree of the target state data and a second state list which is used for representing the data reliability of the target state data; the first state list and the second state list respectively comprise a plurality of data packets with the same quantity, the compression coefficient of each data packet is different, and the compression coefficient is used for representing the data concentration of the data packets;
determining data distribution information of one data packet from a first state list corresponding to each group of target state data, and determining the data packet with the maximum compression coefficient in a second state list corresponding to each group of target state data as a reference data packet in parallel when determining the data distribution information;
mapping the data distribution information to the reference data packet and determining target distribution information of the data distribution information in the reference data packet; determining a data packet mapping matrix between the first state list and the second state list according to the target distribution information and the data distribution information; mapping one attribute field in each group of target state data to a corresponding update log according to the data packet mapping matrix to obtain a mapping field, and if the mapping field has a unique corresponding log text in the update log, determining state attribute information corresponding to the target state data and having a unique state identifier according to the log text; and if the mapping field does not have the only corresponding log text in the updating log, returning to the step of mapping one attribute field in each group of target state data to the corresponding updating log according to the data packet mapping matrix to obtain the mapping field.
B6. The system according to B1, wherein the big data server is specifically configured to:
determining event recording information and a record generation time period of each update log, wherein the event recording information takes reference data of each group of target state data as an event trigger point and records an information set with identification as a set format character string;
determining a plurality of queue priorities based on a plurality of event queues in each set of event record information; extracting event identifiers according to effective recording time periods corresponding to the record generation time periods in the event record information by the event queues corresponding to the queue priorities to obtain a plurality of event identifiers corresponding to the queue priorities respectively, and taking the queue logic information of the queue priorities corresponding to the event identifiers as the directional logic information of the event identifiers;
determining a directional matrix between the event record information and the record generation time period according to the event identifiers, and acquiring an active coefficient of a corresponding update log represented by each directional logic information in a plurality of directional logic information corresponding to each update log; wherein the activity coefficient is used to characterize an update frequency of the update log;
under the condition that each updating log is determined to contain calibration coefficient classification based on the directivity matrix, determining active variables between each active coefficient of each updating log under the non-calibration coefficient classification and each active coefficient of each updating log under the calibration coefficient classification according to the active coefficient of each updating log under the calibration coefficient classification and the coefficient evaluation factor of the active coefficient;
transferring the active coefficient of each update log under the non-calibration coefficient classification, which is matched with the active coefficient under the calibration coefficient classification, to the calibration coefficient classification according to the active variable; under the condition that a plurality of active coefficients are contained in the non-calibration coefficient classification corresponding to each update log, determining active variables among the active coefficients of each update log in the non-calibration coefficient classification according to the active coefficients in the calibration coefficient classification of each update log and coefficient evaluation factors of the active coefficients; marking each active coefficient under the non-calibration coefficient classification based on active variables among the active coefficients to obtain at least one target active coefficient, and transferring the target active coefficient to the calibration coefficient classification;
and matching each active coefficient classified by the calibration coefficients with the determined correlation coefficient to obtain a plurality of matching results, extracting resource allocation information of each matching result relative to the node state data of the corresponding block chain node, and extracting a plurality of resource allocation lists corresponding to the node state data of each block chain node from the resource allocation information.
B7. The system according to B2, wherein the big data server is specifically configured to:
sequentially listing character codes of target state data included in the resource configuration list according to time sequence, and inquiring a code field with a formatting identification from the character codes; sequencing the coding fields according to the sequence of field widths from large to small to obtain data description values corresponding to the target state data;
serializing the data description values to obtain target sequences corresponding to the data description values, and importing the target sequences into target list units in a target resource configuration list with the maximum list structure similarity value of the resource configuration list to obtain mapping description values corresponding to the data description values;
calculating a consistency comparison result of the characters of the data description value and the mapping description value on each same character bit, and determining a difference coefficient of the data description value and the mapping description value according to a proportion of the consistency comparison result, which represents a comparison result that the characters of the data description value and the mapping description value on each same character bit are different;
determining the target quantity for calibrating the block link points according to the numerical value interval of the difference coefficient; wherein the numerical interval comprises a plurality of consecutive sub-intervals;
determining the list concentration of each resource configuration list corresponding to each block chain link point, calculating the mean value of the list concentration, and calibrating the corresponding resource configuration lists in sequence according to the sequence from small to large of the difference value of each list concentration and the mean value until the calibrated accumulated number of the resource configuration lists to be processed reaches the target number.
On the basis, please refer to fig. 4 in combination, which also provides a schematic diagram of a hardware structure of the big data server 210, where the big data server 210 includes a processor 211, and a memory 212 and a network interface 213 connected to the processor 211; the network interface 213 is connected with the nonvolatile memory 240 in the big data server 210; the processor 211, when running, retrieves a computer program from the non-volatile memory 214 via the network interface 213 and runs the computer program via the memory 212 to perform the above-described method.
On the basis of the above, a computer readable storage medium is also provided, on which a computer program is stored, which when run in the memory 212 of the big data server 210 performs the above-mentioned method.

Claims (6)

1. A communication data processing method in conjunction with a blockchain payment network, applied to a big data server in communication with a plurality of blockchain nodes, the method comprising at least the steps of:
extracting each group of target state data with data updating behavior in a set time length from the node state data corresponding to each block chain node, determining an updating log corresponding to each group of target state data from a preset database, and determining state attribute information of each group of target state data with a unique state identifier in the corresponding updating log;
wherein:
the node state data is used for representing the communication interaction state of the block chain nodes;
the set time length is adjusted according to the number of the block chain nodes communicated with the big data server;
the preset database is a database used by a big data server for storing communication records with each block chain node;
determining a plurality of resource configuration lists corresponding to the node state data of each block chain node based on the update logs corresponding to each group of target state data of the node state data and the correlation coefficient between each two groups of target state data determined according to the state attribute information; each resource configuration list comprises data description values corresponding to at least one group of target state data;
for each resource configuration list of each block chain node, determining a mapping description value of a data description value corresponding to target state data included in the resource configuration list in a target resource configuration list with the maximum similarity value with the list structure of the resource configuration list, and calibrating at least part of the resource configuration list in each block chain node according to a difference coefficient between the data description value and the mapping description value corresponding to the data description value to obtain a resource configuration list to be processed;
counting the occupation ratio of the resource allocation list to be processed corresponding to each block link point in all the resource allocation lists of the block link node, and determining the block link point with the occupation ratio reaching a set value as a target block link node with a protocol verification-free function between the block link point and the big data server;
and generating network parameter repairing instructions corresponding to the link points of the target block and issuing the network parameter repairing instructions one by one.
2. The method of claim 1, wherein generating and issuing network parameter repair commands corresponding to target block link points one by one comprises:
extracting network state characteristics in node state data of each target block chain node, and generating a network parameter repairing instruction corresponding to the target block chain node according to the network state characteristics and a parameter change track determined from an interface parameter record corresponding to the target block chain node;
issuing the network parameter repairing instruction to a corresponding target block chain node so that the target block chain node can repair the network environment parameter when the network environment of the block chain payment network is disturbed based on the network parameter repairing instruction; and each target block chain node is pre-configured with a self-adaptive recovery program, and the weight grades of the network parameter repair instructions corresponding to different target block chain nodes are different.
3. The method according to claim 2, wherein generating a network parameter repair instruction corresponding to the target block link point according to the network status feature and a parameter change trajectory determined from an interface parameter record corresponding to the target block link point specifically includes:
determining interval identification information of a plurality of track intervals of the parameter change track to be split and interval association degrees among different track intervals based on the first state feature array and the second state feature array of the network state features;
based on the determined section identification information of the plurality of track sections and the section association degrees between different track sections, removing the plurality of track sections, so that the confidence degree of the section identification information of the reserved track sections is greater than a first preset value, and the section association degrees between the reserved track sections are greater than a second preset value;
splitting the parameter change track according to the reserved track interval to obtain a plurality of sub tracks, extracting a track change influence factor corresponding to each sub track, combining the track change influence factors into a track change influence sequence, and generating a network parameter restoration instruction corresponding to the link point of the target block based on the track change influence sequence; wherein different track change influence sequences correspond to different weight levels.
4. The method according to claim 3, wherein extracting a trajectory change influence factor corresponding to each sub-trajectory, combining the trajectory change influence factors into a trajectory change influence sequence, and generating a network parameter repair instruction corresponding to the link point of the target block based on the trajectory change influence sequence specifically includes:
the track description information of each sub-track is imported into a preset list, the track change characteristic of each sub-track is extracted based on the list structure of the preset list and the position of the description information corresponding to each sub-track in the preset list, and a characteristic identifier is added to each track change characteristic according to the track weight of each sub-track relative to the parameter change track; the feature identifiers have a hierarchical relationship from large to small;
for each track change feature, sequentially determining track change features corresponding to second feature identifiers with highest identifier association degree between first feature identifiers of each track change feature according to the sequence of the feature identifiers from large to small, and determining the track change features corresponding to the first feature identifiers and the track change features corresponding to the second feature identifiers to be a group of track change feature combinations; the track change features which are determined to be the track change feature combination are not judged according to the sequence of the feature identifications from large to small, and the track change features corresponding to the second feature identifications with the highest identification association degree between the first feature identifications of each track change feature are determined in sequence;
judging whether each sub-track has a reserved track change characteristic or not; if the evaluation coefficient exists, calculating a feature value of one reserved track change feature and generating the evaluation coefficient of the sub-track based on the feature value; performing characteristic correlation calculation on each track change characteristic combination corresponding to each sub-track by adopting the evaluation coefficient to obtain a track change influence factor corresponding to each characteristic change track; if not, determining a track change influence factor corresponding to each sub-track according to the cosine distance between two track change features in each track change feature combination corresponding to each sub-track;
sequencing each group of determined track change influence factors according to a sequence from small to large to obtain a track change influence sequence; determining text information of instruction analysis logic for representing corresponding target block chain nodes based on the difference value of two adjacent track change influence factors in each track change influence sequence;
generating a network parameter repairing instruction corresponding to the link point of the target block according to at least two word vectors in the extracted text information; in the process of generating the network parameter repairing instruction, the weight level of the network parameter repairing instruction is determined by the average value of the vector dimension of the word vector in parallel.
5. The method according to any one of claims 1 to 4, wherein determining that each set of target state data has state attribute information of a unique state identifier in a corresponding update log specifically includes:
generating a first state list which is corresponding to each group of target state data and used for representing the state change degree of the target state data and a second state list which is used for representing the data reliability of the target state data; the first state list and the second state list respectively comprise a plurality of data packets with the same quantity, the compression coefficient of each data packet is different, and the compression coefficient is used for representing the data concentration of the data packets;
determining data distribution information of one data packet from a first state list corresponding to each group of target state data, and determining the data packet with the maximum compression coefficient in a second state list corresponding to each group of target state data as a reference data packet in parallel when determining the data distribution information;
mapping the data distribution information to the reference data packet and determining target distribution information of the data distribution information in the reference data packet; determining a data packet mapping matrix between the first state list and the second state list according to the target distribution information and the data distribution information; mapping one attribute field in each group of target state data to a corresponding update log according to the data packet mapping matrix to obtain a mapping field, and if the mapping field has a unique corresponding log text in the update log, determining state attribute information corresponding to the target state data and having a unique state identifier according to the log text; and if the mapping field does not have the only corresponding log text in the updating log, returning to the step of mapping one attribute field in each group of target state data to the corresponding updating log according to the data packet mapping matrix to obtain the mapping field.
6. A big data server, comprising:
a processor, and
a memory and a network interface connected with the processor;
the network interface is connected with a nonvolatile memory in the big data server;
the processor, when running, retrieves a computer program from the non-volatile memory via the network interface and runs the computer program via the memory to perform the method of any of claims 1-5.
CN202110048604.3A 2020-07-02 2020-07-02 Communication data processing method combined with block chain payment network and big data server Withdrawn CN112866374A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110048604.3A CN112866374A (en) 2020-07-02 2020-07-02 Communication data processing method combined with block chain payment network and big data server

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110048604.3A CN112866374A (en) 2020-07-02 2020-07-02 Communication data processing method combined with block chain payment network and big data server
CN202010633801.7A CN111784319B (en) 2020-07-02 2020-07-02 Communication data processing method based on block chain payment network and big data server

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
CN202010633801.7A Division CN111784319B (en) 2020-07-02 2020-07-02 Communication data processing method based on block chain payment network and big data server

Publications (1)

Publication Number Publication Date
CN112866374A true CN112866374A (en) 2021-05-28

Family

ID=72758771

Family Applications (3)

Application Number Title Priority Date Filing Date
CN202110048604.3A Withdrawn CN112866374A (en) 2020-07-02 2020-07-02 Communication data processing method combined with block chain payment network and big data server
CN202110050073.1A Withdrawn CN112766949A (en) 2020-07-02 2020-07-02 Communication data processing method and system based on block chain payment network
CN202010633801.7A Active CN111784319B (en) 2020-07-02 2020-07-02 Communication data processing method based on block chain payment network and big data server

Family Applications After (2)

Application Number Title Priority Date Filing Date
CN202110050073.1A Withdrawn CN112766949A (en) 2020-07-02 2020-07-02 Communication data processing method and system based on block chain payment network
CN202010633801.7A Active CN111784319B (en) 2020-07-02 2020-07-02 Communication data processing method based on block chain payment network and big data server

Country Status (1)

Country Link
CN (3) CN112866374A (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114238493B (en) * 2021-11-08 2022-09-13 苏州纳故环保科技有限公司 Block chain data processing method and system based on resource recovery platform

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10477024B1 (en) * 2017-05-30 2019-11-12 United Services Automobile Association (Usaa) Dynamic resource allocation
WO2019114934A1 (en) * 2017-12-12 2019-06-20 Motorola Mobility Llc Providing network access using blockchain payments
CN108509628B (en) * 2018-04-08 2022-03-29 腾讯科技(深圳)有限公司 Database configuration method and device, computer equipment and storage medium
KR102062644B1 (en) * 2018-06-18 2020-01-06 임권택 System and method for management of collective building
KR20200038712A (en) * 2018-10-04 2020-04-14 동서대학교 산학협력단 Transaction Method of Encryption Transaction System Using Block Chain
JP6732321B2 (en) * 2018-12-13 2020-07-29 アリババ・グループ・ホールディング・リミテッドAlibaba Group Holding Limited Execution of recovery processing for network nodes in distributed systems
CN110138596A (en) * 2019-04-13 2019-08-16 山东公链信息科技有限公司 A kind of block chain common recognition method based on handover network topology mode
CN110417872B (en) * 2019-07-08 2022-04-29 深圳供电局有限公司 Edge network resource allocation method facing mobile block chain
CN111198922B (en) * 2020-01-02 2023-04-18 腾讯科技(深圳)有限公司 Game resource management method and device based on block chain

Also Published As

Publication number Publication date
CN111784319B (en) 2021-07-27
CN112766949A (en) 2021-05-07
CN111784319A (en) 2020-10-16

Similar Documents

Publication Publication Date Title
CN108876213B (en) Block chain-based product management method, device, medium and electronic equipment
CN111444956B (en) Low-load information prediction method, device, computer system and readable storage medium
CN113515368A (en) Data integration method combining big data and edge calculation and storage medium
CN111145006A (en) Automobile financial anti-fraud model training method and device based on user portrait
CN111881164B (en) Data processing method based on edge computing and path analysis and big data cloud platform
CN113332729A (en) Cloud game vulnerability detection method based on deep learning and artificial intelligence server
CN112883990A (en) Data classification method and device, computer storage medium and electronic equipment
CN113239702A (en) Intention recognition method and device and electronic equipment
CN111784319B (en) Communication data processing method based on block chain payment network and big data server
CN113472860A (en) Service resource allocation method and server under big data and digital environment
CN111949720B (en) Data analysis method based on big data and artificial intelligence and cloud data server
CN113723555A (en) Abnormal data detection method and device, storage medium and terminal
CN112668857A (en) Data classification method, device, equipment and storage medium for grading quality inspection
CN112434651A (en) Information analysis method and device based on image recognition and computer equipment
CN116257885A (en) Private data communication method, system and computer equipment based on federal learning
CN116245630A (en) Anti-fraud detection method and device, electronic equipment and medium
CN112463964B (en) Text classification and model training method, device, equipment and storage medium
CN109978038B (en) Cluster abnormity judgment method and device
CN113591881A (en) Intention recognition method and device based on model fusion, electronic equipment and medium
Asilkalkan et al. Matrix‐variate time series modelling with hidden Markov models
CN116843432B (en) Anti-fraud method and device based on address text information
CN111369352B (en) Joint modeling method, apparatus, and medium
CN117034048A (en) Abnormal user identification method, device, computer equipment and medium
CN117014160A (en) Asset threat prediction method, system, device and product
CN117615359A (en) Bluetooth data transmission method and system based on multiple rule engines

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WW01 Invention patent application withdrawn after publication

Application publication date: 20210528

WW01 Invention patent application withdrawn after publication