CN111292192A - Transaction parallel execution method, device and storage medium - Google Patents
Transaction parallel execution method, device and storage medium Download PDFInfo
- Publication number
- CN111292192A CN111292192A CN202010099078.9A CN202010099078A CN111292192A CN 111292192 A CN111292192 A CN 111292192A CN 202010099078 A CN202010099078 A CN 202010099078A CN 111292192 A CN111292192 A CN 111292192A
- Authority
- CN
- China
- Prior art keywords
- transaction
- transactions
- group
- parallel chain
- parallel
- 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 35
- 238000004590 computer program Methods 0.000 claims description 9
- 238000012856 packing Methods 0.000 claims 1
- 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 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000004806 packaging method and process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000000694 effects Effects 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
- 239000004065 semiconductor Substances 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
Images
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 invention discloses a transaction parallel execution method, equipment and a storage medium, and relates to the technical field of block chains and the like. Analyzing the transaction information to obtain a transaction sending address and a transaction contract; taking more than 2 transactions with the same sending address as a transaction group, and forming more than one transaction group by the transactions with different sending addresses; combining more than 2 transaction groups with at least one transaction contract into one transaction group, executing transactions in each transaction group simultaneously, and combining transaction execution results. The transaction is divided into groups according to the transaction sending address and the transaction contract, and then the grouped transactions are executed in parallel, so that the transaction execution efficiency can be improved, and system errors caused by mutual influence of the parallel transactions can be avoided.
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
When the blocks in the front blockchain network are arranged one by one according to the time sequence, the transaction is executed in series, the transaction index in the block is executed in sequence after the transaction in one block is generated according to the block, one transaction in the blockchain network can relate to the mutual read-write operation of two or more account addresses, and the states of the account addresses have a front-back linear dependency relationship. In order to pursue the certainty of the full-link state, the blockchain requires that transactions exist in a list form in a block and are executed by all nodes one by one in sequence, and the situation of random order skipping or random concurrent execution cannot occur, otherwise, the calculation results of all nodes may be inconsistent, and finally consensus cannot be achieved. Full serial execution does not fully exploit the physical machine performance of the node, serially executing transactions does not maximize execution efficiency, results in reduced transaction throughput, and results in delays between committing the transaction and clearing the transaction.
Chinese invention patent application publication no: CN109508337A, publication date: in 2019, 3, 22, a transaction parallel execution method, device, electronic equipment and system are disclosed, wherein a transaction parallel execution scheme in the method needs to detect abnormal conditions of grouped and parallel transactions, and after a conflict exists, the transactions need to be regrouped and executed again, so that the parallel execution efficiency is reduced, the detection of the abnormal conditions also needs to take time, and a process that the parallel execution efficiency is not as good as that of serial execution may exist.
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. Transaction execution efficiency may be 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: analyzing the transaction information to obtain a transaction sending address and a transaction contract; taking more than 2 transactions with the same sending address as a transaction group, and forming more than one transaction group by the transactions with different sending addresses; combining more than 2 transaction groups with at least one transaction contract into one transaction group, executing transactions in each transaction group simultaneously, and combining transaction execution results.
In a further refinement, when the transaction comprises a parallel chain transaction, the backbone consensus node charges a commission for the parallel chain transaction prior to parsing the transaction information.
The method is further improved in that after the block is generated, parallel chain nodes synchronously correspond to parallel chain transactions from a main chain, parallel chain transaction information is analyzed, and a parallel chain transaction sending address and a transaction contract are obtained; taking more than 2 parallel chain transactions with the same sending address as a parallel chain transaction group, and forming more than one parallel chain transaction group by the parallel chain transactions with different sending addresses; combining more than 2 parallel chain transaction groups with at least one parallel chain transaction contract into one parallel chain transaction group, simultaneously executing the parallel chain transaction in each corresponding parallel chain transaction group, and combining the parallel chain transaction execution results.
In a further improvement, the above-mentioned more than 2 transactions with the same sending address are used as a transaction group, and the further step is that: and ordering more than 2 transactions with the same sending address according to the sequence of the transactions to form a transaction group.
In a further improvement, the combining more than 2 transactions of the same transaction contract into one transaction group further comprises: more than 2 transaction groups with the same transaction contracts are combined and are sequenced according to the sequence of the transactions to be used as a transaction group.
In a further improvement, the transactions in the same transaction group are executed in a transaction sequence order.
The further improvement is that when the number of the transaction groups exceeds the maximum concurrency number N, the transactions in the transaction 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, parallel chain transactions that fail to collect a commission are filtered out and not block packed.
The further improvement is that after the transaction group with the transaction quantity sorted before N is executed, the transactions in the next transaction group are executed 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 transaction is divided into groups according to the transaction sending address and the transaction contract, and then the grouped transactions are executed in parallel, so that the transaction execution efficiency can be improved, and system errors caused by mutual influence of the parallel transactions can be avoided.
Drawings
Fig. 1 is a flowchart of a transaction parallel execution method according to an embodiment of the present invention.
Fig. 2 is a flowchart of a parallel chain transaction parallel execution method according to an embodiment of the present invention.
FIG. 3 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
As shown in fig. 1, a transaction parallel execution method includes:
s101, analyzing transaction information to obtain a transaction sending address and a transaction contract; s102, taking more than 2 transactions with the same sending address as a transaction group, and forming more than one transaction group by the transactions with different sending addresses; s103, combining more than 2 transaction groups with at least one transaction contract into one transaction group; and S104, simultaneously executing the transaction in each transaction group and combining transaction execution results.
The method of fig. 1 may be applied to a consensus node or a non-consensus node, where the transaction comprises a parallel chain transaction, and the main chain consensus node charges a commission for the parallel chain transaction before the transaction information is parsed. Parallel chain transactions that fail to collect commission fees are filtered out and are not block packed.
As shown in table 1, for convenience of description, the transaction sending address is simplified, and the actual address is a character string composed of numbers, underlines and letters; 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. After the grouping in step S102, it is shown in table 2. Transaction fees are deducted for transactions on the parallel chains, and after the blocks are generated, corresponding parallel chain pull transactions are executed on corresponding parallel chains. After step S103, the grouping is shown in table 3.
TABLE 1 transaction resolution information List
| Trading | Transaction routing address | Trade contract | Parallel chain transactions | Transaction routing address | Trade contract |
| tx1 | ad1 | TR1 | tx11 | Ad7 | TR11 |
| tx2 | ad1 | TR2 | tx12 | Ad7 | TR13 |
| tx3 | ad2 | TR3 | tx13 | Ad8 | TR15 |
| tx4 | ad1 | TR2 | tx14 | Ad9 | TR11 |
| tx5 | ad3 | TR4 | tx15 | Ad10 | TR14 |
| tx6 | ad4 | TR5 | tx16 | Ad11 | TR16 |
| tx7 | ad5 | TR6 | tx17 | Ad11 | TR17 |
| tx8 | ad4 | TR4 | tx18 | Ad12 | TR19 |
| tx9 | ad3 | TR6 | tx19 | Ad15 | TR20 |
| tx10 | ad6 | TR10 | tx20 | Ad15 | TR16 |
TABLE 2 transaction grouping List after step S102
TABLE 3 transaction grouping List after step S103
After the block is generated, the parallel chain nodes synchronize corresponding parallel chain transactions from the main chain, as shown in fig. 2, the method for performing the transactions in parallel on the parallel chain is as follows:
s201, analyzing parallel chain transaction information to obtain a parallel chain transaction sending address and a parallel chain transaction contract; s202, taking more than 2 parallel chain transactions with the same sending address as a parallel chain transaction group, wherein the parallel chain transactions with different sending addresses form more than one parallel chain transaction group, and the parallel chain transaction grouping part is shown in a table 2; s203, combining more than 2 parallel chain transaction groups with at least one parallel chain transaction contract into one parallel chain transaction group, wherein the parallel chain transaction group is shown in a table 3; and S204, simultaneously executing parallel chain transactions in each corresponding parallel chain transaction group, and combining parallel chain transaction execution results.
The above-mentioned more than 2 transactions that send the same address are regarded as a transaction group, further: and ordering more than 2 transactions with the same sending address according to the sequence of the transactions to form a transaction group.
The combination of more than 2 transaction groups with the same transaction contract into one transaction group further comprises: more than 2 transaction groups with the same transaction contracts are combined and are sequenced according to the sequence of the transactions to be used as a transaction group. The transaction sequence is determined comprehensively according to the transaction sequence arranged in the transaction pool on the packaging 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 packaging 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-flower and other situations in multiple interrelated transactions initiated at the same address.
When the number of the transaction groups exceeds the maximum concurrency number N, the transactions in the transaction groups with the transaction numbers before the transaction number ordering are preferentially executed according to the number of the transactions in each group, wherein N is a positive integer. And after executing the transaction group N before the transaction quantity sorting, continuing to execute the transactions in the next transaction group according to the transaction quantity sorting.
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, can be 50, 40, 80 or 60; the first N transaction groups with larger transaction quantity are processed preferentially.
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. 3 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 3, 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 (11)
1. A method for executing transactions in parallel, comprising:
analyzing the transaction information to obtain a transaction sending address and a transaction contract; taking more than 2 transactions with the same sending address as a transaction group, and forming more than one transaction group by the transactions with different sending addresses; combining more than 2 transaction groups with at least one transaction contract into one transaction group, executing transactions in each transaction group simultaneously, and combining transaction execution results.
2. The method of claim 1,
when the transaction comprises a parallel chain transaction, the main chain consensus node charges a commission for the parallel chain transaction before the transaction information is analyzed.
3. The method according to claim 1, wherein after the block is generated, parallel chain nodes synchronize corresponding parallel chain transactions from a main chain, analyze parallel chain transaction information, and obtain a parallel chain transaction sending address and a transaction contract; taking more than 2 parallel chain transactions with the same sending address as a parallel chain transaction group, and forming more than one parallel chain transaction group by the parallel chain transactions with different sending addresses; combining more than 2 parallel chain transaction groups with at least one parallel chain transaction contract into one parallel chain transaction group, simultaneously executing the parallel chain transaction in each corresponding parallel chain transaction group, and combining the parallel chain transaction execution results.
4. The method of claim 1,
the above-mentioned more than 2 transactions that send the same address are regarded as a transaction group, further: and ordering more than 2 transactions with the same sending address according to the sequence of the transactions to form a transaction group.
5. The method of claim 1,
the combination of more than 2 transaction groups with the same transaction contract into one transaction group further comprises: more than 2 transaction groups with the same transaction contracts are combined and are sequenced according to the sequence of the transactions to be used as a transaction group.
6. The method of any of claims 1-5, wherein transactions in the same transaction group are executed in a transaction sequence order.
7. The method according to claim 6, characterized in that when the number of transaction groups exceeds the maximum concurrency number N, the transactions in the transaction group with the transaction number of N before the transaction number are preferentially executed according to the number of transactions in each group, wherein N is a positive integer.
8. The method of claim 2, wherein parallel chain transactions that fail a commission charge are filtered out from block packing.
9. The method of claim 7, wherein when the transaction group N before the transaction amount ranking is executed, continuing to execute transactions in the next transaction group according to the transaction amount ranking.
10. 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-9.
11. 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-9.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010099078.9A CN111292192A (en) | 2020-02-18 | 2020-02-18 | Transaction parallel execution method, device and storage medium |
| PCT/CN2020/138893 WO2021164414A1 (en) | 2020-02-18 | 2020-12-24 | Method and device for parallel execution of transactions, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010099078.9A CN111292192A (en) | 2020-02-18 | 2020-02-18 | Transaction parallel execution method, device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111292192A true CN111292192A (en) | 2020-06-16 |
Family
ID=71021395
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010099078.9A Pending CN111292192A (en) | 2020-02-18 | 2020-02-18 | Transaction parallel execution method, device and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111292192A (en) |
| WO (1) | WO2021164414A1 (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 |
| WO2021164414A1 (en) * | 2020-02-18 | 2021-08-26 | 江苏复杂美科技有限公司 | Method and device for parallel execution of transactions, and storage medium |
| CN114546884A (en) * | 2022-04-21 | 2022-05-27 | 北京微芯感知科技有限公司 | Block chain batch transaction conflict detection method and system |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113537991B (en) * | 2021-09-16 | 2022-03-01 | 中国信息通信研究院 | Cross-chain transaction ordered execution method and cross-chain system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107688999A (en) * | 2017-08-11 | 2018-02-13 | 杭州秘猿科技有限公司 | A kind of parallel transaction based on block chain performs method |
| CN108269072A (en) * | 2016-12-30 | 2018-07-10 | 深圳瀚德创客金融投资有限公司 | For the transaction processing method and network node of block chain |
| CN109636384A (en) * | 2018-10-26 | 2019-04-16 | 阿里巴巴集团控股有限公司 | A kind of parallelization executes the method, apparatus and system of block chain transaction |
| CN110135985A (en) * | 2019-04-04 | 2019-08-16 | 杭州抖音科技有限公司 | A kind of parallel execution method and system traded on block chain |
| CN110209737A (en) * | 2019-05-22 | 2019-09-06 | 杭州复杂美科技有限公司 | Data reporting method, parallel chain creation method, equipment and storage medium |
| CN110520882A (en) * | 2018-12-28 | 2019-11-29 | 阿里巴巴集团控股有限公司 | Transaction is executed parallel in block chain network |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108305056B (en) * | 2018-03-27 | 2023-11-10 | 北京蓝亚盒子科技有限公司 | Block chain-based data processing method and device and block chain node network |
| US11070360B2 (en) * | 2018-08-13 | 2021-07-20 | International Business Machines Corporation | Parallel transaction validation and block generation in a blockchain |
| CN110490742B (en) * | 2019-08-13 | 2024-04-12 | 深圳前海微众银行股份有限公司 | Transaction execution method and device in blockchain |
| CN111292192A (en) * | 2020-02-18 | 2020-06-16 | 杭州复杂美科技有限公司 | Transaction parallel execution method, device and storage medium |
-
2020
- 2020-02-18 CN CN202010099078.9A patent/CN111292192A/en active Pending
- 2020-12-24 WO PCT/CN2020/138893 patent/WO2021164414A1/en active Application Filing
Patent Citations (6)
| 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 |
| CN107688999A (en) * | 2017-08-11 | 2018-02-13 | 杭州秘猿科技有限公司 | A kind of parallel transaction based on block chain performs method |
| CN109636384A (en) * | 2018-10-26 | 2019-04-16 | 阿里巴巴集团控股有限公司 | A kind of parallelization executes the method, apparatus and system of block chain transaction |
| 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 |
| CN110209737A (en) * | 2019-05-22 | 2019-09-06 | 杭州复杂美科技有限公司 | Data reporting method, parallel chain creation method, equipment and storage medium |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021164414A1 (en) * | 2020-02-18 | 2021-08-26 | 江苏复杂美科技有限公司 | Method and device for parallel execution of transactions, 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 |
| CN114546884A (en) * | 2022-04-21 | 2022-05-27 | 北京微芯感知科技有限公司 | Block chain batch transaction conflict detection method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2021164414A1 (en) | 2021-08-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111292192A (en) | Transaction parallel execution method, device and storage medium | |
| WO2021164415A1 (en) | Parallel transaction execution method and device, and storage medium | |
| CN111523977B (en) | Method, device, computing equipment and medium for creating wave order set | |
| CN111797168A (en) | Block parallel processing method, equipment and storage medium | |
| CN111782502A (en) | Automatic testing method and device | |
| EP3908933A1 (en) | Test result triage for a failed code validation | |
| CN111767023A (en) | Data sorting method and data sorting system | |
| US11755376B2 (en) | Automatic assignment of hardware/software resources to different entities using machine learning based on determined scores for assignment solutions | |
| CN111405037A (en) | Block synchronization method, device and storage medium | |
| US11244156B1 (en) | Locality-sensitive hashing to clean and normalize text logs | |
| CN114610701A (en) | Task data processing method and device, electronic equipment and medium | |
| CN111061712A (en) | Data connection operation processing method and device | |
| CN112613762A (en) | Knowledge graph-based group rating method and device and electronic equipment | |
| CN112506651A (en) | Method and equipment for data operation in large-data-volume environment | |
| US10402230B2 (en) | System allocating links for data packets in an electronic system | |
| CN110765100A (en) | Label generation method and device, computer readable storage medium and server | |
| CN111796817A (en) | High-cohesion low-coupling processing method and system for iOS and electronic equipment | |
| CN113762822B (en) | Method and device for processing order | |
| CN107391252A (en) | A kind of method for processing resource and device | |
| CN116932953A (en) | Browser active compatibility optimization method and device based on credit-creating environment | |
| CN114691761A (en) | Method, device, equipment and storage medium for generating hierarchical structure diagram | |
| CN115033823A (en) | Method, apparatus, device, medium and product for processing data | |
| CN114201455A (en) | Account checking method and device | |
| CN114840536A (en) | Data deletion method and device for distributed database and electronic equipment | |
| CN110688295A (en) | Data testing 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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200616 |