CN110298750A - High concurrent transaction data processing method, device, computer equipment and storage medium - Google Patents
High concurrent transaction data processing method, device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN110298750A CN110298750A CN201910427878.6A CN201910427878A CN110298750A CN 110298750 A CN110298750 A CN 110298750A CN 201910427878 A CN201910427878 A CN 201910427878A CN 110298750 A CN110298750 A CN 110298750A
- Authority
- CN
- China
- Prior art keywords
- transaction
- atom
- original
- data
- transaction data
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- General Physics & Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- Development Economics (AREA)
- Software Systems (AREA)
- Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- General Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Engineering & Computer Science (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
This application involves technical field of data processing, more particularly to a kind of high concurrent transaction data processing method, device, computer equipment and storage medium, it include: acquisition original transaction data, the transaction progress information in the original transaction data is extracted, the original transaction data is divided by several atoms according to the transaction progress information and is traded；The degree of association between each transaction process is calculated, atom transaction is clustered by several atom transaction sets according to calculation of relationship degree result；After executing the atom transaction in each atom transaction set parallel, the transaction results of the original transaction data are obtained.The application forms several classifications by carrying out cluster to atom transaction, then in carrying out process of exchange, executes the atom transaction in each classification parallel, to improve the efficiency of middle system reply high concurrent transaction scene.
Description
Technical field
This application involves technical field of data processing more particularly to a kind of high concurrent transaction data processing methods, device, meter
Calculate machine equipment and storage medium.
Background technique
In computer interconnection application system framework, front end/background framework mode is generallyd use, and front end and backstage pass through and are
System interface send and return in information.Usually there are gateway processes layer, common process layer in backstage, patrol using multilayers such as process layers
Framework is collected, after Transaction Information passes over, is successively handled by gateway processes layer, common process layer, bussiness processing layer.
It is slow during platform system is as front end and background data transfer in often can be set between front end and backstage
Rush medium.Effect of the middle system as support and link, has linked foreground system and background system, supports background system technology
It is promoted, is pointed the direction important role for production, goods marketing.In middle system, it can wrap in each transaction process
Contain several atoms transaction, wherein atom transaction be transaction minimum unit, must be fully completed in transaction process or
It does not complete all, intermediate state is not present.
But when carrying out transaction data processing, there is currently processed transaction processes is asked by a certain for current middle platform system
It asks exclusive, after waiting until back-end transaction system returns, could discharge the next transaction request processing of process progress of currently trading, thus
The scene of high concurrent transaction data can not be coped with.
Summary of the invention
Based on this, it is necessary to for it is more at present in platform systems when carrying out transaction data processing, there is currently processed friendships
Easy process is exclusive by a certain request, after waiting until back-end transaction system returns, could discharge the next friendship of process progress of currently trading
Easy request processing, so that a kind of high concurrent transaction data processing be provided the problem of the scene of high concurrent transaction data can not be coped with
Method, apparatus, computer equipment and storage medium.
A kind of high concurrent transaction data processing method, includes the following steps:
Obtain original transaction data, extract the transaction progress information in the original transaction data, according to it is described trade into
The original transaction data is divided into several atoms and traded by journey information；
The degree of association between each transaction process is calculated, is clustered into atom transaction according to calculation of relationship degree result
Several atom transaction sets；
After executing the atom transaction in each atom transaction set parallel, the transaction results of the original transaction data are obtained.
In a wherein possible embodiment, the acquisition original transaction data is extracted in the original transaction data
Transaction progress information, the original transaction data is divided by several atoms according to the transaction progress information and is traded, comprising:
The ID mark for obtaining the transaction sender of original transaction data is identified according to the ID of the transaction sender and is sent out
Square key out；
Sender's key is sent to each transaction terminal, the feedback information of each transaction terminal of receiving will be described anti-
Contain the transaction terminal of sender's key in feedforward information as transaction reciever；
The configuration information for obtaining the transaction sender and the transaction reciever, according to configuration information determination
All Activity process needed for original transaction data；
Resource information needed for obtaining each transaction process, obtains respectively according to resource information needed for the transaction process
The Transaction Information is split into several atoms according to the data capacity and traded by the data capacity that atom exchange includes.
In a wherein possible embodiment, the degree of association calculated between each transaction process, according to association
Atom transaction is clustered into several atom transaction sets by degree calculated result, comprising:
The atom transaction data for obtaining multiple transaction processes, using any transaction process as Reference Transactions process,
It trades process as transaction process to be associated；
Calculate the single-factor matching degree between the Reference Transactions process and any transaction process to be associated；
Calculate the multiple-factor matching degree between the Reference Transactions process and any transaction process to be associated；
The Reference Transactions process is obtained according to the calculated result of the single-factor matching degree and the multiple-factor matching degree
With the degree of association of any transaction process to be associated, the degree of association is greater than to the transaction process institute of preset degree of association threshold value
Corresponding atom transaction data is clustered into an atom transaction set.
In a wherein possible embodiment, after the atom transaction executed in each atom transaction set parallel, obtain
The transaction results of the original transaction data, comprising:
Any atom transaction in each atom transaction set is selected at random respectively as initial transaction；
Each initial transaction is executed parallel, obtains the transaction results of several initial transactions, obtains each initial transaction
Transaction results between logical relation, the atom that execution is connected in each atom transaction set is determined according to the logical relation
Transaction；
The implementing result obtained after each atom transaction executes is obtained, obtains the original transaction after removing intermediate result
The transaction results of data；
Discrepancy is obtained after the transaction results are compared with expected results, the difference is clicked and entered into ginseng and is repaired to error
Final transaction results are obtained after carrying out error correction in positive model.
In a wherein possible embodiment, the calculating Reference Transactions process and any transaction to be associated
Single-factor matching degree between process, comprising:
Calculate the text similarity of the Reference Transactions process and any transaction process to be associated；
If the text similarity is 0, the single-factor matching degree is 0, if the text similarity is not 0, is counted
Calculate the level similarity of the Reference Transactions process and any transaction process to be associated；
The single-factor matching degree is obtained according to the text similarity and the level similarity.
In a wherein possible embodiment, the calculating Reference Transactions process and any transaction to be associated
Multiple-factor matching degree between process, comprising:
It obtains the Reference Transactions process and any transaction process to be associated executes the data information after preceding or execution；
Changed data are extracted from the data information, obtain dimension corresponding to the changed data
Spend information；
The factor quantity that need to be calculated according to the dimensional information determination；
The dimension weight for obtaining each dimension obtains described more according to the similarity between the dimension weight and each factor
Factor matching degree.
In a wherein possible embodiment, it is described the transaction results are compared with expected results after obtain difference
The difference is clicked and entered after ginseng carries out error correction into error correction model and obtains final transaction results by dissimilarity, comprising:
Discrepancy is obtained after the transaction results are compared with expected results, theorem is stated to described by Grange
The parameter of discrepancy carries out first step amendment, correction formula are as follows:
ΔYt=lag (Δ Y)-λ (μ t-1),
In formula, μ t-1 is non-balancing error item, and λ is short-term correction parameter, Δ YtFor error difference, Δ Y is to measure transaction
As a result with the parameter of measurement of expected results, t is the amendment period, and value range is the positive integer more than or equal to 1；
It will carry out assisting whole recurrence by the Grange statement corrected parameter of measurement of theorem, and obtain and assist whole vector；
It after the whole vector of association is input to error correction model, obtains assisting whole regression parameter, the whole recurrence of association is joined
Number is modified the parameter of measurement as weight, after being modified according to revised parameter of measurement to the transaction results
Obtain final transaction results.
A kind of high concurrent transaction data processing unit, including following module:
Module is established in atom transaction, is set as obtaining original transaction data, is extracted the transaction in the original transaction data
The original transaction data is divided into several atoms according to the transaction progress information and traded by progress information；
Atom transaction cluster module, is set as calculating the degree of association between each transaction process, according to calculation of relationship degree
As a result atom transaction is clustered into several atom transaction sets；
Transaction executes feedback module, after being set as executing the atom transaction in each atom transaction set parallel, obtains the original
The transaction results of beginning transaction data.
A kind of computer equipment, including memory and processor are stored with computer-readable instruction in the memory, institute
When stating computer-readable instruction and being executed by the processor, so that the processor executes above-mentioned high concurrent transaction data processing side
The step of method.
A kind of storage medium being stored with computer-readable instruction, the computer-readable instruction are handled by one or more
When device executes, so that the step of one or more processors execute above-mentioned high concurrent transaction data processing method.
Compared with current mechanism, the application has the following advantages:
(1) several classifications is formed by carrying out cluster to atom transaction, then in carrying out process of exchange, parallel execution is each
Atom transaction in a classification, to improve the efficiency of middle system reply high concurrent transaction scene；
(2) by effectively being analyzed transaction data and transaction process, so that correctly original transaction data be changed point
For the transaction of multiple atoms；
(3) by the analysis to the degree of association between different transaction processes, thus effectively cluster atom transaction,
In order to trade under scene in high concurrent, select suitable atom transaction as the atom transaction executed；
(4) error correction is carried out by the implementing result traded to atom, to ensure that the accuracy of transaction results.
Detailed description of the invention
By reading the following detailed description of the preferred embodiment, various other advantages and benefits are common for this field
Technical staff will become clear.The drawings are only for the purpose of illustrating a preferred embodiment, and is not considered as to the application
Limitation.
Fig. 1 is a kind of overall flow figure of the high concurrent transaction data processing method of the application in one embodiment；
Fig. 2 is that the atom transaction in a kind of high concurrent transaction data processing method of the application in one embodiment is established
Process schematic；
Fig. 3 is the atom transaction cluster in a kind of high concurrent transaction data processing method of the application in one embodiment
Process schematic；
Fig. 4 is that the transaction in a kind of high concurrent transaction data processing method of the application in one embodiment executes feedback
Process schematic；
Fig. 5 is a kind of structure chart of the high concurrent transaction data processing unit of the application in one embodiment.
Specific embodiment
It is with reference to the accompanying drawings and embodiments, right in order to which the objects, technical solutions and advantages of the application are more clearly understood
The application is further elaborated.It should be appreciated that specific embodiment described herein is only used to explain the application, and
It is not used in restriction the application.
Those skilled in the art of the present technique are appreciated that unless expressly stated, singular " one " used herein, " one
It is a ", " described " and "the" may also comprise plural form.It is to be further understood that being arranged used in the description of the present application
Diction " comprising " refer to that there are the feature, integer, step, operation, element and/or component, but it is not excluded that in the presence of or addition
Other one or more features, integer, step, operation, element, component and/or their group.
Fig. 1 is a kind of overall flow figure of the high concurrent transaction data processing method of the application in one embodiment, such as
Shown in Fig. 1, a kind of high concurrent transaction data processing method, comprising the following steps:
S1, original transaction data is obtained, the transaction progress information in the original transaction data is extracted, according to the transaction
The original transaction data is divided into several atoms and traded by progress information；
Specifically, transaction progress information may include transaction auditing, transaction execution, the transaction such as implementing result Effective judgement
Process, the transaction of each atom correspond to a specific transaction process.Transaction process refers to atomicity: one trade into
It all operations in journey or is fully completed or does not complete all, it is impossible to be stuck in intermediate some part.
The degree of association between S2, each transaction process of calculating, the atom is traded gather according to calculation of relationship degree result
Class is at several atom transaction sets；
Specifically, general atom transaction set can be divided into preposition atom transaction set, in set atom transaction set and postposition atom
Transaction set.Legitimacy verifies and logical transaction of the atom transaction for completing requests transaction in preposition atom transaction set judge；
In set in atom transaction set atom transaction for complete to backstage transaction system access；Atom in postposition atom transaction set is handed over
It is easy for the last logic of finishing service transaction and returns to transaction results to requesting party.
S3, execute parallel in each atom transaction set atom transaction after, obtain the transaction results of the original transaction data.
Specifically, in the process of implementation, the atom transaction in every one kind atom transaction set logically can be carried out sequentially
It successively executes, veritifies, then carry out again close for example, can first carry out identity in preposition atom transaction set and veritify finger print information such as
Key is veritified, then there is certain order when executing the atom transaction in preposition atom transaction set.And multiple and different classifications
Atom transaction set can then execute parallel to cope with the situation of high concurrent.
The present embodiment forms several classifications by carrying out cluster to atom transaction, then in carrying out process of exchange, parallel
The atom transaction in each classification is executed, to improve the efficiency of middle system reply high concurrent transaction scene.
Fig. 2 is that the atom transaction in a kind of high concurrent transaction data processing method of the application in one embodiment is established
Process schematic, as shown, the S1, acquisition original transaction data, extract the transaction process in the original transaction data
The original transaction data is divided into several atoms according to the transaction progress information and traded by information, comprising:
S11, obtain original transaction data transaction sender ID mark, according to it is described transaction sender ID identify
To sender's key；
Specifically, requiring to encrypt transaction data, to be handed in a network when each transaction occurs
Easy corresponding sender and reciever, what is generallyd use when encrypting to transaction data is key, i.e., transaction sender and
Transaction reciever key having the same, forms a key pair.Wherein, key can be Hash key, symmetric key etc..?
In database, each transaction terminal corresponds to 1 ID mark, and in order to distinguish to transaction terminal, and key information is then
It is to identify timing cycle according to ID to assign, i.e., an ID mark can have 5 keys, and section is endowed difference in different times
Key.
S12, sender's key is sent to each transaction terminal, receive the feedback information of each transaction terminal, by institute
The transaction terminal for containing sender's key in feedback information is stated as transaction reciever；
Specifically, a transaction may correspond to different transaction sender and reciever by node in different times, than
Such as, house is bought and sold, the sender that when beginning trades is real estate developer, and reciever is landlord, and same house is carrying out
When trading again, landlord becomes transaction sender, and new buyer becomes transaction reciever.Therefore, node in different times
Transaction sender corresponding to same product and transaction reciever are different.Therefore, it is necessary to traverse once all
Transaction reciever, is then identified by key, could obtain the corresponding transaction reciever of this original transaction data.
S13, the configuration information for obtaining the transaction sender and the transaction reciever, determine according to the configuration information
All Activity process needed for the original transaction data；
Specifically, configuration information includes network configuration information, system information, hardware information etc., if transaction sender and friendship
The different process for also needing to carry out compatible adaptation of network formats, system used in the side of being easily accepted by.This results in executing
When one transaction, the transaction process of transaction data can be because configure the certain variation of different generations.
Resource information needed for S14, each transaction process of acquisition, obtains according to resource information needed for the transaction process
The Transaction Information is split into several atoms according to the data capacity and handed over by the data capacity for including to each atom exchange
Easily.
Wherein, each transaction process corresponds to the transaction of atom, what the transaction of each atom will guarantee to be executed
Integrality.The mode that can be individually tested each transaction process for this point is tested.Each trade into
It includes the information such as bandwidth, disk maximum writing, system version that journey, which needs the resource information of system configuration,.For example, at some
Data transmission rate is 50kb/s in transaction process, then the size of atom transaction should be not more than 50kb, when single atom is traded
When being dimensioned to 50kb, when some Transaction Information size be 1000kb, then needing to split this Transaction Information
At the atom transaction of 20 50kb sizes.
The present embodiment, by effectively being analyzed transaction data and transaction process, thus correctly by original number of deals
It is divided into multiple atom transaction according to changing.
Fig. 3 is the atom transaction cluster in a kind of high concurrent transaction data processing method of the application in one embodiment
Process schematic, as shown, the degree of association between the S2, each transaction process of calculating, according to calculation of relationship degree result
Atom transaction is clustered into several atom transaction sets, comprising:
S21, the atom transaction data for obtaining multiple transaction processes, using any transaction process as Reference Transactions into
Journey, other transaction processes are as transaction process to be associated；
Wherein, Reference Transactions process is randomly selected, to be obtained between transaction process when degree of being associated calculates
The maximum two transaction processes of the degree of association are put together, and establish logical connection by most relevance degree.
Single-factor matching degree between S22, the calculating Reference Transactions process and any transaction process to be associated；
Wherein, when being matched the Reference Transactions process and the transaction process to be associated, Reference Transactions into
All have multiple factors in journey and transaction process to be associated and can be used as matching condition and matched, these factors include the time because
Son, the transaction amount factor, the mode of doing business factor etc..In this step, any one in the above-mentioned factor can be selected as meter
Calculate the factor of single-factor matching degree.By taking time factor as an example, for example, the A transaction process end time is 11:00, B transaction process
Time started is 11:00, then for time factor, A transaction process and B transaction process just have the matching of drop-over.
Multiple-factor matching degree between S23, the calculating Reference Transactions process and any transaction process to be associated；
Wherein, multiple-factor matching degree refers to two or above factor is matched.For example, time factor and function because
Son, A trade the process end time as 11:00, and the end time of B transaction process is also 11:00；The function of A transaction process is to hand over
Easy logic judgment, the function of B transaction process are compliance inspections etc..
S24, the Reference Transactions are obtained according to the calculated result of the single-factor matching degree and the multiple-factor matching degree
The degree of association of process and any transaction process to be associated, by the degree of association be greater than preset degree of association threshold value transaction into
Atom transaction data corresponding to journey is clustered into an atom transaction set.
Specifically, Reference Transactions process and other transaction processes can be interchanged, i.e., when being clustered, can first appoint
Select a transaction process as Reference Transactions process, degree of being associated obtained after calculating degree of being associated with it is maximum it is other trade into
Journey, then choose again another transaction process as Reference Transactions process repeat the above steps degree of being associated calculate, by
Cluster is completed after secondary progress.For example, Reference Transactions process is from A bank to the transaction of B bank transfer, the amount of money transferred accounts is 100
Wan Yuan, the time of transferring accounts is 16 points, and transaction process X to be associated is the transaction of B bank to C bank transfer, and transfer amounts are 1,000,000
Member, the time of transferring accounts be 16 points 30 minutes, then being 100% for this single-factor matching degree of transfer amounts, and for the time of transferring accounts
This single-factor matching degree is 85%, and is 90% for the single-factor matching degree of counterparty；And multiple-factor in this example
Matching degree is 95%, in calculating correlation, single-factor matching degree is weighted and averaged to obtain the mean value of single-factor matching degree,
Then again by after weighted average single-factor matching degree and multiple-factor matching degree be averaged to obtain the degree of association, in this example
In, the degree of association is (100%*0.5+85%*0.3+90%*0.2) * 0.5+90%*0.5=91.75%, and the preset degree of association
It is 90%, then an atom transaction set can be clustered into for Reference Transactions process and transaction process X to be associated.
The present embodiment, by the analysis to the degree of association between different transaction processes, thus effectively by atom trade into
Row cluster selects suitable atom transaction as the atom transaction executed in order to trade under scene in high concurrent.
Fig. 4 is that the transaction in a kind of high concurrent transaction data processing method of the application in one embodiment executes feedback
Process schematic, as shown, the S3, execute parallel in each atom transaction set atom transaction after, obtain the original friendship
The transaction results of easy data, comprising:
S31, any atom transaction selected at random in each atom transaction set respectively are used as initial transaction；
Specifically, the quantity that atom in atom transaction set can be traded is as change certainly when progress atom transaction is selected
It measures and determines the initial atom to be executed in each atom transaction set transaction after ginseng is calculated into random function.Random function
The function for exactly generating random number is function critically important in EXCEL, also has rand () in C language, the random letter such as srand ()
Number.
S32, each initial transaction is executed parallel, obtain the transaction results of several initial transactions, obtain each described initial
Logical relation between the transaction results of transaction determines according to the logical relation and connects execution in each atom transaction set
Atom transaction；
Wherein, there are three types of situations, i.e. "AND", "or", " non-" for the logical relation between each initial transaction；It is pending determining
Atom transaction when, illustrate if being the relationship of "AND" between any two transaction results between this 2 transaction results have close
Connection is then executing the transaction executed respectively after atom transaction is centrally located at the two initial transactions when atom transaction next time,
And the case where for "or" and " non-", then continue the random atom that executes and trades.
S33, the implementing result obtained after each atom transaction executes is obtained, is obtained after removal intermediate result described original
The transaction results of transaction data；
Specifically, being that intermediate result can be sentenced with applied statistics method for the transaction results of each atom transaction
Disconnected, if the implementing result occurs at least twice, the implementing result is intermediate result, i.e., after a certain atom transaction execution
Condition of the result arrived as the transaction starting of another atom.
S34, discrepancy is obtained after being compared the transaction results with expected results, the difference is clicked and entered into ginseng to mistake
Final transaction results are obtained after carrying out error correction in poor correction model.
Wherein, there are many clear advantages for error correction model: a) use of first-order difference item eliminates variable and may deposit
Trend factor, so as to avoid False value problem；B) it is that may be present more also to eliminate model for the use of first-order difference item
Weight synteny problem；C) introducing of error correction item ensure that the information of variable level value is not ignored；D) since error is repaired
The stationarity of positve term itself allows the homing method of model classics to be estimated that especially Difference Terms can in model
It is chosen with using common t to examine with F inspection.Therefore, an important problem is exactly: whether the relationship between variable all
It can be stated by error correction model, on this question, Engle and Granger1987 propose famous Grange table
State theorem.
The present embodiment carries out error correction by the implementing result traded to atom, to ensure that the standard of transaction results
True property.
In one embodiment, the S22, calculate the Reference Transactions process and any transaction process to be associated it
Between single-factor matching degree, comprising:
Calculate the text similarity of the Reference Transactions process and any transaction process to be associated；
Wherein, text similarity can be calculated using text comparison algorithm, and Hamming can be used when being calculated
Distance algorithm refers to that Hamming distance is used in data transmission error control coding the inside, and Hamming distance is a concept, its table
Show that two (equal length) words correspond to the different quantity in position, we indicate the Hamming distance between two words x, y with d (x, y).It is right
Two character strings carry out XOR operation, and the number that statistical result is 1, then this number is exactly Hamming distance.
If the text similarity is 0, the single-factor matching degree is 0, if the text similarity is not 0, is counted
Calculate the level similarity of the Reference Transactions process and any transaction process to be associated；
The single-factor matching degree is obtained according to the text similarity and the level similarity.
Wherein, the concept of level in movement track, i.e. transaction process are referred to for the level similarity for process of trading
In one section of code whether play and be carried forward transaction process, still returned, by the side for establishing similar spaces coordinate
Code in transaction process is divided into multiple regions by formula, each region is exactly a level.Similarity meter between level
Calculate the common method that can apply similarity calculation, such as cosine similarity calculating, Euclidean distance, Hamming distance calculating side
Method.
The present embodiment can effectively obtain the matching of the single-factor between each transaction process by this paper similarity calculation
Degree.
In one embodiment, the S23, calculate the Reference Transactions process and any transaction process to be associated it
Between multiple-factor matching degree, comprising:
It obtains the Reference Transactions process and any transaction process to be associated executes the data information after preceding or execution；
Specifically, asserting in original transaction data can be searched, it can determine that each transaction process is held according to asserting
Data information before row and after executing.
Changed data are extracted from the data information, obtain dimension corresponding to the changed data
Spend information；
Wherein, dimensional information is primarily referred to as the mode of data variation, for example, the time changes, then dimension is time, gold
Volume changes, and corresponding dimension is amount of money etc..
The factor quantity that need to be calculated according to the dimensional information determination；
Specifically, a dimension corresponds to a factor.
The dimension weight for obtaining each dimension obtains described more according to the similarity between the dimension weight and each factor
Factor matching degree.
The present embodiment, by dimension variation information, to correctly obtain the multiple-factor between each transaction process
With degree.
In one embodiment, the S34, the transaction results are compared with expected results after obtain discrepancy,
The difference is clicked and entered after ginseng carries out error correction into error correction model and obtains final transaction results, comprising:
Discrepancy is obtained after the transaction results are compared with expected results, theorem is stated to described by Grange
The parameter of discrepancy carries out first step amendment, correction formula are as follows:
ΔYt=lag (Δ Y)-λ (μ t-1),
In formula, μ t-1 is non-balancing error item, and λ is short-term correction parameter, Δ YtFor error difference, Δ Y is to measure transaction
As a result with the parameter of measurement of expected results, t is the amendment period, and value range is the positive integer more than or equal to 1；
It will carry out assisting whole recurrence by the Grange statement corrected parameter of measurement of theorem, and obtain and assist whole vector；
It after the whole vector of association is input to error correction model, obtains assisting whole regression parameter, the whole recurrence of association is joined
Number is modified the parameter of measurement as weight, after being modified according to revised parameter of measurement to the transaction results
Obtain final transaction results.
Wherein, the Co-integration Theory and its method that Engle in 1987 and Granger are proposed, mention for the modeling of non-stationary series
Another way is supplied.Although some economic variables is non-stationary series in itself, their linear combination is but possible to
It is stationary sequence.This stable linear combination, which is referred to as, assists perfect square journey, and may be interpreted as steady in a long-term equal between variable
Weighing apparatus relationship.And Lag () function is exactly the last record for taking current order, in the present embodiment to calculate carrying out the t period
When, it needs to take the t-1 times error difference as one in error correction process.
The present embodiment states theorem by Grange and one-step method effectively corrects transaction results, to make to trade
As a result more accurate.
In one embodiment it is proposed that a kind of high concurrent transaction data processing unit, as shown in figure 5, including such as lower die
Block:
Module 51 is established in atom transaction, is set as obtaining original transaction data, is extracted the friendship in the original transaction data
The original transaction data is divided into several atoms according to the transaction progress information and traded by easy progress information；
Atom transaction cluster module 52, is set as calculating the degree of association between each transaction process, according to degree of association meter
It calculates result and atom transaction is clustered into several atom transaction sets；
Transaction executes feedback module 53, after being set as executing the atom transaction in each atom transaction set parallel, obtains described
The transaction results of original transaction data.
In one embodiment it is proposed that a kind of computer equipment, the computer equipment includes memory and processor,
Computer-readable instruction is stored in memory, when computer-readable instruction is executed by processor, so that processor execution is above-mentioned
The step of high concurrent transaction data processing method in each embodiment.
In one embodiment it is proposed that a kind of storage medium for being stored with computer-readable instruction, this is computer-readable
When instruction is executed by one or more processors, so that one or more processors execute the height in the various embodiments described above simultaneously
The step of sending out transaction data processing method.Wherein, the storage medium can be non-volatile memory medium.
Those of ordinary skill in the art will appreciate that all or part of the steps in the various methods of above-described embodiment is can
It is completed with instructing relevant hardware by program, which can be stored in a computer readable storage medium, storage
Medium may include: read-only memory (ROM, Read Only Memory), random access memory (RAM, Random
Access Memory), disk or CD etc..
Each technical characteristic of embodiment described above can be combined arbitrarily, for simplicity of description, not to above-mentioned reality
It applies all possible combination of the technical characteristic in example to be all described, as long as however, lance is not present in the combination of these technical characteristics
Shield all should be considered as described in this specification.
The some exemplary embodiments of the application above described embodiment only expresses, wherein describe it is more specific and detailed,
But it cannot be understood as the limitations to the application the scope of the patents.It should be pointed out that for the ordinary skill of this field
For personnel, without departing from the concept of this application, various modifications and improvements can be made, these belong to the application
Protection scope.Therefore, the scope of protection shall be subject to the appended claims for the application patent.
Claims (10)
1. a kind of high concurrent transaction data processing method characterized by comprising
Original transaction data is obtained, the transaction progress information in the original transaction data is extracted, is believed according to the transaction process
The original transaction data is divided into several atoms and traded by breath；
Calculate the degree of association between each transaction process, according to calculation of relationship degree result by the atom transaction be clustered into it is several
Atom transaction set；
After executing the atom transaction in each atom transaction set parallel, the transaction results of the original transaction data are obtained.
2. the method for high concurrent transaction data processing according to claim 1, which is characterized in that described to obtain original transaction
Data extract the transaction progress information in the original transaction data, according to the transaction progress information by the original transaction
Data are divided into several atom transaction, comprising:
The ID mark for obtaining the transaction sender of original transaction data identifies to obtain sender according to the ID of the transaction sender
Key；
Sender's key is sent to each transaction terminal, receives the feedback information of each transaction terminal, by the feedback letter
Contain the transaction terminal of sender's key in breath as transaction reciever；
The configuration information for obtaining the transaction sender and the transaction reciever, determines described original according to the configuration information
All Activity process needed for transaction data；
Resource information needed for obtaining each transaction process obtains each atom according to resource information needed for the transaction process
The Transaction Information is split into several atoms according to the data capacity and traded by the data capacity that exchange includes.
3. the method for high concurrent transaction data processing according to claim 1, which is characterized in that described to calculate each friendship
Atom transaction is clustered into several atom transaction sets according to calculation of relationship degree result by the degree of association between easy process, comprising:
The atom transaction data for obtaining multiple transaction processes, using any transaction process as Reference Transactions process, Qi Tajiao
Easy process is as transaction process to be associated；
Calculate the single-factor matching degree between the Reference Transactions process and any transaction process to be associated；
Calculate the multiple-factor matching degree between the Reference Transactions process and any transaction process to be associated；
It obtains the Reference Transactions process according to the calculated result of the single-factor matching degree and the multiple-factor matching degree and appoints
The degree of association is greater than corresponding to the transaction process of preset degree of association threshold value by the degree of association of the one transaction process to be associated
Atom transaction data be clustered into an atom transaction set.
4. the method for high concurrent transaction data processing according to claim 3, which is characterized in that described to execute each original parallel
After atom transaction in sub- transaction set, the transaction results of the original transaction data are obtained, comprising:
Any atom transaction in each atom transaction set is selected at random respectively as initial transaction；
Each initial transaction is executed parallel, obtains the transaction results of several initial transactions, obtains the friendship of each initial transaction
Logical relation between easy result determines that the atom that execution is connected in each atom transaction set is handed over according to the logical relation
Easily；
The implementing result obtained after each atom transaction executes is obtained, obtains the original transaction data after removing intermediate result
Transaction results；
Discrepancy is obtained after the transaction results are compared with expected results, the difference is clicked and entered into ginseng to error correction mould
Final transaction results are obtained after carrying out error correction in type.
5. the method for high concurrent transaction data processing according to claim 3, which is characterized in that described to calculate the reference
Single-factor matching degree between transaction process and any transaction process to be associated, comprising:
Calculate the text similarity of the Reference Transactions process and any transaction process to be associated；
If the text similarity is 0, the single-factor matching degree is 0, if the text similarity is not 0, calculates institute
State the level similarity of Reference Transactions process and any transaction process to be associated；
The single-factor matching degree is obtained according to the text similarity and the level similarity.
6. according to the method for the high concurrent transaction data processing that claim 3 is stated, which is characterized in that described to calculate the reference friendship
Multiple-factor matching degree between easy process and any transaction process to be associated, comprising:
It obtains the Reference Transactions process and any transaction process to be associated executes the data information after preceding or execution；
Changed data are extracted from the data information, obtain the letter of dimension corresponding to the changed data
Breath；
The factor quantity that need to be calculated according to the dimensional information determination；
The dimension weight for obtaining each dimension obtains the multiple-factor according to the similarity between the dimension weight and each factor
Matching degree.
7. the method for high concurrent transaction data processing according to claim 4, which is characterized in that described to tie the transaction
Fruit obtains discrepancy after being compared with expected results, and the difference is clicked and entered ginseng and carries out error correction into error correction model
After obtain final transaction results, comprising:
Discrepancy is obtained after the transaction results are compared with expected results, theorem is stated to the difference by Grange
The parameter of point carries out first step amendment, correction formula are as follows:
ΔYt=lag (Δ Y)-λ (μ t-1),
In formula, μ t-1 is non-balancing error item, and λ is short-term correction parameter, Δ YtFor error difference, Δ Y be measure transaction results with
The parameter of measurement of expected results, t are the amendment periods, and value range is the positive integer more than or equal to 1；
It will carry out assisting whole recurrence by the Grange statement corrected parameter of measurement of theorem, and obtain and assist whole vector；
It after the whole vector of association is input to error correction model, obtains assisting whole regression parameter, the whole regression parameter of association is made
The parameter of measurement is modified for weight, is obtained after being modified according to revised parameter of measurement to the transaction results
Final transaction results.
8. a kind of high concurrent transaction data processing unit, which is characterized in that comprise the following modules:
Module is established in atom transaction, is set as obtaining original transaction data, is extracted the transaction process in the original transaction data
The original transaction data is divided into several atoms according to the transaction progress information and traded by information；
Atom transaction cluster module, is set as calculating the degree of association between each transaction process, according to calculation of relationship degree result
Atom transaction is clustered into several atom transaction sets；
Transaction executes feedback module, after being set as executing the atom transaction in each atom transaction set parallel, obtains the original friendship
The transaction results of easy data.
9. a kind of computer equipment, which is characterized in that including memory and processor, being stored with computer in the memory can
Reading instruction, when the computer-readable instruction is executed by the processor, so that the processor executes such as claim 1 to 7
Any one of high concurrent transaction data processing method described in claim the step of.
10. a kind of storage medium for being stored with computer-readable instruction, which is characterized in that the computer-readable instruction is by one
Or multiple processors are when executing, so that one or more processors are executed as described in any one of claims 1 to 7 claim
The step of high concurrent transaction data processing method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910427878.6A CN110298750A (en) | 2019-05-22 | 2019-05-22 | High concurrent transaction data processing method, device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910427878.6A CN110298750A (en) | 2019-05-22 | 2019-05-22 | High concurrent transaction data processing method, device, computer equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110298750A true CN110298750A (en) | 2019-10-01 |
Family
ID=68027121
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910427878.6A Pending CN110298750A (en) | 2019-05-22 | 2019-05-22 | High concurrent transaction data processing method, device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110298750A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112073366A (en) * | 2020-07-23 | 2020-12-11 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | Data processing method for railway financial system and data center |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130232045A1 (en) * | 2012-03-04 | 2013-09-05 | Oracle International Corporation | Automatic Detection Of Fraud And Error Using A Vector-Cluster Model |
| CN105809448A (en) * | 2014-12-30 | 2016-07-27 | 阿里巴巴集团控股有限公司 | Account transaction clustering method and system thereof |
| CN108984668A (en) * | 2018-06-29 | 2018-12-11 | 深圳鼎盛电脑科技有限公司 | A kind of method, apparatus of data processing, equipment and storage medium |
-
2019
- 2019-05-22 CN CN201910427878.6A patent/CN110298750A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130232045A1 (en) * | 2012-03-04 | 2013-09-05 | Oracle International Corporation | Automatic Detection Of Fraud And Error Using A Vector-Cluster Model |
| CN105809448A (en) * | 2014-12-30 | 2016-07-27 | 阿里巴巴集团控股有限公司 | Account transaction clustering method and system thereof |
| CN108984668A (en) * | 2018-06-29 | 2018-12-11 | 深圳鼎盛电脑科技有限公司 | A kind of method, apparatus of data processing, equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112073366A (en) * | 2020-07-23 | 2020-12-11 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | Data processing method for railway financial system and data center |
| CN112073366B (en) * | 2020-07-23 | 2023-02-17 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | Data processing method for railway financial system and data center |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chen et al. | Continuous incident triage for large-scale online service systems | |
| CN109948728A (en) | The method and apparatus of the training of abnormal transaction detection model and abnormal transaction detection | |
| CN109544037A (en) | It is a kind of without intrusive securities futures trading air control gateway system in advance | |
| Post et al. | Portfolio analysis using stochastic dominance, relative entropy, and empirical likelihood | |
| CN108595539A (en) | A kind of recognition methods of trace analogical object and system based on big data | |
| CN113011973B (en) | Method and equipment for financial transaction supervision model based on intelligent contract data lake | |
| CN103605703A (en) | Method and system for data consistency detection among multiple platforms | |
| KR102133886B1 (en) | Method and system for predicting cryptographic price using artificial intelligence | |
| CN111008898B (en) | Method and apparatus for evaluating model interpretation tools | |
| CN114612251A (en) | Risk assessment method, device, equipment and storage medium | |
| CN109934700A (en) | A kind of method and device of arbitrage detecting | |
| CN106951913A (en) | The method for carrying out data exchange, cloud platform and system | |
| EP3185184A1 (en) | The method for analyzing a set of billing data in neural networks | |
| CN110298750A (en) | High concurrent transaction data processing method, device, computer equipment and storage medium | |
| CN111144899A (en) | Method and device for identifying false transactions and electronic equipment | |
| CN109634979A (en) | Data-updating method and device | |
| CN114219497A (en) | Account information determination method and device and server | |
| CN115660540B (en) | Cargo tracking method, cargo tracking device, computer equipment and storage medium | |
| CN108985755A (en) | A kind of account state identification method, device and server | |
| CN112346995B (en) | Banking industry-based test risk prediction model construction method and device | |
| CN111932131B (en) | Service data processing method and device | |
| CN110942180B (en) | Industrial design matching service side prediction method based on xgboost algorithm | |
| Minnoor et al. | Nifty price prediction from Nifty SGX using machine learning, neural networks and sentiment analysis | |
| CN116308370A (en) | Training method of abnormal transaction recognition model, abnormal transaction recognition method and device | |
| CN111340622A (en) | Abnormal transaction cluster detection method and device |
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 |