CN111339108A - Transaction parallel execution method, device and storage medium - Google Patents
Transaction parallel execution method, device and storage medium Download PDFInfo
- Publication number
- CN111339108A CN111339108A CN202010099008.3A CN202010099008A CN111339108A CN 111339108 A CN111339108 A CN 111339108A CN 202010099008 A CN202010099008 A CN 202010099008A CN 111339108 A CN111339108 A CN 111339108A
- Authority
- CN
- China
- Prior art keywords
- transaction
- transactions
- group
- contract
- asset class
- 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
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000004590 computer program Methods 0.000 claims description 9
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000002159 abnormal effect Effects 0.000 description 3
- 238000012163 sequencing technique Methods 0.000 description 3
- 238000001514 detection method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012856 packing Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 230000000670 limiting effect Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2308—Concurrency control
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- 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 invention discloses a transaction parallel execution method, equipment and a storage medium, and relates to the technical field of block chains and the like. The method comprises the following steps: obtaining the transaction cached in the transaction pool, and putting the transaction successfully collecting the transaction fee into a TxListA; dividing the transactions in the list TxListA into an asset class contract group and a non-asset class contract group according to the contract types for executing the transactions, and putting the transactions of the same non-asset class contract in the same non-asset class contract group for the transactions in the non-asset class contract group; after executing the transaction in the property contract group, executing the transaction in each non-property contract group in parallel; and combining the results of each group of transactions after execution. The asset transaction groups are preferentially executed, and the non-asset transaction groups are executed in parallel, so that the transaction execution efficiency is improved, and the tps of the block chain is improved.
Description
Technical Field
The present invention relates to the field of block chaining and other technologies, and in particular, to a method, device, and storage medium for executing transactions concurrently.
Background
The existing block chain system is a decentralized distributed system, adjacent blocks are associated with each other according to time sequence to form a block, a plurality of transactions are packaged in the block, the execution process of the transactions is a serial execution mode, the transactions are acquired from a transaction pool and executed in a one-by-one mode, and in addition, the block chain system possibly has a rollback condition, and a long time is required from creation to successful execution of one transaction.
Chinese patent application, application publication No.: application publication No.: CN 109508337A; application publication date: 2019.3.22, a method for executing transaction in parallel is disclosed, the technical proposal is to sort the transaction and then to execute the transaction by different executors, but the processing of abnormal condition in the transaction executing process needs extra judgment, if there is conflict, the abnormal condition is processed again after adjustment, and the processing process of the abnormal condition detection and the detection result itself will increase the block chain network transaction parallel processing speed.
Disclosure of Invention
1. Technical problem to be solved by the invention
In order to overcome the technical problem, the invention provides a transaction parallel execution method, equipment and a storage medium. The asset transaction groups are preferentially executed, and the non-asset transaction groups are executed in parallel, so that the transaction execution efficiency is improved, and the tps of the block chain is improved.
2. Technical scheme
In order to solve the problems, the technical scheme provided by the invention is as follows:
a transaction parallel execution method, comprising: obtaining the transaction cached in the transaction pool, and putting the transaction successfully collecting the transaction fee into a TxListA; dividing the transactions in the list TxListA into an asset class contract group and a non-asset class contract group according to the contract types for executing the transactions, and putting the transactions of the same non-asset class contract in the same non-asset class contract group for the transactions in the non-asset class contract group; after executing the transaction in the property contract group, executing the transaction in each non-property contract group in parallel; and combining the results of each group of transactions after execution.
The further improvement is that when the transaction pool contains parallel chain transactions, the transactions cached in the transaction pool are obtained, and the transactions which successfully collect transaction fees are put into the TxListA; dividing the transactions in the list TxListA into an asset class contract group and a non-asset class contract group according to the contract types for executing the transactions, and putting the transactions of the same non-asset class contract in the same non-asset class contract group for the transactions in the non-asset class contract group; for the main chain transaction, after the transaction in the property contract group is executed, the transaction in each non-property contract group is executed in parallel; merging the results of each group of executed transactions; for parallel chain transaction, after the block consensus is successful, the parallel chain nodes synchronize corresponding transactions on the parallel chain from the main chain node, and after the transactions in the asset contract group are executed, the transactions in each non-asset contract group are executed in parallel; and combining the results of each group of transactions after execution.
In a further refinement, transactions within said property classification contract set are executed in a transaction list chronological order.
In a further refinement, transactions within the same non-asset class contract group are executed in a transaction list chronological order.
The further improvement is that when the number of the non-asset class contract groups exceeds the maximum concurrency number N, the transactions in the non-asset class contract groups with the transaction numbers of N before the transaction number ordering are preferentially executed according to the number of the transactions in each group, wherein N is a positive integer.
In a further improvement, after executing more than one non-asset class contract group in the non-asset class contract group with the transaction quantity sorted N, executing the transaction in the next non-asset class contract group according to the transaction quantity sorting.
An apparatus, the apparatus comprising: one or more processors; memory for storing one or more programs that, when executed by the one or more processors, cause the one or more processors to perform a method as described above.
A storage medium storing a computer program which, when executed by a processor, implements a method as claimed in any one of the preceding claims.
3. Advantageous effects
Compared with the prior art, the technical scheme provided by the invention has the following beneficial effects:
the asset transaction is preferentially executed, and the non-asset transactions are executed in parallel, so that the transaction execution efficiency is improved, and the tps of the block chain is improved.
Drawings
Fig. 1 is a flowchart of a transaction parallel execution method according to an embodiment of the present invention.
FIG. 2 is a schematic diagram of an apparatus according to the present invention.
Detailed Description
For a further understanding of the present invention, reference will now be made in detail to the embodiments illustrated in the drawings.
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings. The terms first, second, and the like in the present invention are provided for convenience of describing the technical solution of the present invention, and have no specific limiting effect, but are all generic terms, and do not limit the technical solution of the present invention. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Example 1
A transaction parallel execution method, as shown in fig. 1, includes: s101, obtaining the transaction cached in the transaction pool, and S102, putting the transaction successfully collecting transaction fee into a TxListA; if the transaction fee collection fails, filtering out the transaction fee, and not packaging the block; s103, dividing the transactions in the list TxListA into an asset class contract group and a non-asset class contract group according to the contract types for executing the transactions, and S104, for the transactions in the non-asset class contract group, putting the transactions of the same non-asset class contract in the same non-asset class contract group; s105, executing the transaction in each non-asset class contract group in parallel after executing the transaction in the asset class contract group; and S106, combining the results after each group of transactions are executed.
When the transaction pool contains parallel chain transactions, the transactions cached in the transaction pool are obtained, and the transactions successfully collecting transaction fees are put into a TxListA; dividing the transactions in the list TxListA into an asset class contract group and a non-asset class contract group according to the contract types for executing the transactions, and putting the transactions of the same non-asset class contract in the same non-asset class contract group for the transactions in the non-asset class contract group; for the main chain transaction, after the transaction in the property contract group is executed, the transaction in each non-property contract group is executed in parallel; merging the results of each group of executed transactions; for parallel chain transaction, after block consensus is successful (after the blocks are generated), the parallel chain nodes synchronize corresponding transactions on the parallel chain from the main chain node, and after the transactions in the asset class contract group are executed, the transactions in each non-asset class contract group are executed in parallel; and combining the results of each group of transactions after execution.
Executing the transactions in the asset class contract group according to the sequence of the transaction list; transactions within the same non-asset-like contract group are executed in a transaction list chronological order. The transaction sequence is determined comprehensively according to the transaction sequence arranged in the transaction pool on the packing node, the sequence is determined comprehensively by factors such as transaction commission, transaction amount, transaction priority and the like, for different blockchain networks, the sequencing standards of the transaction sequence are different, but the transaction sequence in the packing node transaction pool of different blockchain networks is determined. The transactions in the same transaction group are executed according to the sequence of the transactions; this prevents double flowers and the like in multiple interrelated transactions.
When the number of the non-asset contract groups exceeds the maximum concurrency number N, sequencing according to the transaction number in each group, and preferentially executing the transactions in the non-asset contract groups with the transaction number of N before sequencing, wherein N is a positive integer. And when more than one non-asset class contract group in the N non-asset class contract groups before the transaction quantity ordering is executed, continuing to execute the transaction in the next non-asset class contract group according to the transaction quantity ordering. Because the transaction groups are executed in parallel, but the hardware environment of the nodes is limited, the maximum concurrency number N is limited by the hardware environment, the value of N is different for different hardware configurations of different nodes, but for nodes with different hardware configuration resources, the value of N is determined, for example, the value can be 4, 8, 16, 32 or 64; the first N transaction groups with larger transaction quantity are processed preferentially.
As shown in table 1, it is assumed that each transaction in table 1 is a transaction retained after passing through steps S101 and S102 in the method shown in fig. 1; wherein transactions tx1-tx10 are transactions on the main chain, transactions tx11-tx15 are transactions on the parallel chain one, and transactions tx16-tx20 are transactions on the parallel chain two. The trade contracts TR1, 2 are asset-like contracts on the main chain, the trade contracts TR3, 4, 5, 6, 10 are non-asset-like contracts on the main chain, the trade contract TR11 is an asset-like contract on the first parallel chain, and the trade contracts TR13, 14, 15 are non-asset-like contracts on the first parallel chain; the transaction contracts TR17, 19 are asset-like contracts on parallel chain two, and the transaction contracts TR16, 29 are non-asset-like contracts on parallel chain two; after the method steps S103 and S104 shown in fig. 1, as shown in table 2.
TABLE 1 transaction resolution information List
| Trading | Trade contract | Parallel chain transactions | Trade contract |
| tx1 | TR1 | tx11 | TR11 |
| tx2 | TR2 | tx12 | TR13 |
| tx3 | TR3 | tx13 | TR15 |
| tx4 | TR2 | tx14 | TR11 |
| tx5 | TR4 | tx15 | TR14 |
| tx6 | TR5 | tx16 | TR16 |
| tx7 | TR6 | tx17 | TR17 |
| tx8 | TR4 | tx18 | TR19 |
| tx9 | TR6 | tx19 | TR20 |
| tx10 | TR10 | tx20 | TR16 |
TABLE 2 transaction grouping situation after Steps S103 and S104
And executing the asset transaction group for the main chain transaction, wherein the execution of all transactions in the asset transaction group is carried out according to the sequence of the transaction sequence, all non-asset transaction groups are carried out in parallel after the asset transaction group is executed, and the transaction results are merged after the transaction execution is finished. For parallel chain transaction, after the block is generated, each parallel chain draws the transaction on the respective parallel chain, firstly, transaction analysis is carried out to obtain a transaction contract, and then the transaction contract is divided into an asset class contract group and a non-asset class contract, wherein the non-asset class contract group is divided according to different contract types. After the property contract group is executed, all transactions in all the non-property contract groups are executed in parallel.
Example 2
An apparatus, the apparatus comprising: one or more processors; memory for storing one or more programs that, when executed by the one or more processors, cause the one or more processors to perform a method as described above.
A storage medium storing a computer program which, when executed by a processor, implements the method as described in embodiment 1 above.
Fig. 2 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 2, as another aspect, the present application also provides an apparatus 500 including one or more Central Processing Units (CPUs) 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM503, various programs and data necessary for the operation of the apparatus 500 are also stored. The CPU501, ROM502, and RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to embodiments disclosed herein, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments disclosed herein include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing the method described in any of the embodiments above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described herein.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (8)
1. A method for executing transactions in parallel, comprising:
obtaining the transaction cached in the transaction pool, and putting the transaction successfully collecting the transaction fee into a TxListA; dividing the transactions in the list TxListA into an asset class contract group and a non-asset class contract group according to the contract types for executing the transactions, and putting the transactions of the same non-asset class contract in the same non-asset class contract group for the transactions in the non-asset class contract group; after executing the transaction in the property contract group, executing the transaction in each non-property contract group in parallel; and combining the results of each group of transactions after execution.
2. The method according to claim 1, characterized in that when the transaction pool contains parallel chain transactions, the cached transactions in the transaction pool are obtained, and the transactions that successfully collect transaction fees are put into the list TxListA; dividing the transactions in the list TxListA into an asset class contract group and a non-asset class contract group according to the contract types for executing the transactions, and putting the transactions of the same non-asset class contract in the same non-asset class contract group for the transactions in the non-asset class contract group; for the main chain transaction, after the transaction in the property contract group is executed, the transaction in each non-property contract group is executed in parallel; merging the results of each group of executed transactions; for parallel chain transaction, after the block consensus is successful, the parallel chain nodes synchronize corresponding transactions on the parallel chain from the main chain node, and after the transactions in the asset contract group are executed, the transactions in each non-asset contract group are executed in parallel; and combining the results of each group of transactions after execution.
3. A method according to claim 1 or claim 2, wherein transactions within the property contract group are executed in transaction list chronological order.
4. A method according to claim 1 or 2, wherein transactions within the same group of non-asset class contracts are executed in transaction list chronological order.
5. The method according to claim 4, wherein when the number of non-asset class contract groups exceeds the maximum concurrency number N, the transactions in the non-asset class contract group with the transaction number of N before the ordering are preferentially executed according to the number of transactions in each group, wherein N is a positive integer.
6. The method of claim 5 wherein after executing more than one of the N top transaction quantity ranked non-asset class contract groups, continuing to execute transactions in the next non-asset class contract group in the transaction quantity ranking.
7. An apparatus, characterized in that the apparatus comprises:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-6.
8. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-6.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010099008.3A CN111339108A (en) | 2020-02-18 | 2020-02-18 | Transaction parallel execution method, device and storage medium |
| PCT/CN2020/138896 WO2021164415A1 (en) | 2020-02-18 | 2020-12-24 | Parallel transaction execution method and device, and storage medium |
| JP2021538146A JP2022524177A (en) | 2020-02-18 | 2020-12-24 | Transaction parallel execution method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010099008.3A CN111339108A (en) | 2020-02-18 | 2020-02-18 | Transaction parallel execution method, device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111339108A true CN111339108A (en) | 2020-06-26 |
Family
ID=71183465
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010099008.3A Pending CN111339108A (en) | 2020-02-18 | 2020-02-18 | Transaction parallel execution method, device and storage medium |
Country Status (3)
| Country | Link |
|---|---|
| JP (1) | JP2022524177A (en) |
| CN (1) | CN111339108A (en) |
| WO (1) | WO2021164415A1 (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112950185A (en) * | 2021-03-11 | 2021-06-11 | 杭州复杂美科技有限公司 | Transaction fee payment method, device and storage medium based on parallel execution |
| CN113110925A (en) * | 2021-04-09 | 2021-07-13 | 杭州复杂美科技有限公司 | Block packing method and equipment based on parallel execution and storage medium |
| WO2021164415A1 (en) * | 2020-02-18 | 2021-08-26 | 江苏复杂美科技有限公司 | Parallel transaction execution method and device, and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108269072A (en) * | 2016-12-30 | 2018-07-10 | 深圳瀚德创客金融投资有限公司 | For the transaction processing method and network node of block chain |
| WO2019072305A2 (en) * | 2018-12-28 | 2019-04-18 | Alibaba Group Holding Limited | Parallel execution of transactions in a blockchain network based on smart contract whitelists |
| CN110135985A (en) * | 2019-04-04 | 2019-08-16 | 杭州抖音科技有限公司 | A kind of parallel execution method and system traded on block chain |
| CN110520882A (en) * | 2018-12-28 | 2019-11-29 | 阿里巴巴集团控股有限公司 | Transaction is executed parallel in block chain network |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109063049B (en) * | 2018-07-18 | 2020-12-08 | 百度在线网络技术（北京）有限公司 | Account processing method, device, equipment and storage medium of block chain network |
| US11070360B2 (en) * | 2018-08-13 | 2021-07-20 | International Business Machines Corporation | Parallel transaction validation and block generation in a blockchain |
| CN109508337A (en) * | 2018-11-12 | 2019-03-22 | 杭州秘猿科技有限公司 | A kind of transaction is parallel to execute method, apparatus, electronic equipment and system |
| CN110008233A (en) * | 2019-03-31 | 2019-07-12 | 杭州复杂美科技有限公司 | A kind of information inquiry and know together method, system, equipment and storage medium |
| CN111339108A (en) * | 2020-02-18 | 2020-06-26 | 杭州复杂美科技有限公司 | Transaction parallel execution method, device and storage medium |
-
2020
- 2020-02-18 CN CN202010099008.3A patent/CN111339108A/en active Pending
- 2020-12-24 WO PCT/CN2020/138896 patent/WO2021164415A1/en active Application Filing
- 2020-12-24 JP JP2021538146A patent/JP2022524177A/en not_active Ceased
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108269072A (en) * | 2016-12-30 | 2018-07-10 | 深圳瀚德创客金融投资有限公司 | For the transaction processing method and network node of block chain |
| WO2019072305A2 (en) * | 2018-12-28 | 2019-04-18 | Alibaba Group Holding Limited | Parallel execution of transactions in a blockchain network based on smart contract whitelists |
| CN110300985A (en) * | 2018-12-28 | 2019-10-01 | 阿里巴巴集团控股有限公司 | Transaction is executed parallel in block chain network based on intelligent contract white list |
| CN110520882A (en) * | 2018-12-28 | 2019-11-29 | 阿里巴巴集团控股有限公司 | Transaction is executed parallel in block chain network |
| CN110135985A (en) * | 2019-04-04 | 2019-08-16 | 杭州抖音科技有限公司 | A kind of parallel execution method and system traded on block chain |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021164415A1 (en) * | 2020-02-18 | 2021-08-26 | 江苏复杂美科技有限公司 | Parallel transaction execution method and device, and storage medium |
| CN112950185A (en) * | 2021-03-11 | 2021-06-11 | 杭州复杂美科技有限公司 | Transaction fee payment method, device and storage medium based on parallel execution |
| CN112950185B (en) * | 2021-03-11 | 2023-10-20 | 杭州复杂美科技有限公司 | Transaction fee payment method, device and storage medium based on parallel execution |
| CN113110925A (en) * | 2021-04-09 | 2021-07-13 | 杭州复杂美科技有限公司 | Block packing method and equipment based on parallel execution and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2021164415A1 (en) | 2021-08-26 |
| JP2022524177A (en) | 2022-04-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111339108A (en) | Transaction parallel execution method, device and storage medium | |
| US10002019B2 (en) | System and method for assigning a transaction to a serialized execution group based on an execution group limit for parallel processing with other execution groups | |
| CN107656955B (en) | Repayment data batch reporting method and device | |
| CN111292192A (en) | Transaction parallel execution method, device and storage medium | |
| CN105989163A (en) | Data real-time processing method and system | |
| CN103246549B (en) | A kind of method and system of data conversion storage | |
| CN111858062A (en) | Evaluation rule optimization method, service evaluation method and related equipment | |
| CN106325756A (en) | Data storage and data computation methods and devices | |
| CN111260288B (en) | Order management method, device, medium and electronic equipment | |
| CN109558887A (en) | A kind of method and apparatus of predictive behavior | |
| CN111444727A (en) | Business rule analysis method | |
| CN115239114A (en) | Case distribution method and device, electronic equipment and readable storage medium | |
| CN102393945B (en) | Data processing method and system for risk weighted asset calculation | |
| CN111475554B (en) | Data display method, device, equipment and storage medium based on express state | |
| CN114116799A (en) | Abnormal transaction loop identification method, device, terminal and storage medium | |
| CN109344119B (en) | File merging processing method and device, computing equipment and computer storage medium | |
| CN113989005A (en) | Tax risk enterprise mining method and device | |
| CN112150035A (en) | Data processing method and device | |
| CN116187714B (en) | Task intelligent distribution method, system, terminal and medium based on definable rule | |
| CN111967960B (en) | Batch adjustment method and device for account data | |
| CN111984716B (en) | Transaction data acquisition method and device | |
| CN111314440B (en) | Ring detection method and system on graph structure data | |
| CN112835915B (en) | MPP database system, data storage method and data query method | |
| CN111259045B (en) | Data processing method, device, server and medium | |
| JP2002189737A (en) | Data analysis method, information processor, and program |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200626 |