CN109377368A - Sequence liquidation method, device, computer equipment and storage medium under distributed environment - Google Patents
Sequence liquidation method, device, computer equipment and storage medium under distributed environment Download PDFInfo
- Publication number
- CN109377368A CN109377368A CN201811299547.0A CN201811299547A CN109377368A CN 109377368 A CN109377368 A CN 109377368A CN 201811299547 A CN201811299547 A CN 201811299547A CN 109377368 A CN109377368 A CN 109377368A
- Authority
- CN
- China
- Prior art keywords
- clearance
- slave
- clearing
- clearing transactions
- serial number
- 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
- 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
Abstract
The present invention is suitable for computer field, sequence liquidation method, device, computer equipment and storage medium under distributed environment are provided, described method includes following steps: the transaction data cleared will be needed uniformly to be cached in the clearance slave according to time and clearance slave caching serial number distribution；Calculate the clearance slave starting trading order number；To clearance slave distribution clearance request；Sequence of the clearance slave to the clearing transactions for meeting the clearance request is obtained, and calculates the serial number of the clearing transactions；The clearing transactions are cleared according to the serial number.In embodiments of the present invention, by the serial number for clearing transactions data being ranked up and being calculated according to default rule under distributed environment every clearing transactions, to realize that fund clearing is carried out by exchange hour sequence, the problem of entanglement easily occurs for plurality magnitude fund clearing under distributed environment is effectively prevented.
Description
Technical field
The invention belongs to sequence liquidation method, device, computer equipments under computer field more particularly to distributed environment
And storage medium.
Background technique
Fund clearing, which refers to, to be handled fund allocation and transfer, transfers payment and settlement fund between financial institution, and to thus caused
Fund deposits the liquidation for owing progress.
Cleared at present generally by single machine realization sequence, can not support the clearance of big data quantity, there are low memory and
Clear effective problem.Memory and clearance timeliness when although can solve big data quantity clearance using distributed liquidation method are asked
Topic, but clearing transactions are based on distribution by clearing transactions fragment cache memory in each server, especially when trading volume is larger
It is easy clearance result and is easy to happen entanglement, how to be cleared by transaction time of origin sequence, solved during distribution clearance
A problem certainly.
Therefore, it is necessary to invent a kind of liquidation method to solve under distributed environment, when fund clearing is realized by transaction
Between sequentially clear.
Summary of the invention
The embodiment of the present invention provides sequence liquidation method, device, computer equipment and storage medium under distributed environment, leads to
It crosses and clearing transactions data is ranked up and is calculated every clearing transactions according to default rule under distributed environment
Serial number, thus realize fund clearing by exchange hour sequence carry out.
The embodiment of the present invention provides sequence liquidation method under distributed environment, is applied to clearance host, which is characterized in that institute
The method of stating includes the following steps:
The transaction data cleared will be needed uniformly to be cached according to time and clearance slave caching serial number distribution described
Clear slave；
Calculate the clearance slave starting trading order number；
To clearance slave distribution clearance request；
Sequence of the clearance slave to the clearing transactions for meeting the clearance request is obtained, and calculates the clearance and hands over
Easy serial number；
The clearing transactions are cleared according to the serial number.
Device is sequentially cleared under a kind of distributed environment, which is characterized in that described device includes:
Cache unit, the transaction data for that will need to clear are distributed according to time and clearance slave caching serial number
It is even to be cached in the clearance slave；
First computing unit, for calculating the clearance slave starting trading order number；
Clearance request Dispatching Unit, for distributing clearance request to clearance slave；
Second computing unit, for obtaining sequence of the clearance slave to the clearing transactions for meeting the clearance request,
And calculate the serial number of the clearing transactions；
Unit is cleared, for clearing the clearing transactions according to the serial number.
In conclusion by the way that clearing transactions data are ranked up and are counted according to default rule under distributed environment
It calculates and obtains the serial number of every clearing transactions, to realize that fund clearing is carried out by exchange hour sequence, effectively prevent point
The problem of entanglement, easily occurs for plurality magnitude fund clearing under cloth environment.
Detailed description of the invention
Fig. 1 is the flow chart of sequence liquidation method under distributed environment provided in an embodiment of the present invention；
Fig. 2 is the clearing transactions sequence schematic diagram of clearance slave provided in an embodiment of the present invention；
The flow chart of sequence liquidation method under Fig. 3 is provided in an embodiment of the present invention and distributed environment；
The flow chart of sequence liquidation method under Fig. 4 is provided in an embodiment of the present invention and distributed environment；
Fig. 5 is the structural block diagram that device is sequentially cleared under a kind of distributed environment provided in an embodiment of the present invention；
Fig. 6 is the structural block diagram that device is sequentially cleared under another distributed environment provided in an embodiment of the present invention；
Fig. 7 is the structural block diagram that device is sequentially cleared under another distributed environment provided in an embodiment of the present invention.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.
The present invention is applied to clearance host, and the clearance host is the terminal with data transmission, storage and processing capacity
Equipment, such as computer.
Fig. 1 shows sequence liquidation method under distributed environment provided in an embodiment of the present invention, is applied to clearance host,
It is characterized in that, described method includes following steps:
Step S101 is distributed uniformly slow according to time and clearance slave caching serial number by the transaction data for needing to clear
It is stored in the clearance slave.
In embodiments of the present invention, take in advance caching and distributed buffer memory strategy, by all clearing transactions files according to
The fragment cache memory solves single node and is restricted by memory to each clearance subordinate computer node, and what the excessive cache of trading volume overflowed asks
Topic.Need the clearing transactions data buffer storage cleared into internal fragmentation for described before clearance, according still further to time sequencing and clearance
The clearing transactions data distribution formula cached is stored in each clearance slave by slave sequence server, caching when avoiding clearing
It reloads clearance file and occupies clearance duration.
Preferably, internal fragmentation can be carried out according to the interstitial content of clearance slave, can also be preset according to user
Numerical value carry out internal fragmentation.For example, memory can be divided into 2 by clearance host when clearing slave number is 2；Also
Memory can be fixed and be divided into 2, corresponding 2 clearance slaves, even if the number of clearance slave is 3 or more.
Preferably, for the ease of by the clearing transactions file in internal fragmentation correctly cache to corresponding clearance from
In the memory of machine, needs to pre-establish different internal fragmentations and clear the corresponding relationship of slave, it can be corresponding with a clearance slave
One internal fragmentation can also correspond to multiple internal fragmentations with a clearance slave.Host is cleared according to the preset memory point
The clearing transactions data distribution formula is cached in clearance slave by the corresponding relationship of piece and clearance slave.Such as internal fragmentation 1
Corresponding clearance slave 1, the corresponding clearance slave 2 of internal fragmentation 2；It can also be with the corresponding clearance slave 1 of internal fragmentation 1 and 2, internal fragmentation
3 corresponding clearance slaves 2.
Step S102 calculates the clearance slave and originates trading order number.
In embodiments of the present invention, clearance Framework computing respectively clears clearing transactions stroke count of the slave in clearance range, obtains
Each clearance subordinate computer node originates trading order number out, e.g., have clearance subordinate computer node according to cache node sequence have A1, A2,
A3 ..., An, clearing transactions stroke count of the corresponding each clearance subordinate computer node in clearance range be B1, B2, B3 ..., Bn, then respectively
The start sequence number for clearing subordinate computer node is Cn=∑ (B1+B2+ ...+Bn-1).
Step S103, to clearance slave distribution clearance request.
After serial number is traded in the starting for calculating clearance slave, clearance host can issue clearance to clearance slave and ask
It asks.
After clearing initiation, first check whether advice of settlement can be cleared, when account date clearing transactions buffer status is " slow
In punching " when, illustrate that the clearing transactions are caching, terminate clearance, otherwise, cleared as required, and will clearance task point
Issue clearance slave:
It preferably, before further include that other are summarized to the request of class charging element to be distributed to clearance slave distribution clearance request
Slave is cleared, by the corresponding charging regulation of clearance slave traversal advice of settlement clearance rule, analyzes all chargings of clearance rule
Element.
Calculate it is all summarize class charging element, the class charging element that summarizes is calculated separately by the clearance slave, then
Summarized by clearance host, finally obtains each charging element value.
Step S104 obtains sequence of the clearance slave to the clearing transactions for meeting the clearance request, and calculates
The serial number of the clearing transactions.
In embodiments of the present invention, after the clearance slave receives the clearance request that clearance host is sent, according to clearance
The condition requirement of request checks all clearing transactions of the clearance slave caching, filters out all clearances that meet and ask
The clearing transactions of condition are sought, the stroke count of the qualified clearing transactions is calculated, and are met according to default rule described
The clearing transactions of condition are ranked up.
Preferably, it can be compiled according to the buffer structure of the clearance host and the clearance slave with account date, account
Number or the selections such as service-number meet the clearing transactions of terms of settlement, there may be multiple clearing transactions to arrange for each clearance slave
Multiple clearing transactions sublist need to be merged and be ranked up according to above-mentioned account date, coding of accounts or service-number etc. by table,
As shown in Figure 2: for example a certain clearance slave is there are two clearance lists, two column of left and right in respectively Fig. 2, in each clearance list
Have multiple clearing transactions for meeting terms of settlement, it is assumed that by two lists clearing transactions merge, according to exchange hour into
Row sequence, it can show that all clearing transactions among Fig. 2 after the sequence of a column, every clearing transactions have corresponding sequence
Number, this serial number currently clears slave to the serial number after clearing transactions sequence qualified in the machine caching.
Preferably, it in order to obtain serial number of the every clearing transactions in this clearance, also needs to combine rising for clearance slave
Beginning trading order number, i.e., the described serial number are qualified clear in the starting trading order number and this clearance slave for clear slave
The sum of transaction serial number is calculated, formula is as follows:
En=Cn+Dn, wherein Cn is clearance slave start sequence number, and Dn is sequence of the clearing transactions after the sequence of current slave
Number, En is clearing transactions serial number.
Step S105 clears the clearing transactions according to the serial number.
After completion is to the sequence of qualified clearing transactions and calculates serial number, clearance slave traverses review institute
There is the clearing transactions file for meeting terms of settlement to be calculated described in all satisfactions according to charging regulation and the clearance mission requirements
Then the charging element value of charging regulation carries out regular operation according to the charging element value, obtains the meter of every clearing transactions
It calculates as a result, generate and be written clearing detail record, ultimately generates clearance result.
Total clearance is generated for the ease of clearance host as a result, the clearance result is returned to clearance master by clearance slave
Machine, clearance host summarize the clearance result and are updated, and complete clearance.
In conclusion by the way that clearing transactions data are ranked up and are counted according to default rule under distributed environment
It calculates and obtains the serial number of every clearing transactions, to realize that fund clearing is carried out by exchange hour sequence, effectively prevent point
The problem of entanglement, easily occurs for plurality magnitude fund clearing under cloth environment.
Fig. 3 is shown suitable for sequence liquidation method flow chart under provided in an embodiment of the present invention and distributed environment, with
Fig. 1 is compared, and step S102 specifically includes step S301 and S302, specific as follows:
Step S301 calculates clearing transactions stroke count of the clearance slave in clearance range.
In embodiments of the present invention, clearance Framework computing respectively clears clearing transactions stroke count of the slave in clearance range.When
It after clearance is initiated, first checks whether advice of settlement can be cleared, when account date clearing transactions buffer status is " in buffering ", says
The bright clearing transactions are caching, and terminate clearance, otherwise, traverse all charging regulations of advice of settlement as required and account returns clearance
The account date in returning, and the clearance slave is obtained according to the calculated qualified clearing transactions pen of default rule
Number.
Step S302 calculates the starting trading order number of the clearance slave by the transaction stroke count.
In embodiments of the present invention, it after obtaining the transaction stroke count, is calculated respectively further according to clearance subordinate computer node number
Clear subordinate computer node originate trading order number, e.g., have clearance subordinate computer node according to cache node sequence have A1, A2, A3 ..., An,
Clearing transactions stroke count of the corresponding each clearance subordinate computer node in clearance range be B1, B2, B3 ..., Bn, then respectively clearance slave section
The start sequence number of point is Cn=∑ (B1+B2+ ...+Bn-1).
In conclusion being calculated clear by being screened in advance to the clearing transactions for meeting terms of settlement in the clearance slave
The transaction stroke count for calculating slave calculates the starting transaction serial number of the clearance slave further according to the interstitial content of clearance slave, from
And convenient for calculating the serial number of every clearing transactions, entanglement will not occur.
Fig. 4 is shown suitable for sequence liquidation method flow chart under provided in an embodiment of the present invention and distributed environment, with
Fig. 1 is compared, and step S103 further includes before specifically step S401 and S402, specific as follows, specific as follows:
Step S401 searches qualified clearing transactions according to clearance request.
In embodiments of the present invention, after the clearance slave receives the clearance request that clearance host is sent, according to clearance
The condition requirement of request checks all clearing transactions of the clearance slave caching, filters out all clearances that meet and ask
Seek the clearing transactions of condition.
Step S402 is ranked up the qualified clearing transactions.
The stroke count of the qualified clearing transactions is calculated, and according to default rule to the qualified clearance
Transaction is ranked up.
In conclusion will need the transaction data buffered in advance cleared by above-mentioned distribution of funds formula liquidation method and examine
Rope is loaded into clearance slave, is cleared using clearance slave, multiple clearance slaves while can be cleared, be preferably resolved
Low memory and clearance imeliness problem when fund clearing trading volume is larger.
Fig. 5 is shown suitable for a kind of structural block diagram of distribution of funds formula clearance device provided in an embodiment of the present invention, is answered
For clearing host, the clearance host is the terminal device with data transmission, storage and processing capacity, such as computer,
It is characterized in that, described device includes:
Cache unit 401, the transaction data for that will need to clear is according to time and clearance slave caching serial number distribution
Formula is uniformly cached in the clearance slave.
In embodiments of the present invention, take in advance caching and distributed buffer memory strategy, by all clearing transactions files according to
The fragment cache memory solves single node and is restricted by memory to each clearance subordinate computer node, and what the excessive cache of trading volume overflowed asks
Topic.Need the clearing transactions data buffer storage cleared into internal fragmentation for described before clearance, according still further to time sequencing and clearance
The clearing transactions data distribution formula cached is stored in each clearance slave by slave sequence server, caching when avoiding clearing
It reloads clearance file and occupies clearance duration.
Preferably, internal fragmentation can be carried out according to the interstitial content of clearance slave, can also be preset according to user
Numerical value carry out internal fragmentation.For example, memory can be divided into 2 by clearance host when clearing slave number is 2；Also
Memory can be fixed and be divided into 2, corresponding 2 clearance slaves, even if the number of clearance slave is 3 or more.
Preferably, for the ease of by the clearing transactions file in internal fragmentation correctly cache to corresponding clearance from
In the memory of machine, needs to pre-establish different internal fragmentations and clear the corresponding relationship of slave, it can be corresponding with a clearance slave
One internal fragmentation can also correspond to multiple internal fragmentations with a clearance slave.Host is cleared according to the preset memory point
The clearing transactions data distribution formula is cached in clearance slave by the corresponding relationship of piece and clearance slave.Such as internal fragmentation 1
Corresponding clearance slave 1, the corresponding clearance slave 2 of internal fragmentation 2；It can also be with the corresponding clearance slave 1 of internal fragmentation 1 and 2, internal fragmentation
3 corresponding clearance slaves 2.
First computing unit 402, for calculating the clearance slave starting trading order number.
In embodiments of the present invention, clearance Framework computing respectively clears clearing transactions stroke count of the slave in clearance range, obtains
Each clearance subordinate computer node originates trading order number out, e.g., have clearance subordinate computer node according to cache node sequence have A1, A2,
A3 ..., An, clearing transactions stroke count of the corresponding each clearance subordinate computer node in clearance range be B1, B2, B3 ..., Bn, then respectively
The start sequence number for clearing subordinate computer node is Cn=∑ (B1+B2+ ...+Bn-1).
Clearance request Dispatching Unit 403, for distributing clearance request to clearance slave.
After serial number is traded in the starting for calculating clearance slave, clearance host can issue clearance to clearance slave and ask
It asks.
After clearing initiation, first check whether advice of settlement can be cleared, when account date clearing transactions buffer status is " slow
In punching " when, illustrate that the clearing transactions are caching, terminate clearance, otherwise, cleared as required, and will clearance task point
Issue clearance slave:
It preferably, before further include that other are summarized to the request of class charging element to be distributed to clearance slave distribution clearance request
Slave is cleared, by the corresponding charging regulation of clearance slave traversal advice of settlement clearance rule, analyzes all chargings of clearance rule
Element.
Calculate it is all summarize class charging element, the class charging element that summarizes is calculated separately by the clearance slave, then
Summarized by clearance host, finally obtains each charging element value.
Second computing unit 404, for obtaining row of the clearance slave to the clearing transactions for meeting the clearance request
Sequence, and calculate the serial number of the clearing transactions.
In embodiments of the present invention, after the clearance slave receives the clearance request that clearance host is sent, according to clearance
The condition requirement of request checks all clearing transactions of the clearance slave caching, filters out all clearances that meet and ask
The clearing transactions of condition are sought, the stroke count of the qualified clearing transactions is calculated, and are met according to default rule described
The clearing transactions of condition are ranked up.
Preferably, it can be compiled according to the buffer structure of the clearance host and the clearance slave with account date, account
Number or the selections such as service-number meet the clearing transactions of terms of settlement, there may be multiple clearing transactions to arrange for each clearance slave
Multiple clearing transactions sublist need to be merged and be ranked up according to above-mentioned account date, coding of accounts or service-number etc. by table,
As shown in Figure 2: for example a certain clearance slave is there are two clearance lists, two column of left and right in respectively Fig. 2, in each clearance list
Have multiple clearing transactions for meeting terms of settlement, it is assumed that by two lists clearing transactions merge, according to exchange hour into
Row sequence, it can show that all clearing transactions among Fig. 2 after the sequence of a column, every clearing transactions have corresponding sequence
Number, this serial number currently clears slave to the serial number after clearing transactions sequence qualified in the machine caching.
Preferably, it in order to obtain serial number of the every clearing transactions in this clearance, also needs to combine rising for clearance slave
Beginning trading order number, i.e., the described serial number are qualified clear in the starting trading order number and this clearance slave for clear slave
The sum of transaction serial number is calculated, formula is as follows:
En=Cn+Dn, wherein Cn is clearance slave start sequence number, and Dn is sequence of the clearing transactions after the sequence of current slave
Number, En is clearing transactions serial number.
Unit 405 is cleared, for clearing the clearing transactions according to the serial number.
After completion is to the sequence of qualified clearing transactions and calculates serial number, clearance slave traverses review institute
There is the clearing transactions file for meeting terms of settlement to be calculated described in all satisfactions according to charging regulation and the clearance mission requirements
Then the charging element value of charging regulation carries out regular operation according to the charging element value, obtains the meter of every clearing transactions
It calculates as a result, generate and be written clearing detail record, ultimately generates clearance result.
Total clearance is generated for the ease of clearance host as a result, the clearance result is returned to clearance master by clearance slave
Machine, clearance host summarize the clearance result and are updated, and complete clearance.
Fig. 6 shows the structural block diagram suitable for another distribution of funds formula provided in an embodiment of the present invention clearance device,
The first clearance unit further include:
Clearing transactions stroke count computing module 601, for calculating clearing transactions pen of the clearance slave in clearance range
Number.
In embodiments of the present invention, clearance Framework computing respectively clears clearing transactions stroke count of the slave in clearance range.When
It after clearance is initiated, first checks whether advice of settlement can be cleared, when account date clearing transactions buffer status is " in buffering ", says
The bright clearing transactions are caching, and terminate clearance, otherwise, traverse all charging regulations of advice of settlement as required and account returns clearance
The account date in returning, and the clearance slave is obtained according to the calculated qualified clearing transactions pen of default rule
Number.
Trading order computing module 602 is originated, for calculating rising for the clearance slave by the transaction stroke count
Beginning trading order number.
In embodiments of the present invention, it after obtaining the transaction stroke count, is calculated respectively further according to clearance subordinate computer node number
Clear subordinate computer node originate trading order number, e.g., have clearance subordinate computer node according to cache node sequence have A1, A2, A3 ..., An,
Clearing transactions stroke count of the corresponding each clearance subordinate computer node in clearance range be B1, B2, B3 ..., Bn, then respectively clearance slave section
The start sequence number of point is Cn=∑ (B1+B2+ ...+Bn-1).
Fig. 7 shows the structural block diagram suitable for another distribution of funds formula provided in an embodiment of the present invention clearance device,
Described device further include:
Searching unit 701, for searching qualified clearing transactions according to clearance request.
In embodiments of the present invention, after the clearance slave receives the clearance request that clearance host is sent, according to clearance
The condition requirement of request checks all clearing transactions of the clearance slave caching, filters out all clearances that meet and ask
Seek the clearing transactions of condition.
Sequencing unit 702, for being ranked up to the qualified clearing transactions.
The stroke count of the qualified clearing transactions is calculated, and according to default rule to the qualified clearance
Transaction is ranked up.
In conclusion will need the transaction data buffered in advance cleared by above-mentioned distribution of funds formula liquidation method and examine
Rope is loaded into clearance slave, is cleared using clearance slave, multiple clearance slaves while can be cleared, be preferably resolved
Low memory and clearance imeliness problem when fund clearing trading volume is larger.
In one embodiment it is proposed that a kind of computer equipment, the computer equipment include memory, processor and
It is stored in the computer program that can be run on the memory and on the processor, the processor executes the computer
The step of any one of present invention method is realized when program.
In one embodiment, a kind of computer readable storage medium is provided, is stored on computer readable storage medium
Computer program, when computer program is executed by processor, so that the step of processor executes any one of present invention method.
Although should be understood that various embodiments of the present invention flow chart in each step according to arrow instruction successively
It has been shown that, but these steps are not that the inevitable sequence according to arrow instruction successively executes.Unless expressly state otherwise herein,
There is no stringent sequences to limit for the execution of these steps, these steps can execute in other order.Moreover, each embodiment
In at least part step may include that perhaps these sub-steps of multiple stages or stage are not necessarily multiple sub-steps
Completion is executed in synchronization, but can be executed at different times, the execution in these sub-steps or stage sequence is not yet
Necessarily successively carry out, but can be at least part of the sub-step or stage of other steps or other steps in turn
Or it alternately executes.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the program can be stored in a non-volatile computer and can be read
In storage medium, the program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein, provided herein
Each embodiment used in any reference to memory, storage, database or other media, may each comprise non-volatile
And/or volatile memory.Nonvolatile memory may include that read-only memory (ROM), programming ROM (PROM), electricity can be compiled
Journey ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include random access memory
(RAM) or external cache.By way of illustration and not limitation, RAM is available in many forms, such as static state RAM
(SRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate sdram (DDRSDRAM), enhanced SDRAM
(ESDRAM), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) directly RAM (RDRAM), straight
Connect memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) 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 each technical characteristic in example to be all described, as long as however, the combination of these technical characteristics is not deposited
In contradiction, all should be considered as described in this specification.
The embodiments described above only express several embodiments of the present invention, and the description thereof is more specific and detailed, but simultaneously
Limitations on the scope of the patent of the present invention therefore cannot be interpreted as.It should be pointed out that for those of ordinary skill in the art
For, without departing from the inventive concept of the premise, various modifications and improvements can be made, these belong to guarantor of the invention
Protect range.Therefore, the scope of protection of the patent of the invention shall be subject to the appended claims.
Claims (10)
1. sequence liquidation method under distributed environment is applied to clearance host, which is characterized in that the method includes walking as follows
It is rapid:
The transaction data cleared will be needed uniformly to be cached in the clearance according to time and clearance slave caching serial number distribution
Slave；
Calculate the clearance slave starting trading order number；
To clearance slave distribution clearance request；
Sequence of the clearance slave to the clearing transactions for meeting the clearance request is obtained, and calculates the clearing transactions
Serial number；
The clearing transactions are cleared according to the serial number.
2. sequence liquidation method under distributed environment according to claim 1, which is characterized in that described to calculate the clearance
The step of slave starting trading order, specifically includes:
Calculate clearing transactions stroke count of the clearance slave in clearance range；
The starting trading order number of the clearance slave is calculated by the transaction stroke count.
3. sequence liquidation method under distributed environment according to claim 1, which is characterized in that described to obtain the clearance
Before slave is to the sequence for the clearing transactions for meeting the clearance request, further includes:
Qualified clearing transactions are searched according to clearance request；
In embodiments of the present invention, it after the clearance slave receives the clearance request that clearance host is sent, is requested according to clearance
Condition requirement, to it is described clearance slave caching all clearing transactions check, filter out it is all meet clearance request item
The clearing transactions of part.
The qualified clearing transactions are ranked up.
The stroke count of the qualified clearing transactions is calculated, and according to default rule to the qualified clearing transactions
It is ranked up.
4. sequence liquidation method under distributed environment according to claim 1, which is characterized in that it is described calculate it is described clear
The step of calculating the serial number of transaction specifically includes:
En=Cn+Dn；
Wherein En be clearing transactions serial number, Cn be clear slave starting connection serial number, Dn for clearing transactions currently from
Serial number after machine sequence.
5. sequentially clearing device under a kind of distributed environment, which is characterized in that described device includes:
Cache unit, the transaction data for that will need to clear are distributed uniformly slow according to time and clearance slave caching serial number
It is stored in the clearance slave；
First computing unit, for calculating the clearance slave starting trading order number；
Clearance request Dispatching Unit, for distributing clearance request to clearance slave；
Second computing unit for obtaining sequence of the clearance slave to the clearing transactions for meeting the clearance request, and is counted
Calculate the serial number of the clearing transactions；
Unit is cleared, for clearing the clearing transactions according to the serial number.
6. sequentially clearing device under distributed environment according to claim 5, which is characterized in that the first clearance unit
Further include:
Clearing transactions stroke count computing module, for calculating clearing transactions stroke count of the clearance slave in clearance range；
Trading order computing module is originated, the starting for calculating the clearance slave by the transaction stroke count is traded suitable
Serial number.
7. sequentially clearing device under distributed environment according to claim 5, which is characterized in that described device further include:
Searching unit, for searching qualified clearing transactions according to clearance request；
Sequencing unit, for being ranked up to the qualified clearing transactions.
8. sequentially clearing device under distributed environment according to claim 5, which is characterized in that it is described calculate it is described clear
The step of calculating the serial number of transaction specifically includes:
En=Cn+Dn；
Wherein En be clearing transactions serial number, Cn be clear slave starting connection serial number, Dn for clearing transactions currently from
Serial number after machine sequence.
9. a kind of computer equipment, which is characterized in that the computer equipment includes processor, and the processor is deposited for executing
The calculating formula program stored in reservoir realizes the step of method according to any of claims 1-4.
10. a kind of computer readable storage medium is stored thereon with computer program (instruction), which is characterized in that the calculating
When machine program (instruction) is executed by processor, realize method according to any of claims 1-4 the step of.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811299547.0A CN109377368A (en) | 2018-11-02 | 2018-11-02 | Sequence liquidation method, device, computer equipment and storage medium under distributed environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811299547.0A CN109377368A (en) | 2018-11-02 | 2018-11-02 | Sequence liquidation method, device, computer equipment and storage medium under distributed environment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109377368A true CN109377368A (en) | 2019-02-22 |
Family
ID=65397329
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811299547.0A Pending CN109377368A (en) | 2018-11-02 | 2018-11-02 | Sequence liquidation method, device, computer equipment and storage medium under distributed environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109377368A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110659308A (en) * | 2019-09-24 | 2020-01-07 | 华润网络(深圳)有限公司 | Data clearing processing method and device |
| CN111178899A (en) * | 2020-04-10 | 2020-05-19 | 支付宝(杭州)信息技术有限公司 | Resource processing method and device and transaction processing method and device |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1588405A (en) * | 2004-08-31 | 2005-03-02 | 杭州恒生电子股份有限公司 | Data processing device and method for risk control system |
| CN102890807A (en) * | 2011-07-20 | 2013-01-23 | 中兴通讯股份有限公司 | Method and device for generating splitting rules of clearing settlement sub-system |
| CN104751359A (en) * | 2013-12-30 | 2015-07-01 | 中国银联股份有限公司 | System and method for payment and settlement |
| CN105869048A (en) * | 2016-03-28 | 2016-08-17 | 中国建设银行股份有限公司 | Data processing method and system |
| US20160350854A1 (en) * | 2015-06-01 | 2016-12-01 | Chicago Mercantile Exchange Inc. | Data Structure Management in Hybrid Clearing and Default Processing |
| CN107977457A (en) * | 2017-12-18 | 2018-05-01 | 深圳市快付通金融网络科技服务有限公司 | Data liquidation method, system and computer-readable recording medium |
| CN108009806A (en) * | 2017-12-18 | 2018-05-08 | 深圳市快付通金融网络科技服务有限公司 | Charging regulation collocation method, data system for settling account and computer-readable recording medium |
| CN108090755A (en) * | 2017-12-18 | 2018-05-29 | 深圳市快付通金融网络科技服务有限公司 | Billing model defines method, data system for settling account and computer readable storage medium |
| CN108122099A (en) * | 2017-12-08 | 2018-06-05 | 平安科技（深圳）有限公司 | Method, apparatus, storage medium and the terminal of produce clearing |
| CN108171489A (en) * | 2017-12-18 | 2018-06-15 | 深圳前海微众银行股份有限公司 | Data liquidation method, system and computer readable storage medium |
| CN108352014A (en) * | 2015-07-09 | 2018-07-31 | 里奎德市场集团公司 | Use the technology business of block chain, clearance and the system and method for settling accounts securities trading |
| CN108509548A (en) * | 2018-03-20 | 2018-09-07 | 北京资配易投资顾问有限公司 | Liquidation method, device and the distributed type assemblies system for settling account of stock account |
-
2018
- 2018-11-02 CN CN201811299547.0A patent/CN109377368A/en active Pending
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1588405A (en) * | 2004-08-31 | 2005-03-02 | 杭州恒生电子股份有限公司 | Data processing device and method for risk control system |
| CN102890807A (en) * | 2011-07-20 | 2013-01-23 | 中兴通讯股份有限公司 | Method and device for generating splitting rules of clearing settlement sub-system |
| CN104751359A (en) * | 2013-12-30 | 2015-07-01 | 中国银联股份有限公司 | System and method for payment and settlement |
| US20160350854A1 (en) * | 2015-06-01 | 2016-12-01 | Chicago Mercantile Exchange Inc. | Data Structure Management in Hybrid Clearing and Default Processing |
| CN108352014A (en) * | 2015-07-09 | 2018-07-31 | 里奎德市场集团公司 | Use the technology business of block chain, clearance and the system and method for settling accounts securities trading |
| CN105869048A (en) * | 2016-03-28 | 2016-08-17 | 中国建设银行股份有限公司 | Data processing method and system |
| CN108122099A (en) * | 2017-12-08 | 2018-06-05 | 平安科技（深圳）有限公司 | Method, apparatus, storage medium and the terminal of produce clearing |
| CN107977457A (en) * | 2017-12-18 | 2018-05-01 | 深圳市快付通金融网络科技服务有限公司 | Data liquidation method, system and computer-readable recording medium |
| CN108009806A (en) * | 2017-12-18 | 2018-05-08 | 深圳市快付通金融网络科技服务有限公司 | Charging regulation collocation method, data system for settling account and computer-readable recording medium |
| CN108090755A (en) * | 2017-12-18 | 2018-05-29 | 深圳市快付通金融网络科技服务有限公司 | Billing model defines method, data system for settling account and computer readable storage medium |
| CN108171489A (en) * | 2017-12-18 | 2018-06-15 | 深圳前海微众银行股份有限公司 | Data liquidation method, system and computer readable storage medium |
| CN108509548A (en) * | 2018-03-20 | 2018-09-07 | 北京资配易投资顾问有限公司 | Liquidation method, device and the distributed type assemblies system for settling account of stock account |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110659308A (en) * | 2019-09-24 | 2020-01-07 | 华润网络(深圳)有限公司 | Data clearing processing method and device |
| CN111178899A (en) * | 2020-04-10 | 2020-05-19 | 支付宝(杭州)信息技术有限公司 | Resource processing method and device and transaction processing method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109194495B (en) | Server, message processing method, and computer-readable storage medium | |
| CN108304554A (en) | File declustering method, apparatus, computer equipment and storage medium | |
| CN109377368A (en) | Sequence liquidation method, device, computer equipment and storage medium under distributed environment | |
| CN106096926B (en) | Event processing method, device, electronic device and storage medium | |
| CN111125106B (en) | Batch running task execution method, device, server and storage medium | |
| US10678192B1 (en) | Optimization of production systems | |
| US8285612B2 (en) | Systems and methods for data processing | |
| CN110378723A (en) | Product mix relationship determines method, apparatus, computer equipment and storage medium | |
| CN106034148B (en) | Rapid information interaction method, local server, remote server and system | |
| CN111125168B (en) | Data processing method and device, electronic equipment and storage medium | |
| CN111581253A (en) | Real-time detection method and system based on anti-fraud model | |
| CN116151982A (en) | Transaction data processing method, device, equipment and medium for hot spot account | |
| CN115860952A (en) | Transaction processing method and device | |
| CN111524002A (en) | Method and device for determining credit line of joint name card | |
| CN109584068A (en) | A kind of distribution of funds formula liquidation method, apparatus and system | |
| US10032217B2 (en) | Reconciliation for enabling accelerated access to contribution funded accounts | |
| JP2016528599A (en) | Improved inventory sourcing system | |
| CN115392984A (en) | Rebate data acquisition method and device based on high concurrency distribution | |
| CN110310196A (en) | Product demand application method, device, computer equipment and storage medium | |
| CN110264357A (en) | Dynamic account processing method, device, equipment and computer readable storage medium | |
| CN110196724A (en) | File loading method, terminal, server, computer equipment and storage medium | |
| CN110321461A (en) | Bill processing method, system, computer equipment and storage medium | |
| CN110443599A (en) | Production payment processing method, device, computer equipment and storage medium | |
| CN113971552B (en) | Batch data processing method, device, equipment and storage medium | |
| CN109284260A (en) | Large data files read method, device, computer equipment and storage medium |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190222 |
|
| RJ01 | Rejection of invention patent application after publication |