CN115796889B - Data processing method suitable for trading platform - Google Patents
Data processing method suitable for trading platform Download PDFInfo
- Publication number
- CN115796889B CN115796889B CN202310031266.1A CN202310031266A CN115796889B CN 115796889 B CN115796889 B CN 115796889B CN 202310031266 A CN202310031266 A CN 202310031266A CN 115796889 B CN115796889 B CN 115796889B
- Authority
- CN
- China
- Prior art keywords
- transaction
- verification
- node
- nodes
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 17
- 238000012795 verification Methods 0.000 claims abstract description 356
- 238000000034 method Methods 0.000 claims abstract description 15
- 239000000284 extract Substances 0.000 claims description 8
- 238000012163 sequencing technique Methods 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000004927 fusion Effects 0.000 claims description 4
- 230000003993 interaction Effects 0.000 claims description 4
- 230000006399 behavior Effects 0.000 description 18
- 238000012550 audit Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 3
- 238000004590 computer program Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Abstract
The invention provides a data processing method suitable for a trading platform, which comprises the following steps: the method comprises the steps that a verification server obtains first transaction request data sent by a first transaction request end; determining a transaction structure tree corresponding to the first transaction request terminal according to the first transaction identity information; extracting other second transaction nodes except the first transaction node in the second transaction verification branch, and generating a transaction verification path according to the connection relation among all the second transaction nodes in the second transaction verification branch; the verification server sequentially sends the first transaction target information to first transaction verification ends corresponding to the second transaction nodes according to a transaction verification path, and after all the first transaction verification ends are judged to feed back verification passing information, the verification server adds a verification completion label to the first transaction link information; and the transaction server completes the transaction of the first transaction request end to the first transaction target information based on the first transaction link information.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a data processing method suitable for a trading platform.
Background
With the development of big data, the processing of enterprise data can also be managed with big data. In practical application, when the number of personnel in an enterprise is large, the transaction data volume is large and complex, the transaction data can be passed through application only by checking, otherwise, economic loss is brought to the enterprise.
In the prior art, enterprises do not have a uniform auditing management method for transaction data, so that transaction information corresponding to the transaction data cannot be automatically audited and verified. Therefore, how to realize automatic auditing by combining different attributes of transaction personnel and transaction information becomes an urgent problem to be solved.
Disclosure of Invention
The embodiment of the invention provides a data processing method suitable for a trading platform, which can automatically form an auditing strategy by combining different attributes of trading personnel and trading information, and realize automatic auditing of trading data according to the auditing strategy.
In a first aspect of embodiments of the present invention, a data processing method suitable for a trading platform is provided, including:
the method comprises the steps that a verification server obtains first transaction request data sent by a first transaction request end, wherein the first transaction request data at least comprise first transaction identity information, first transaction target information and first transaction link information;
determining a transaction structure tree corresponding to a first transaction request end according to the first transaction identity information, wherein the transaction structure tree comprises a plurality of transaction nodes corresponding to the transaction identity information, and the first transaction node corresponding to the first transaction target information in the transaction structure tree is determined;
determining a first transaction verification branch formed from the position of the first node to the position of a target node of a target transaction node according to the position of the first node where the first transaction node is located, and intercepting the first transaction verification branch according to a verification strategy corresponding to the first transaction request terminal and/or first transaction target information to obtain a second transaction verification branch;
extracting other second transaction nodes except the first transaction node in the second transaction verification branch, and generating a transaction verification path according to the connection relation between all the second transaction nodes in the second transaction verification branch;
the verification server sequentially sends the first transaction target information to first transaction verification ends corresponding to second transaction nodes according to the transaction verification path, and after all the first transaction verification ends are judged to feed back verification passing information, the verification server adds a verification completion label to the first transaction link information;
and the verification server sends the first transaction link information added with the verification completion tag to the transaction server, and the transaction server completes the transaction of the first transaction request end to the first transaction target information based on the first transaction link information.
Optionally, in a possible implementation manner of the first aspect, the receiving, by the authentication server, first transaction request data sent by a first transaction request end, where the first transaction request data at least includes first transaction identity information, first transaction target information, and first transaction link information, and the receiving includes:
the first transaction request end carries out data interaction with the transaction server, and at least one transaction commodity is selected in the transaction server to obtain corresponding first transaction target information;
the first transaction request terminal generates corresponding first transaction link information according to the webpage link corresponding to the first transaction target information;
the first transaction request end extracts corresponding first transaction identity information, first transaction target information and first transaction link information and sends the first transaction identity information, the first transaction target information and the first transaction link information to the verification server.
Optionally, in a possible implementation manner of the first aspect, the determining, according to the first transaction identity information, a transaction structure tree corresponding to a first transaction request end, where the transaction structure tree includes a plurality of transaction nodes corresponding to the transaction identity information, and the determining a first transaction node corresponding to the first transaction target information in the transaction structure tree includes:
extracting first company labels included in the first transaction identity information, and determining a transaction structure tree corresponding to a first transaction request end according to the first company labels, wherein each first company label has a corresponding transaction structure tree;
extracting a first department label in the first transaction identity information, and determining a structural tree sub-region corresponding to the first department label in the transaction structural tree, wherein the structural tree sub-region is composed of transaction nodes corresponding to the first department label, and each transaction node is provided with a corresponding preset department label;
and traversing the identity information of all transaction nodes in the sub-area of the structure tree, and determining the transaction node of the identity information corresponding to the first transaction target information as a first transaction node.
Optionally, in a possible implementation manner of the first aspect, the traversing identity information of all transaction nodes in the sub-region of the structure tree, and determining a transaction node of the identity information corresponding to the first transaction target information as the first transaction node includes:
sequentially extracting transaction nodes of different levels in the sub-area of the structure tree to obtain transaction node subsets, wherein each transaction node subset corresponds to all transaction nodes of different levels;
calling a dynamic hierarchical structure sequence corresponding to the sub-regions of the structure tree, and sequencing all transaction node subsets in sequence according to the dynamic hierarchical structure sequence to obtain a subset sequence;
fusing all transaction nodes of different levels according to the sequence of all transaction nodes in the subset sequence to obtain a transaction node total set;
traversing the identity information of all transaction nodes in the transaction node total set according to the sequence of the transaction nodes in the transaction node total set, and determining the transaction node of the identity information corresponding to the first transaction target information as a first transaction node;
and dynamically updating the dynamic hierarchical structure sequence according to the hierarchy corresponding to the first transaction node.
Optionally, in a possible implementation manner of the first aspect, the dynamically updating a dynamic hierarchical structure order according to a hierarchy corresponding to the first transaction node includes:
calling preset behavior storage information corresponding to the sub-region of the structure tree, wherein the preset behavior storage information has the times of first transaction nodes corresponding to each hierarchy in each traversal;
updating the preset behavior storage information according to the corresponding hierarchy of the last first transaction node, and determining the time weight corresponding to each first transaction node according to the traversed time of each first transaction node;
calculating the times and time weights of the first transaction nodes corresponding to each level in the updated preset behavior storage information to obtain a sorting coefficient, and performing descending sorting on each level in the structural tree subareas based on the sorting coefficient to obtain the dynamic hierarchical structure sequence after the structural tree subareas are updated.
Optionally, in a possible implementation manner of the first aspect, the calculating, according to the number of times and time weight of the first transaction node corresponding to each level in the updated preset behavior storage information, to obtain a ranking coefficient, and performing descending ranking on each level in the sub-regions of the structure tree based on the ranking coefficient to obtain the updated dynamic hierarchical structure sequence of the sub-regions of the structure tree, includes:
extracting all first transaction nodes positioned in a preset time period in the preset behavior storage information;
calculating the times of the first transaction nodes corresponding to each hierarchy within a preset time period in the updated preset behavior storage information to obtain a time coefficient, and calculating the time coefficient according to the time weight of the first transaction nodes traversed each time;
performing fusion calculation according to the time coefficient and the time coefficient to obtain a ranking coefficient formed by all the first transaction nodes in the corresponding hierarchy, calculating the ranking coefficient by the following formula,
wherein, the first and the second end of the pipe are connected with each other,
is the first->
Sorting factor formed by all first transaction nodes in a hierarchy->
Is the first->
Number of times corresponding to a first transaction node within an individual level>
For a predetermined number of times constant value>
Is the first->
On a number of levels>
Time weighting of a first transaction node @>
Is the first->
An upper limit value for a first transaction node in a hierarchy>
Is a preset time constant value.
Optionally, in a possible implementation manner of the first aspect, the determining, according to a location of a first node where the first transaction node is located, a first transaction verification branch formed from the location of the first node to a location of a target node of a target transaction node, and intercepting, according to a verification policy corresponding to the first transaction request end and/or the first transaction target information, the first transaction verification branch to obtain a second transaction verification branch includes:
determining a target node position of a target transaction node, wherein the target transaction node is a transaction node with the highest dimensionality in a transaction structure tree, and connecting the first node position with the target node position to generate a corresponding first transaction verification branch;
if the verification strategy corresponding to the first transaction request end exists, extracting the number of first verification nodes and/or first preset verification nodes in the verification strategy;
if the verification strategy corresponding to the first transaction target information exists, extracting the number of second verification nodes and/or second preset verification nodes in the verification strategy;
and determining the corresponding third verification node quantity according to the first verification node quantity and the second verification node quantity, and generating a second transaction verification branch according to the third verification node quantity, the first preset verification node and the second preset verification node.
Optionally, in a possible implementation manner of the first aspect, the determining, according to the first verification node number and the second verification node number, a corresponding third verification node number, and generating a second transaction verification branch according to the third verification node number, the first preset verification node, and the second preset verification node includes:
if only one of the first verification node quantity or the second verification node quantity exists, taking the corresponding first verification node quantity or second verification node quantity as a third verification node quantity;
if the first verification node number and the second verification node number exist at the same time, the first verification node number or the second verification node number with the larger node number is used as a third verification node number;
and if the first verification node number and the second verification node number do not exist, or the first verification node number and the second verification node number are respectively 0, generating a third verification node number which is a preset number.
Optionally, in a possible implementation manner of the first aspect, the determining, according to the first verification node number and the second verification node number, a corresponding third verification node number, and generating a second transaction verification branch according to the first verification node number, the first preset verification node, the second verification node number, and the second preset verification node, includes:
selecting second transaction nodes corresponding to the number of the third verification nodes from the first transaction verification branch circuit by taking the first transaction node as a starting point to obtain a first part of second transaction verification branch circuits;
directly connecting the first preset verification node and/or the second preset verification node with the first transaction node to obtain a second transaction verification branch of the second part;
and counting the second transaction verification branch of the first part and the second transaction verification branch of the second part to generate a final second transaction verification branch.
Optionally, in a possible implementation manner of the first aspect, the extracting other second transaction nodes in the second transaction verification branch except the first transaction node, and generating a transaction verification path according to a connection relationship between all second transaction nodes in the second transaction verification branch includes:
and determining other second transaction nodes directly connected with the first transaction node, and generating at least one transaction verification path according to the positions of all other second transaction nodes in the second transaction verification branch, wherein the second transaction verification branch of each first part and the second transaction verification branch of each second part respectively correspond to different transaction verification paths.
Has the advantages that:
1. the scheme can automatically analyze the transaction request data, automatically generate a verification transaction branch according to corresponding strategies according to the analyzed information, form a transaction verification path by combining the verification transaction branch, and finally automatically complete the verification of the transaction by utilizing the verification server according to the transaction verification path, thereby realizing the automatic analysis and verification of the whole transaction flow. The scheme can automatically form an audit strategy by combining different attributes of transaction personnel and transaction information, and automatically audit the transaction data according to the audit strategy.
2. In the process of generating the verification transaction branch, a first transaction verification branch in a large range is generated firstly, and then the first transaction verification branch is intercepted and adjusted by combining a relevant strategy, so that a required second transaction verification branch can be obtained. In the process of traversing to obtain the first transaction node, the nodes of the hierarchy dimension are sorted by combining with the dynamic hierarchy structure sequence, in the process, the sorting coefficient is comprehensively calculated by combining with the time dimension and the number dimension, and through the mode, the data processing amount in the traversing process can be reduced, and the traversing efficiency is improved.
3. According to the scheme, the verification transaction branch can obtain different first transaction verification branches of the first part and second transaction verification branches of the second part by combining the number of the nodes and the preset verification nodes, so that the obtained transaction verification branches can meet the policy requirements of users.
Drawings
Fig. 1 is a schematic flowchart of a data processing method suitable for a trading platform according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The technical solution of the present invention will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
Referring to fig. 1, which is a schematic flow chart of a data processing method suitable for a trading platform according to an embodiment of the present invention, the data processing method suitable for the trading platform includes S1 to S6:
s1, a verification server obtains first transaction request data sent by a first transaction request end, wherein the first transaction request data at least comprise first transaction identity information, first transaction target information and first transaction link information.
It can be understood that, when the first transaction request end carries out a transaction, the first transaction request end generates first transaction request data and then sends the first transaction request data to the verification server for processing. The first transaction identity information in the first transaction request data may be identity information of a holding first transaction request end, the first transaction target information may be a commodity of a transaction, and the first transaction link information may be a link corresponding to a transaction target, for example, a transaction link corresponding to an online transaction platform, such as a kyoto transaction link, a naobao transaction link, and the like.
In some embodiments, S1 (the verification server receives first transaction request data sent by the first transaction requesting terminal, where the first transaction request data includes at least first transaction identity information, first transaction target information, and first transaction link information), includes S11-S13:
s11, the first transaction request end and the transaction server perform data interaction, and at least one transaction commodity is selected in the transaction server to obtain corresponding first transaction target information.
The first transaction request end of the scheme can perform data interaction with the transaction server, and at least one transaction commodity is selected in the transaction server to obtain corresponding first transaction target information.
And S12, the first transaction request terminal generates corresponding first transaction link information according to the webpage link corresponding to the first transaction target information.
After the first transaction target information is obtained, the corresponding first transaction link information, for example, the purchase link information, may be generated by using the web page link corresponding to the first transaction target information.
And S13, the first transaction request terminal extracts the corresponding first transaction identity information, the first transaction target information and the first transaction link information and sends the first transaction identity information, the first transaction target information and the first transaction link information to the verification server.
The first transaction request end of the scheme can extract corresponding first transaction identity information, first transaction target information and first transaction link information and send the first transaction identity information, the first transaction target information and the first transaction link information to the verification server.
S2, determining a transaction structure tree corresponding to a first transaction request end according to the first transaction identity information, wherein the transaction structure tree comprises a plurality of transaction nodes corresponding to the transaction identity information, and determining a first transaction node corresponding to the first transaction target information in the transaction structure tree.
In the scheme, the transaction structure tree corresponding to the first transaction request end is determined by using the first transaction identity information, wherein the transaction structure tree comprises a plurality of transaction nodes corresponding to the transaction identity information, and the first transaction node corresponding to the first transaction target information in the transaction structure tree is determined. The transaction nodes in the transaction structure tree may correspond to nodes of auditors inside a company, and one auditor may correspond to one transaction node.
In some embodiments, S2 (determining, according to the first transaction identity information, a transaction structure tree corresponding to a first transaction request end, where the transaction structure tree includes a plurality of transaction nodes corresponding to the transaction identity information, and determining a first transaction node corresponding to the first transaction target information in the transaction structure tree), includes S21-S23:
s21, extracting first company labels included in the first transaction identity information, and determining a transaction structure tree corresponding to a first transaction request end according to the first company labels, wherein each first company label has a corresponding transaction structure tree.
The first transaction identity information in the scheme comprises company information of corresponding transaction personnel, so that the scheme can extract a first company label in the first transaction identity information, and different companies correspondingly have different transaction structure trees.
After the first company label is obtained, the corresponding transaction structure tree can be found according to the first company label.
And S22, extracting a first department label in the first transaction identity information, and determining a structural tree sub-region corresponding to the first department label in the transaction structural tree, wherein the structural tree sub-region is composed of transaction nodes corresponding to the first department label, and each transaction node is provided with a corresponding preset department label.
The scheme also extracts the department information corresponding to the first transaction identity information to obtain a first department label, and then finds the sub-region of the structure tree corresponding to the first department label in the transaction structure tree. It is worth mentioning that each trading node has a department tag set correspondingly in advance.
The sub-region of the structure tree is composed of trading nodes corresponding to the first department label, that is, the trading nodes in the sub-region of the structure tree correspond to the first department label and belong to the same department.
And S23, traversing the identity information of all the transaction nodes in the sub-area of the structure tree, and determining the transaction node of the identity information corresponding to the first transaction target information as a first transaction node.
According to the scheme, the plurality of transaction nodes in the sub-area of the structure tree are traversed, and the transaction node of the identity information corresponding to the first transaction target information is found to be used as the first transaction node.
In some embodiments, S23 (traversing the identity information of all transaction nodes in the sub-region of the structure tree, and determining the transaction node corresponding to the identity information of the first transaction target information as the first transaction node) includes S231-S235:
and S231, sequentially extracting the transaction nodes of different levels in the sub-area of the structure tree to obtain transaction node subsets, wherein each transaction node subset corresponds to all transaction nodes of different levels.
It will be appreciated that personnel in a department may correspond to multiple levels, including for example, supervisors, managers, and employees. According to the scheme, the transaction nodes are classified by taking the hierarchy as a reference, and a plurality of transaction node subsets are obtained.
S232, calling a dynamic hierarchical structure sequence corresponding to the sub-regions of the structure tree, and sequencing all transaction node sub-sets in sequence according to the dynamic hierarchical structure sequence to obtain a sub-set sequence.
According to the scheme, a dynamic hierarchical structure sequence corresponding to the sub-regions of the structure tree is called, and then all transaction node subsets are sequentially ordered by utilizing the dynamic hierarchical structure sequence to obtain a subset sequence.
It will be appreciated that the desirability of different levels is different, e.g., the level of administration in sales division a often purchases something, next to employees, and finally to managers. Therefore, the scheme is provided with a dynamic hierarchical structure order, so that the hierarchical ordering with higher demand degree is advanced. The subsequent steps have a way to sequentially update the dynamic hierarchy, see below.
And S233, fusing all the transaction nodes of different levels according to the sequence of all the transaction nodes in the subset sequence to obtain a transaction node total set.
It can also be understood that step S232 is to sort the levels, and this step is to merge all the transaction nodes of different levels according to the order of all the transaction nodes in the subset sequence to obtain a total transaction node set.
And S234, traversing the identity information of all transaction nodes in the transaction node total set according to the sequence of the transaction nodes in the transaction node total set, and determining the transaction node of the identity information corresponding to the first transaction target information as the first transaction node.
According to the scheme, the identity information of the transaction nodes is sequentially traversed according to the sequence of the transaction nodes in the transaction node total set, then the transaction node of the identity information corresponding to the first transaction target information is found, and the transaction node is marked as the first transaction node.
And S235, dynamically updating the dynamic hierarchical structure sequence according to the hierarchy corresponding to the first transaction node.
And finally, dynamically updating the dynamic hierarchical structure sequence by utilizing the hierarchy corresponding to the first transaction node.
In some embodiments, S235 (dynamically updating the dynamic hierarchy order according to the hierarchy corresponding to the first transaction node) includes S2351-S2353:
s2351, retrieving preset behavior storage information corresponding to the sub-region of the structure tree, where the preset behavior storage information includes the number of times of the first transaction node corresponding to each level in each traversal.
First, the scheme calls preset behavior storage information corresponding to the sub-regions of the structure tree, wherein the preset behavior storage information includes the number of times of the first transaction node corresponding to each level in each traversal. The number of times includes, for example, the number of managers, the number of employees, and the number of supervisors.
S2352, updating the preset behavior storage information according to the level corresponding to the last first transaction node, and determining the time weight corresponding to each first transaction node according to the time traversed by each first transaction node.
According to the scheme, the preset behavior storage information is updated according to the hierarchy corresponding to the first transaction node at the last time, and then the time weight corresponding to each first transaction node is determined according to the traversal time of each first transaction node.
It will be appreciated that transactions are generally regular, for example, 10 transactions, the first 5 transactions being for the manager and the last 5 transactions being for the employee, so that closer to the current time, the data is more referenceable, and the scheme will weigh the corresponding time more heavily.
S2353, calculating the times and time weights of the first transaction nodes corresponding to each level in the updated preset behavior storage information to obtain a sorting coefficient, and performing descending sorting on each level in the sub-region of the structural tree based on the sorting coefficient to obtain the updated dynamic hierarchical structure sequence of the sub-region of the structural tree.
According to the scheme, the ranking coefficient is obtained by calculating the times and time weights of the first transaction nodes corresponding to each level in the updated preset behavior storage information. And then, sequencing each hierarchy in the sub-regions of the structure tree in a descending order by using the sequencing coefficient to obtain the dynamic hierarchy structural sequence after the sub-regions of the structure tree are updated.
In some embodiments, S2353 (calculating the times and time weights of the first transaction nodes corresponding to each level in the updated preset behavior storage information to obtain a ranking coefficient, and performing descending ranking on each level in the sub-region of the structure tree based on the ranking coefficient to obtain an updated dynamic level structure sequence of the sub-region of the structure tree) includes S23531-S23533:
s23531, extracting all the first transaction nodes in the preset time period from the preset behavior storage information. The preset time period is, for example, 10 days, or may be 1 month, and the like, and the scheme is not limited.
S23532, calculating the number of times of the first transaction node corresponding to each level in the preset time period in the updated preset behavior storage information to obtain a number of times coefficient, and calculating the time coefficient according to the time weight of the first transaction node traversed each time.
According to the scheme, the time coefficient is calculated according to the data of the time dimension, and meanwhile, the time coefficient is calculated according to the data of the time dimension. And finally, performing fusion calculation by using the time coefficient and the time coefficient to obtain a sequencing coefficient formed by all the first transaction nodes in the corresponding level.
S23533, performing fusion calculation according to the time coefficient and the time coefficient to obtain a ranking coefficient formed by all the first transaction nodes in the corresponding hierarchy, calculating the ranking coefficient by the following formula,
wherein the content of the first and second substances,
is a first->
Sorting factor in each hierarchy based on all first transaction nodes>
Is the first->
Number of times corresponding to a first transaction node within an individual level>
Is a predetermined value of a time constant>
Is the first->
On a number of levels>
A time weight for a first transaction node, based on>
Is the first->
Upper limit value of a first transaction node in an individual level->
Is a preset time constant value.
In the above-mentioned formula,
representing a degree factor, th->
The more the times of the corresponding first transaction nodes in each level are, the larger the corresponding time coefficient is; />
Represents a time coefficient, th->
At a number of levels>
The sum of the time weights of the first transaction nodes->
The larger the time coefficient is, the larger the corresponding time coefficient is.
And S3, according to the position of the first node where the first transaction node is located, determining a first transaction verification branch formed from the position of the first node to the position of a target node of a target transaction node, and intercepting the first transaction verification branch according to a verification strategy corresponding to the first transaction request end and/or first transaction target information to obtain a second transaction verification branch.
According to the scheme, after the position of the first node where the first transaction node is located is determined, a first transaction verification branch formed from the position of the first node to the position of the target node of the target transaction node is determined.
And then, intercepting the first transaction verification branch according to a verification strategy corresponding to the first transaction request end and/or the first transaction target information to obtain a second transaction verification branch.
In some embodiments, S3 (determining, according to a first node position where the first transaction node is located, a first transaction verification branch formed from the first node position to a target node position of a target transaction node, and intercepting the first transaction verification branch according to a verification policy corresponding to the first transaction request end and/or first transaction target information to obtain a second transaction verification branch) includes S31 to S34:
s31, determining a target node position of a target transaction node, wherein the target transaction node is the transaction node with the highest dimensionality in the transaction structure tree, and connecting the first node position with the target node position to generate a corresponding first transaction verification branch.
Firstly, the scheme determines a target node position of a target transaction node, wherein the target transaction node is a transaction node with the highest dimensionality in a transaction structure tree, for example, a node corresponding to the CEO dimensionality, and then the scheme connects the first node position with the target node position to generate a corresponding first transaction verification branch. It can be appreciated that the present solution may determine a transaction verification path from the first node location to the target node location, forming a wide range of first transaction verification paths.
And S32, if the verification strategy corresponding to the first transaction request end exists, extracting the number of the first verification nodes and/or the first preset verification nodes in the verification strategy.
The first transaction request terminal of the scheme can be correspondingly provided with a verification strategy, and the verification strategy can be that the number of first verification nodes and/or first preset verification nodes are/is set. The number of the first verification nodes may be, for example, 3 nodes for auditing, and the first preset verification node, for example, must be a financial node or an administrative node to participate in auditing.
If the verification strategy corresponding to the first transaction request end is determined to exist, the scheme can extract the number of the first verification nodes and/or the first preset verification nodes in the verification strategy.
And S33, if the verification strategy corresponding to the first transaction target information is judged to exist, extracting the number of second verification nodes and/or second preset verification nodes in the verification strategy.
The scheme can also configure verification strategies for the transaction target information, and it can be understood that different items are bought, and the required audit levels are different, for example, buying a production line may require CEO audit, buying a small device may only require audit administration, so that the scheme can also judge whether the verification strategy corresponding to the first transaction target information exists, and if the verification strategy exists, extract the number of second verification nodes and/or second preset verification nodes in the verification strategy.
And S34, determining the corresponding third verification node number according to the first verification node number and the second verification node number, and generating a second transaction verification branch according to the third verification node number, the first preset verification node and the second preset verification node.
According to the scheme, the corresponding third verification node number is determined according to the first verification node number and the second verification node number, and the determination mode can be based on the maximum node number in the first verification node number and the second verification node number.
And finally, generating a second transaction verification branch according to the number of the third verification nodes, the first preset verification node and the second preset verification node.
In some embodiments, S34 (determining a corresponding third verification node number according to the first verification node number and the second verification node number, and generating a second transaction verification branch according to the third verification node number, the first preset verification node, and the second preset verification node) includes S341-S343:
s341, if there is only one of the first verification node number or the second verification node number, taking the corresponding first verification node number or the second verification node number as a third verification node number.
If only one of the first verification node quantity or the second verification node quantity exists, the scheme directly takes the corresponding first verification node quantity or the second verification node quantity as the third verification node quantity.
S342, if the first verification node number and the second verification node number exist at the same time, the first verification node number or the second verification node number with a larger node number is used as the third verification node number.
If the first verification node number and the second verification node number exist at the same time, the scheme takes the maximum node number in the first verification node number and the second verification node number as the standard.
S343, if the first verification node number and the second verification node number do not exist, or the first verification node number and the second verification node number are respectively 0, generating a third verification node number that is a preset number.
If the first and second verification node numbers do not exist or are respectively 0, a third verification node number that is a preset number (e.g., 2) is generated.
In some embodiments, S34 (determining a corresponding third verification node number according to the first verification node number and the second verification node number, and generating a second transaction verification branch according to the third verification node number, the first preset verification node, and the second preset verification node) includes S344-S346:
and S344, taking the first transaction node as a starting point, and selecting second transaction nodes corresponding to the number of the third verification nodes from the first transaction verification branches to obtain a first part of second transaction verification branches.
According to the scheme, the first transaction node is taken as a starting point, and second transaction nodes corresponding to the number of the third verification nodes are selected from the first transaction verification branches to obtain a first part of second transaction verification branches. It will be appreciated that the second transaction verification leg of the first portion is the primary verification leg.
And S345, directly connecting the first preset verification node and/or the second preset verification node with the first transaction node to obtain a second transaction verification branch of the second part.
Then, the scheme can directly connect the first preset verification node and/or the second preset verification node with the first transaction node to obtain a second transaction verification branch of the second part. It will be appreciated that the second transaction verification leg of the second part refers to the node leg requiring a specified audit.
And S346, counting the second transaction verification branch of the first part and the second transaction verification branch of the second part to generate a final second transaction verification branch.
And finally, generating a final second transaction verification branch by the second transaction verification branch of the first part and the second transaction verification branch of the second part.
S4, extracting other second transaction nodes except the first transaction node in the second transaction verification branch, and generating a transaction verification path according to the connection relation between all the second transaction nodes in the second transaction verification branch;
in some embodiments, S4 (extracting other second transaction nodes except the first transaction node in the second transaction verification branch, and generating a transaction verification path according to the connection relationship between all second transaction nodes in the second transaction verification branch) includes:
and determining other second transaction nodes directly connected with the first transaction node, and generating at least one transaction verification path according to the positions of all other second transaction nodes in the second transaction verification branch, wherein the second transaction verification branch of each first part and the second transaction verification branch of each second part respectively correspond to different transaction verification paths.
According to the scheme, other second transaction nodes directly connected with the first transaction node are determined, and at least one transaction verification path is generated according to the positions of all other second transaction nodes in the second transaction verification branch, wherein each first part of the second transaction verification branch and each second part of the second transaction verification branch correspond to different transaction verification paths respectively.
And S5, the verification server sequentially sends the first transaction target information to a first transaction verification end corresponding to a second transaction node according to the transaction verification path, and after the verification passing information is judged to be fed back by all the first transaction verification ends, the verification server adds a verification completion label to the first transaction link information.
The verification server sequentially sends the first transaction target information to a first transaction verification end corresponding to the second transaction node according to a transaction verification path. The first transaction verification end can then verify the transaction information.
After all the first transaction verification ends are judged to feed back verification passing information, the verification ends are all passed, and the verification server adds a verification completion label to the first transaction link information.
And S6, the verification server sends the first transaction link information added with the verification completion tag to the transaction server, and the transaction server completes the transaction of the first transaction request end to the first transaction target information based on the first transaction link information.
The verification server sends the first transaction link information added with the verification completion tag to the transaction server, and the transaction server can complete the transaction of the first transaction request end to the first transaction target information by using the first transaction link information.
The present invention also provides a storage medium having a computer program stored therein, the computer program being executable by a processor to implement the methods provided by the various embodiments described above.
The storage medium may be a computer storage medium or a communication medium. Communication media includes any medium that facilitates transfer of a computer program from one place to another. Computer storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, a storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an Application Specific Integrated Circuits (ASIC). Additionally, the ASIC may reside in user equipment. Of course, the processor and the storage medium may reside as discrete components in a communication device. The storage medium may be read-only memory (ROM), random-access memory (RAM), CD-ROMs, magnetic tapes, floppy disks, optical data storage devices, and the like.
The present invention also provides a program product comprising execution instructions stored in a storage medium. The at least one processor of the device may read the execution instructions from the storage medium, and the execution of the execution instructions by the at least one processor causes the device to implement the methods provided by the various embodiments described above.
In the above embodiments of the terminal or the server, it should be understood that the Processor may be a Central Processing Unit (CPU), other general-purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor, or in a combination of the hardware and software modules within the processor.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and these modifications or substitutions do not depart from the spirit of the corresponding technical solutions of the embodiments of the present invention.
Claims (8)
1. A data processing method suitable for a trading platform, comprising:
the method comprises the steps that a verification server obtains first transaction request data sent by a first transaction request end, wherein the first transaction request data at least comprise first transaction identity information, first transaction target information and first transaction link information;
determining a transaction structure tree corresponding to a first transaction request end according to the first transaction identity information, wherein the transaction structure tree comprises a plurality of transaction nodes corresponding to the transaction identity information, and the first transaction node corresponding to the first transaction target information in the transaction structure tree is determined;
determining a first transaction verification branch formed from the position of the first node to the position of a target node of a target transaction node according to the position of the first node where the first transaction node is located, and intercepting the first transaction verification branch according to a verification strategy corresponding to the first transaction request terminal and/or first transaction target information to obtain a second transaction verification branch;
extracting other second transaction nodes except the first transaction node in the second transaction verification branch, and generating a transaction verification path according to the connection relation between all the second transaction nodes in the second transaction verification branch;
the verification server sequentially sends the first transaction target information to first transaction verification ends corresponding to second transaction nodes according to the transaction verification path, and after all the first transaction verification ends are judged to feed back verification passing information, the verification server adds a verification completion label to the first transaction link information;
the verification server sends the first transaction link information added with the verification completion tag to a transaction server, and the transaction server completes the transaction of the first transaction request end to the first transaction target information based on the first transaction link information;
the determining, according to the first transaction identity information, a transaction structure tree corresponding to a first transaction request end, where the transaction structure tree includes a plurality of transaction nodes corresponding to the transaction identity information, and determining a first transaction node corresponding to the first transaction target information in the transaction structure tree, includes:
extracting first company labels included in the first transaction identity information, and determining a transaction structure tree corresponding to a first transaction request end according to the first company labels, wherein each first company label has a corresponding transaction structure tree;
extracting a first department label in the first transaction identity information, and determining a structural tree sub-region corresponding to the first department label in the transaction structural tree, wherein the structural tree sub-region is composed of transaction nodes corresponding to the first department label, and each transaction node is provided with a corresponding preset department label;
traversing the identity information of all transaction nodes in the sub-area of the structure tree, and determining the transaction node of the identity information corresponding to the first transaction target information as a first transaction node;
the method comprises the following steps of determining a first transaction verification branch formed from a first node position to a target node position of a target transaction node according to the first node position of the first transaction node, intercepting the first transaction verification branch according to a verification strategy corresponding to the first transaction request end and/or first transaction target information to obtain a second transaction verification branch, and comprises the following steps:
determining a target node position of a target transaction node, wherein the target transaction node is a transaction node with the highest dimensionality in a transaction structure tree, and connecting the first node position with the target node position to generate a corresponding first transaction verification branch;
if the verification strategy corresponding to the first transaction request end is judged to exist, extracting the number of first verification nodes and/or first preset verification nodes in the verification strategy;
if the verification strategy corresponding to the first transaction target information exists, extracting the number of second verification nodes and/or second preset verification nodes in the verification strategy;
and determining the corresponding third verification node quantity according to the first verification node quantity and the second verification node quantity, and generating a second transaction verification branch according to the third verification node quantity, the first preset verification node and the second preset verification node.
2. The data processing method for trading platform of claim 1,
the method comprises the following steps that the verification server receives first transaction request data sent by a first transaction request end, wherein the first transaction request data at least comprise first transaction identity information, first transaction target information and first transaction link information, and the method comprises the following steps:
the first transaction request end carries out data interaction with the transaction server, and at least one transaction commodity is selected in the transaction server to obtain corresponding first transaction target information;
the first transaction request terminal generates corresponding first transaction link information according to the webpage link corresponding to the first transaction target information;
the first transaction request end extracts corresponding first transaction identity information, first transaction target information and first transaction link information and sends the first transaction identity information, the first transaction target information and the first transaction link information to the verification server.
3. The data processing method for trading platform of claim 1,
the traversing the identity information of all transaction nodes in the sub-region of the structure tree, and determining the transaction node of the identity information corresponding to the first transaction target information as the first transaction node, includes:
sequentially extracting transaction nodes of different levels in the sub-area of the structure tree to obtain transaction node subsets, wherein each transaction node subset corresponds to all transaction nodes of different levels;
calling a dynamic hierarchical structure sequence corresponding to the sub-regions of the structure tree, and sequencing all transaction node subsets in sequence according to the dynamic hierarchical structure sequence to obtain a subset sequence;
fusing all transaction nodes of different levels according to the sequence of all transaction nodes in the subset sequence to obtain a transaction node total set;
traversing the identity information of all transaction nodes in the transaction node total set according to the sequence of the transaction nodes in the transaction node total set, and determining the transaction node of the identity information corresponding to the first transaction target information as a first transaction node;
and dynamically updating the dynamic hierarchical structure sequence according to the hierarchy corresponding to the first transaction node.
4. The data processing method for trading platform of claim 3,
the dynamically updating the dynamic hierarchical structure sequence according to the hierarchy corresponding to the first transaction node comprises:
calling preset behavior storage information corresponding to the sub-region of the structure tree, wherein the preset behavior storage information comprises the times of corresponding first transaction nodes of each level in each traversal;
updating the preset behavior storage information according to the corresponding hierarchy of the last first transaction node, and determining the time weight corresponding to each first transaction node according to the traversed time of each first transaction node;
calculating the times and time weights of the first transaction nodes corresponding to each level in the updated preset behavior storage information to obtain a sorting coefficient, and performing descending sorting on each level in the structural tree subareas based on the sorting coefficient to obtain the dynamic hierarchical structure sequence after the structural tree subareas are updated.
5. The data processing method for trading platform of claim 4,
calculating the times and time weights of the first transaction nodes corresponding to each level in the updated preset behavior storage information to obtain a sorting coefficient, and performing descending sorting on each level in the structural tree sub-region based on the sorting coefficient to obtain the updated dynamic hierarchical structure sequence of the structural tree sub-region, wherein the method comprises the following steps:
extracting all first transaction nodes positioned in a preset time period in the preset behavior storage information;
calculating the times of the first transaction nodes corresponding to each hierarchy within a preset time period in the updated preset behavior storage information to obtain a time coefficient, and calculating the time coefficient according to the time weight of the first transaction nodes traversed each time;
performing fusion calculation according to the time coefficient and the time coefficient to obtain a ranking coefficient formed by all the first transaction nodes in the corresponding hierarchy, calculating the ranking coefficient by the following formula,
wherein, the first and the second end of the pipe are connected with each other,
is a first->
Sorting factor in each hierarchy based on all first transaction nodes>
Is the first->
Number of times corresponding to a first transaction node in a hierarchy>
Is a predetermined value of a time constant>
Is the first->
On a number of levels>
Time weighting of a first transaction node @>
Is the first->
Upper limit value of a first transaction node in an individual level->
Is a preset time constant value.
6. The data processing method for trading platform of claim 1,
the determining the corresponding third verification node number according to the first verification node number and the second verification node number, and generating a second transaction verification branch according to the third verification node number, the first preset verification node and the second preset verification node, includes:
if only one of the first verification node quantity or the second verification node quantity exists, taking the corresponding first verification node quantity or second verification node quantity as a third verification node quantity;
if the first verification node number and the second verification node number exist at the same time, the first verification node number or the second verification node number with the larger node number is used as a third verification node number;
and if the first verification node number and the second verification node number do not exist, or the first verification node number and the second verification node number are respectively 0, generating a third verification node number which is a preset number.
7. The data processing method for trading platform of claim 6,
the determining the corresponding third verification node number according to the first verification node number and the second verification node number, and generating a second transaction verification branch according to the first verification node number, the first preset verification node, the second verification node number and the second preset verification node, includes:
selecting second transaction nodes corresponding to the number of the third verification nodes from the first transaction verification branch circuit by taking the first transaction node as a starting point to obtain a first part of second transaction verification branch circuits;
directly connecting the first preset verification node and/or the second preset verification node with the first transaction node to obtain a second transaction verification branch of the second part;
and counting the second transaction verification branch of the first part and the second transaction verification branch of the second part to generate a final second transaction verification branch.
8. The data processing method for trading platform of claim 7,
the extracting other second transaction nodes except the first transaction node in the second transaction verification branch, and generating a transaction verification path according to the connection relationship between all the second transaction nodes in the second transaction verification branch includes:
and determining other second transaction nodes directly connected with the first transaction node, and generating at least one transaction verification path according to the positions of all other second transaction nodes in the second transaction verification branch, wherein the second transaction verification branch of each first part and the second transaction verification branch of each second part respectively correspond to different transaction verification paths.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310031266.1A CN115796889B (en) | 2023-01-10 | 2023-01-10 | Data processing method suitable for trading platform |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310031266.1A CN115796889B (en) | 2023-01-10 | 2023-01-10 | Data processing method suitable for trading platform |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115796889A CN115796889A (en) | 2023-03-14 |
| CN115796889B true CN115796889B (en) | 2023-04-18 |
Family
ID=85428918
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310031266.1A Active CN115796889B (en) | 2023-01-10 | 2023-01-10 | Data processing method suitable for trading platform |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115796889B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116521119B (en) * | 2023-06-30 | 2023-09-12 | 中卫信软件股份有限公司 | Communication method of hardware equipment and browser in information system |
| CN116822966B (en) * | 2023-08-28 | 2023-11-28 | 开鑫科技信息服务(南京)有限公司 | Risk data management method and system suitable for enterprises |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113987466A (en) * | 2021-12-27 | 2022-01-28 | 国网浙江省电力有限公司 | Information sequencing auditing method and device based on middlebox and storage medium |
| CN114519498A (en) * | 2022-01-10 | 2022-05-20 | 湖北国际物流机场有限公司 | Quality evaluation method and system based on BIM (building information modeling) |
| CN114677188A (en) * | 2022-05-25 | 2022-06-28 | 国网浙江省电力有限公司 | Full-amount acquisition method and device suitable for paperless certificate data |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111383022B (en) * | 2018-12-29 | 2020-12-08 | 广州市百果园信息技术有限公司 | Background architecture method, system, computer equipment and storage medium for aggregated payment |
| JP7408499B2 (en) * | 2020-07-06 | 2024-01-05 | 株式会社日立製作所 | Distributed ledger management system, distributed ledger management method, and nodes |
-
2023
- 2023-01-10 CN CN202310031266.1A patent/CN115796889B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113987466A (en) * | 2021-12-27 | 2022-01-28 | 国网浙江省电力有限公司 | Information sequencing auditing method and device based on middlebox and storage medium |
| CN114519498A (en) * | 2022-01-10 | 2022-05-20 | 湖北国际物流机场有限公司 | Quality evaluation method and system based on BIM (building information modeling) |
| CN114677188A (en) * | 2022-05-25 | 2022-06-28 | 国网浙江省电力有限公司 | Full-amount acquisition method and device suitable for paperless certificate data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115796889A (en) | 2023-03-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115796889B (en) | Data processing method suitable for trading platform | |
| US9875505B2 (en) | Hierarchical transaction filtering | |
| US20220245626A1 (en) | Computer-implemented system and method for generating and extracting user related data stored on a blockchain | |
| CN106844372B (en) | Logistics information query method and device | |
| US20230244656A1 (en) | Blockchain-based systems and methods for communicating, storing and processing data over a blockchain network | |
| CN111402061A (en) | Asset management method and system | |
| Budianto et al. | Net Operating Margin (NOM) on Islamic Banking: Mapping Research Topics using VOSviewer Bibliometric and Library Research | |
| CN107545407A (en) | The method and device of business flow processing | |
| WO2023165271A1 (en) | Knowledge graph construction and graph calculation | |
| WO2018065411A1 (en) | Computer system | |
| CN115330300A (en) | Purchase order processing method, device, equipment and storage medium | |
| US20050144079A1 (en) | Budgetary ledger | |
| JP6349469B1 (en) | Company group management method and system | |
| ali Khan et al. | An evaluation of requirement prioritization techniques with ANP | |
| JP2002157422A (en) | Credit method and recording medium | |
| CN108711074A (en) | Business sorting technique, device, server and readable storage medium storing program for executing | |
| CN109767333A (en) | Select based method, device, electronic equipment and computer readable storage medium | |
| CN111932131B (en) | Service data processing method and device | |
| US20130179324A1 (en) | Method, system, and program product for determining a value of an index | |
| CN114022295A (en) | Group fraud identification method and system | |
| CN112581281A (en) | Product recommendation method and device, storage medium and electronic equipment | |
| CN111369370A (en) | Estimation table processing method, device, server and storage medium | |
| CN111815272A (en) | Application auditing method and device, electronic equipment and storage medium | |
| KR20210066338A (en) | Method of managing property and system performing the same | |
| Tu | An application of web‐based data mining: selling strategies for online auctions |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Data processing methods applicable to trading platforms Granted publication date: 20230418 Pledgee: Nanjing Bank Co.,Ltd. Nanjing Financial City Branch Pledgor: Kaixin Technology Information Service (Nanjing) Co.,Ltd. Registration number: Y2024980013122 |