CN111353884A - Block chain transaction processing method and system - Google Patents
Block chain transaction processing method and systemDownload PDFInfo
- Publication number
- CN111353884A CN111353884ACN201811564556.8ACN201811564556ACN111353884ACN 111353884 ACN111353884 ACN 111353884ACN 201811564556 ACN201811564556 ACN 201811564556ACN 111353884 ACN111353884 ACN 111353884A
- Authority
- CN
- China
- Prior art keywords
- sub
- block
- fragment
- transaction
- processed
- 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.)
- Granted
Links
Images
Classifications
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
Technical Field
The present invention relates to the field of blockchain technologies, and in particular, to a method and a system for processing blockchain transactions.
Background
The blockchain is a reliable database which is maintained by a centralized distrust collection, and the expandability is one of the biggest problems in the prior art. All mainstream platform systems are striving to increase the volume of transactions per second. In fact, today's bitcoin networks can handle 7-10 transactions per second on average, and etherhouse networks can handle 20-30 transactions per second, a figure far below the centralized payment systems like Visa, which can handle about 8000 transactions per second on average. Slow transaction processing speed poses a major problem for blockchain systems: the large number of outstanding transactions blocks the network, making it difficult for applications such as real-time payment to reach an exhibition on the blockchain, and the long time to confirm the payment causes inconvenience to the user, which is one of the main reasons why credit card payment methods such as Visa are still more attractive.
Disclosure of Invention
The invention aims to provide a method and a system for processing blockchain transactions, which can increase the transaction amount per second of a blockchain network and improve the transaction throughput of the blockchain network.
To solve the above technical problem, according to an aspect of the present invention, there is provided a blockchain transaction processing method applied to a node on a blockchain network, wherein the node has a main fragment and m sub-fragments; the method comprises the following steps: the main fragment divides a plurality of transactions to be processed into A transaction sets, and distributes the A transaction sets to m sub-fragments for processing; wherein, A and m are natural numbers larger than 0; the main fragment acquires a new sub-block generated by each sub-fragment, and blocks are packed according to each sub-block; the main fragment broadcasts the new block generated by packaging; and if the new block passes the verification in the block chain network, recording the new block as a valid block in each node of the block chain network.
An embodiment of the present invention further provides a blockchain transaction processing system, including: a main fragment and m sub-fragments; the main fragment is used for dividing a plurality of transactions to be processed into A transaction sets and distributing the A transaction sets to m sub-fragments for processing; wherein A and m are natural numbers greater than 0; the main fragment is used for acquiring the new sub-blocks generated by each sub-fragment and carrying out block packing according to each sub-block; the main fragment is used for broadcasting the new blocks generated by packaging; and if the new block passes the verification in the block chain network, recording the new block as a valid block in each node of the block chain network.
Compared with the prior art, the node in the block chain network comprises a main fragment and a plurality of sub-fragments, wherein the main fragment divides each transaction to be processed into A transaction sets, distributes the A divided transaction sets to the sub-fragments for processing, and then packs the blocks by the main fragment according to the new sub-blocks generated by the sub-fragments so as to facilitate the broadcasting and uplink of the subsequent new blocks. Therefore, the transaction to be processed is distributed by the aid of the main fragments, the transaction is processed by the aid of the sub fragments, the main fragments are used for overall planning of information and main network communication, parallel processing of the transaction is achieved, processing efficiency is improved, transaction amount per second of the block chain network is increased under the condition that consistency and reliability of the block chain are guaranteed, and transaction throughput of the block chain network is improved.
Optionally, a is equal to m, and a transaction sets are allocated to m subfragments for processing, specifically including: and distributing A transaction sets to m sub-fragments for processing. Therefore, the full utilization of the sub-fragments is realized, and the parallel processing efficiency of the transaction is high.
Optionally, after allocating a transaction sets to m sub-shards for processing, the method further includes: and if all the sub-blocks generated within the first preset time length do not correspond to all the transactions to be processed, the main fragment gives up all the transactions to be processed and generates an error log. Therefore, the condition that the node does not respond for a long time to cause resource waste is avoided, and technicians can be helped to perform troubleshooting in time.
Optionally, if the number of times that a sub-fragment generation sub-block exceeds the second preset duration exceeds a preset number of times, determining that the sub-fragment is faulty.
Optionally, the blockchain transaction processing method further includes: and if the main fragment is in fault, removing the main fragment, and selecting one sub fragment from the m sub fragments as a new main fragment. Therefore, a new sub-fragment is selected in time to replace the fault main fragment, the normal operation of the node can be ensured, and the condition of the node paralysis caused by the fault of the main fragment is avoided.
Optionally, if a subfragment fails, the subfragment is removed.
Optionally, the consensus algorithm of the main fragment and the m sub-fragments is the same, so that the consistency of the main fragment and each sub-fragment can be realized, and the stability of the node is effectively ensured.
Optionally, if a node is newly added in the blockchain network, the newly added node acquires and synchronizes the longest blockchain in the blockchain network.
According to another aspect of the present invention, there is provided a blockchain transaction processing apparatus, the apparatus including: a main fragmentation unit and m sub-fragmentation units; the main fragment unit is used for dividing a plurality of transactions to be processed into A transaction sets and distributing the A transaction sets to the m sub-fragment units for processing; wherein A and m are natural numbers greater than 0; the main fragment unit is used for acquiring the new sub-blocks generated by each sub-fragment unit and carrying out block packaging according to each sub-block; the main fragment unit is used for broadcasting the new blocks generated by packaging; and if the new block passes the verification in the block chain network, recording the new block as a valid block in each node of the block chain network.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present specification, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a flowchart of a method for processing blockchain transactions according to an embodiment of the present invention;
fig. 2 is a schematic diagram of transaction partitioning for a blockchain transaction processing method according to an embodiment of the present invention;
fig. 3 is a block generation diagram of a block chain transaction processing method according to an embodiment of the present invention;
FIG. 4 is an overview of a blockchain network according to an embodiment of the present invention;
fig. 5 is a detailed diagram of a block chain network according to an embodiment of the present invention;
fig. 6 is a block chain diagram illustrating a block chain transaction processing method according to an embodiment of the present invention.
Detailed Description
In order to make the technical solutions in the present specification better understood, the technical solutions in the embodiments of the present specification will be clearly and completely described below with reference to the drawings in one or more embodiments of the present specification, and it is obvious that the described embodiments are only a part of the embodiments of the present specification, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present description without inventive step, shall fall within the scope of protection of the claims of the present application.
First embodiment
A first embodiment of the invention relates to a method for processing blockchain transactions, and a specific flow is shown in fig. 1. The transaction processing method in this embodiment is applied to a node on a blockchain network, where the node has a main fragment and m sub-fragments, and m is a natural number greater than 0. The following describes a specific implementation of the blockchain transaction processing method in this embodiment, including the following steps:
Specifically, the value of a may be preset by a technician and stored in the node. For example, a may be 3. As shown in fig. 2, n transactions to be processed are given, and the main fragment divides the n transactions to be processed into 3 shares, which are transaction sets from the 1 st transaction to the ith transaction [ the 1 st transaction to be processed, the ith transaction ], transaction sets from the i +1 th transaction to the jth transaction [ the i +1 th transaction to be processed, the jth transaction to be processed ], and transaction sets from the j +1 th transaction to the nth transaction [ the j +1 th transaction to be processed, the nth transaction to be processed ]. The i and j are natural numbers larger than 0, and the numerical values of the i and j can be preset by technicians, namely the numerical values of the i and j are fixed, and the main fragments can also be selected according to the number of the transactions to be processed divided according to actual needs. For example, assuming that the number of transactions to be processed is n, the master shard may set i to c according to a remainder algorithm n mod 3 to c; j is 2 c.
In this embodiment, the main shard may perform the partition of the transaction set according to the number of the sub-shards, i.e. let a be equal to m. Therefore, the main fragment can averagely distribute the A divided transaction sets to the m sub-fragments, so that the sub-fragments are fully utilized, and the parallel processing efficiency of subsequent transactions is improved. The value of m may be preset by a technician and stored in the node, or may be selected by the master fragment according to the number n of actual transactions to be processed. For example, the node prestores the corresponding relationship between the number interval of the to-be-processed transactions and the numerical value of m, so that the main fragment can set the corresponding number of sub-fragments according to the numerical value interval where the number n of the current to-be-processed transactions is located.
And 102, the main fragment acquires the new sub-blocks generated by each sub-fragment, and performs block packing according to each sub-block.
Specifically, each sub-fragment processes each transaction to be processed in the assigned transaction set, one or more sub-blocks are generated by packaging, the main fragment periodically acquires the hash value of each sub-block newly generated by each sub-fragment, and records the hash value in the newly generated block, thereby realizing packaging of one or more new blocks.
For example, taking the above n transactions to be processed divided into 3 parts, wherein one sub-fragment generates the sub-block 0, one sub-fragment generates thesub-block 1, and one sub-fragment generates the sub-block 3, the main fragment generates the new block 0 including the information of the sub-block 0, thesub-block 1, and thesub-block 2. For example, the hash values of sub-block 0,sub-block 1, andsub-block 2 may be recorded in block 0, as shown in fig. 3.
And 103, broadcasting the new block generated by packaging by the main fragment.
Specifically, the master fragment broadcasts the latest block formed by the packing, each node in the block chain network receives a new block, the new block is verified, if the verification is passed, the new block is recorded by each node as a valid block and is added into the block chain, and the block chain is continuously lengthened.
Compared with the prior art, the node in the block chain network comprises a main fragment and a plurality of sub-fragments, wherein the main fragment divides each transaction to be processed into A transaction sets, distributes the A divided transaction sets to the sub-fragments for processing, and then packs the blocks by the main fragment according to the new sub-blocks generated by the sub-fragments so as to facilitate the broadcasting and uplink of the subsequent new blocks. Therefore, the transaction to be processed is distributed by the aid of the main fragments, the transaction is processed by the aid of the sub fragments, the main fragments are used for overall planning of information and main network communication, parallel processing of the transaction is achieved, processing efficiency is improved, transaction amount per second of the block chain network is increased under the condition that consistency and reliability of the block chain are guaranteed, and transaction throughput of the block chain network is improved.
It should be noted that, because the blockchain network is a distributed network (as shown in fig. 4) composed of a plurality of nodes, each transaction can reach any node through the main network after being input and initiated by a certain node, that is, each node in the blockchain network can know the transaction for processing and calculation. Therefore, the node having the main shard and the m sub shards mentioned in this embodiment may be any node on the blockchain network (as shown in fig. 5). That is, each node on the blockchain network may have a master shard and m sub-shards.
If all nodes in the blockchain network include the child shards and the master shards, and all transactions in the nodes can be processed through theabove steps 101 to 103, the blockchain shown in fig. 6 occurs. That is, each block includes information of sub-blocks generated by sub-fragments in the node that packs the block, and each newly generated block includes information of the previous block. Therefore, even if a node is newly added in the block chain, the newly added node acquires and synchronizes the longest block chain, and information synchronization can be realized, so that the consistency of the block chain is ensured.
It is worth mentioning that the consensus algorithm of the main shard and each associated sub-shard in each node is the same, and the consensus algorithm of each main shard is the same, so that the main shards can communicate with each other, and the main shard can communicate with each associated sub-shard, thereby realizing parallel processing of transactions on the nodes and record synchronization of transactions on the block chain.
Second embodiment
The second embodiment of the invention relates to a block chain transaction processing method. The second embodiment of the invention is improved on the basis of the first embodiment, and the main improvement is that: in the second embodiment of the present invention, if all the sub-blocks generated within the first preset time length do not correspond to all the pending transactions, the master fragment abandons each pending transaction and generates an error log. Therefore, the condition that the node does not respond for a long time to cause resource waste is avoided, and technicians can be helped to perform troubleshooting in time. The following is specifically described:
specifically, the main fragment packs the new block after acquiring the sub-blocks generated by all the sub-fragments, so as to avoid the omission of transactions and ensure the consistency of the block chain. However, if a sub-fragment fails, the sub-fragment cannot generate sub-blocks periodically, which results in the situation that the main fragment does not pack new blocks and the node does not respond for a long time. Therefore, in order to improve the resource rate of the node and avoid the occurrence of the above situations, when all the sub-blocks generated within the first preset time length do not correspond to all the transactions to be processed, the main fragment gives up each transaction to be processed and generates an error log, so that a technician can perform troubleshooting in time. The first preset time duration may be equal to or longer than the time duration for the sub-fragment to generate the sub-block periodically.
More specifically, if the number of times that a sub-fragment generation sub-block exceeds the second preset time length exceeds a preset number of times, the sub-fragment is determined to be faulty. At this time, the main fragment may reflect the information of the subfragment in the error log so as to facilitate a technician to repair in time, or the main fragment may directly remove the subfragment so as to ensure normal operation of the node. The preset times may be preset by a technician, and the second preset time period may be equal to or slightly longer than the time period for the sub-fragment to generate the sub-block periodically. In addition, during actual operation, the second preset time duration may be set to be less than or equal to the first preset time duration.
It should be noted that if the main fragment fails, the main fragment may be removed, and one of the m sub-fragments may be selected as a new main fragment. Therefore, a new sub-fragment is selected in time to replace the fault main fragment, the normal operation of the node can be ensured, and the condition of the node paralysis caused by the fault of the main fragment is avoided.
The steps of the above methods are divided for clarity, and the implementation may be combined into one step or split some steps, and the steps are divided into multiple steps, so long as the same logical relationship is included, which are all within the protection scope of the present patent; it is within the scope of the patent to add insignificant modifications to the algorithms or processes or to introduce insignificant design changes to the core design without changing the algorithms or processes.
Third embodiment
A third embodiment of the present invention relates to a blockchain transaction processing system, including: a main fragment and m sub-fragments; wherein m is a natural number greater than 0. The main fragment is used for dividing a plurality of transactions to be processed into A transaction sets and distributing the A transaction sets to m sub-fragments for processing; wherein n is a natural number greater than 0. The main fragment is used for obtaining the sub-blocks newly generated by each sub-fragment and carrying out block packing according to each sub-block. The master shard is used to broadcast the new tiles generated by the packetization. And if the new block passes the verification in the block chain network, recording the new block as a valid block in each node of the block chain network.
Specifically, the value of a may be preset by a technician and stored in the node. For example, a may be 3. As shown in fig. 2, n transactions to be processed are given, and the main fragment divides the n transactions to be processed into 3 shares, which are transaction sets from the 1 st transaction to the ith transaction [ the 1 st transaction to be processed, the ith transaction ], transaction sets from the i +1 th transaction to the jth transaction [ the i +1 th transaction to be processed, the jth transaction to be processed ], and transaction sets from the j +1 th transaction to the nth transaction [ the j +1 th transaction to be processed, the nth transaction to be processed ]. The i and j are natural numbers larger than 0, and the numerical values of the i and j can be preset by technicians, namely the numerical values of the i and j are fixed, and the main fragments can also be selected according to the number of the transactions to be processed divided according to actual needs. For example, assuming that the number of transactions to be processed is n, the master shard may set i to c according to a remainder algorithm n mod 3 to c; j is 2 c.
In this embodiment, the main shard may perform the partition of the transaction set according to the number of the sub-shards, i.e. let a be equal to m. Therefore, the main fragment can averagely distribute the A divided transaction sets to the m sub-fragments, so that the sub-fragments are fully utilized, and the parallel processing efficiency of subsequent transactions is improved. The value of m may be preset by a technician and stored in the node, or may be selected by the master fragment according to the number n of actual transactions to be processed. For example, the node prestores the corresponding relationship between the number interval of the to-be-processed transactions and the numerical value of m, so that the main fragment can set the corresponding number of sub-fragments according to the numerical value interval where the number n of the current to-be-processed transactions is located.
Specifically, each sub-fragment processes each transaction to be processed in the assigned transaction set, one or more sub-blocks are generated by packaging, the main fragment periodically acquires the hash value of each sub-block newly generated by each sub-fragment, and records the hash value in the newly generated block, thereby realizing packaging of one or more new blocks.
For example, taking the above n transactions to be processed divided into 3 parts, wherein one sub-fragment generates the sub-block 0, one sub-fragment generates thesub-block 1, and one sub-fragment generates the sub-block 3, the main fragment generates the new block 0 including the information of the sub-block 0, thesub-block 1, and thesub-block 2. For example, the hash values of sub-block 0,sub-block 1, andsub-block 2 may be recorded in block 0.
Specifically, the master fragment broadcasts the latest block formed by the packing, each node in the block chain network receives a new block, the new block is verified, if the verification is passed, the new block is recorded by each node as a valid block and is added into the block chain, and the block chain is continuously lengthened.
More specifically, since the blockchain network is a distributed network composed of a plurality of nodes, each transaction can reach any node through the main network after being input and initiated through a certain node, that is, each node in the blockchain network can acquire the transaction for processing and calculation. Therefore, the blockchain transaction processing system mentioned in this embodiment can be understood as any node on the blockchain network. That is, each node on the blockchain network may have a master shard and m sub-shards.
It should be understood that the present embodiment is a system embodiment corresponding to the first embodiment, and the present embodiment can be implemented in cooperation with the first embodiment. The related technical details mentioned in the first embodiment are still valid in this embodiment, and are not described herein again in order to reduce repetition. Accordingly, the related-art details mentioned in the present embodiment can also be applied to the first embodiment.
Fourth embodiment
A fourth embodiment of the invention is directed to a blockchain transaction processing system. The fourth embodiment is improved on the basis of the third embodiment, and the main improvement lies in that: in the fourth embodiment of the present invention, if all the sub-blocks generated within the first preset time period do not correspond to all the transactions to be processed, the master fragment is further configured to abandon each transaction to be processed and generate an error log. Therefore, the condition that the node does not respond for a long time to cause resource waste is avoided, and technicians can be helped to perform troubleshooting in time.
It should be understood that the present embodiment is a system embodiment corresponding to the second embodiment, and the present embodiment and the second embodiment can be implemented in cooperation. The related technical details mentioned in the second embodiment are still valid in this embodiment, and are not described herein again in order to reduce repetition. Accordingly, the related-art details mentioned in the present embodiment can also be applied to the second embodiment.
Fifth embodiment
A fifth embodiment of the present invention provides a blockchain transaction processing apparatus, including: a main fragmentation unit and m sub-fragmentation units. The main fragment unit is used for dividing a plurality of transactions to be processed into A transaction sets and distributing the A transaction sets to the m sub-fragment units for processing; wherein A and m are natural numbers greater than 0; the main fragment unit is used for acquiring the new sub-blocks generated by each sub-fragment unit and carrying out block packaging according to each sub-block; the main fragment unit is used for broadcasting the new blocks generated by packaging; and if the new block passes the verification in the block chain network, recording the new block as a valid block in each node of the block chain network.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method for processing blockchain transaction is applied to a node on a blockchain network, wherein the node is provided with a main fragment and m sub-fragments;
the method comprises the following steps:
the main fragment divides a plurality of transactions to be processed into A transaction sets, and distributes the A transaction sets to the m sub-fragments for processing; wherein A and m are natural numbers greater than 0;
the main fragment acquires the sub-blocks newly generated by each sub-fragment, and carries out block packing according to each sub-block;
the main fragment broadcasts the new block generated by packaging; and if the new block passes the verification in the blockchain network, recording the new block as an effective block in each node of the blockchain network.
2. The blockchain transaction processing method of claim 1, wherein a is equal to m, and the allocating a transaction sets to the m subfragments for processing specifically comprises: and distributing A transaction sets to the m sub-fragments to be processed.
3. The blockchain transaction processing method of claim 1, wherein after the allocating a of the transaction sets to the m subfragments for processing, further comprising:
and if all the sub-blocks generated within a first preset time length do not correspond to all the transactions to be processed, the main fragment abandons all the transactions to be processed and generates an error log.
4. The blockchain transaction processing method of claim 3, wherein the sub-fragment is determined to be faulty if a number of times that the sub-fragment generation sub-block exceeds the second predetermined time period exceeds a predetermined number of times.
5. The blockchain transaction processing method of claim 1, further comprising:
and if the main fragment has a fault, removing the main fragment, and selecting one sub fragment from the m sub fragments as a new main fragment.
6. The blockchain transaction processing method of claim 1, 4 or 5,
and if one subfragment fails, removing the subfragment.
7. The blockchain transaction processing method of claim 1, wherein the consensus algorithm of the master shard and the m sub-shards is the same.
8. The blockchain transaction processing method of claim 1,
and if the node is newly added in the block chain network, the newly added node acquires and synchronizes the longest block chain in the block chain network.
9. A blockchain transaction processing system, comprising: a main fragment and m sub-fragments;
the main fragment is used for dividing a plurality of transactions to be processed into A transaction sets and distributing the A transaction sets to the m sub-fragments for processing; wherein A and m are natural numbers greater than 0;
the main fragment is used for acquiring the sub-blocks newly generated by each sub-fragment and carrying out block packing according to each sub-block;
the main fragment is used for broadcasting the new blocks generated by packaging; and if the new block passes the verification in the blockchain network, recording the new block as an effective block in each node of the blockchain network.
10. The blockchain transaction processing system according to claim 9, further comprising a determining and processing unit, configured to determine, after the a transaction sets are allocated to the m sub-patches for processing, that if all the to-be-processed transactions do not correspond to all the to-be-processed transactions in all the sub-patches generated within a first preset time period, the main patch is further configured to abandon each of the to-be-processed transactions, and generate an error log.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811564556.8ACN111353884B (en) | 2018-12-20 | 2018-12-20 | Block chain transaction processing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811564556.8ACN111353884B (en) | 2018-12-20 | 2018-12-20 | Block chain transaction processing method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111353884Atrue CN111353884A (en) | 2020-06-30 |
| CN111353884B CN111353884B (en) | 2024-05-03 |
Family
ID=71195406
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811564556.8AActiveCN111353884B (en) | 2018-12-20 | 2018-12-20 | Block chain transaction processing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111353884B (en) |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH05151159A (en)* | 1991-11-28 | 1993-06-18 | Nec Corp | Transaction schedule system |
| US20140122510A1 (en)* | 2012-10-31 | 2014-05-01 | Samsung Sds Co., Ltd. | Distributed database managing method and composition node thereof supporting dynamic sharding based on the metadata and data transaction quantity |
| US9298760B1 (en)* | 2012-08-03 | 2016-03-29 | Google Inc. | Method for shard assignment in a large-scale data processing job |
| CN107392611A (en)* | 2017-03-24 | 2017-11-24 | 阿里巴巴集团控股有限公司 | A method and device for sending transaction information and consensus verification |
| CN108053211A (en)* | 2017-12-27 | 2018-05-18 | 北京欧链科技有限公司 | Transaction processing method and device based on block chain |
| CN108256707A (en)* | 2016-12-28 | 2018-07-06 | 平安科技（深圳）有限公司 | Declaration form pays a return visit management method and device |
| CN108269072A (en)* | 2016-12-30 | 2018-07-10 | 深圳瀚德创客金融投资有限公司 | For the transaction processing method and network node of block chain |
| WO2018126858A1 (en)* | 2017-01-06 | 2018-07-12 | 中国银联股份有限公司 | Blockchain technology-based robust atm network system and information processing method therefor |
| CN108564470A (en)* | 2018-04-17 | 2018-09-21 | 北京天德科技有限公司 | The transaction distribution method of block is built in a kind of block chain parallel |
| US20180294955A1 (en)* | 2017-04-05 | 2018-10-11 | Samsung Sds Co., Ltd. | System for processing data based on blockchain and operating method thereof |
| CN108847925A (en)* | 2018-06-20 | 2018-11-20 | 深圳大学 | A kind of fragment block chain generation method based on tree |
| US20180336552A1 (en)* | 2017-05-17 | 2018-11-22 | Nec Europe Ltd. | Method and system for providing a robust blockchain with an integrated proof of storage |
| CN108881488A (en)* | 2018-08-01 | 2018-11-23 | 夸克链科技（深圳）有限公司 | It is a kind of based on the block chain transaction processing method and network that divide domain |
| CN108881274A (en)* | 2018-07-06 | 2018-11-23 | 众安信息技术服务有限公司 | A kind of block chain sharding method and device based on application |
| CN108960837A (en)* | 2018-06-05 | 2018-12-07 | 上海和数软件有限公司 | Block chain common recognition verification method, device and computer readable storage medium |
| CN108989410A (en)* | 2018-07-04 | 2018-12-11 | 清华大学 | A method of improving block chain throughput efficiency |
- 2018
- 2018-12-20CNCN201811564556.8Apatent/CN111353884B/enactiveActive
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH05151159A (en)* | 1991-11-28 | 1993-06-18 | Nec Corp | Transaction schedule system |
| US9298760B1 (en)* | 2012-08-03 | 2016-03-29 | Google Inc. | Method for shard assignment in a large-scale data processing job |
| US20140122510A1 (en)* | 2012-10-31 | 2014-05-01 | Samsung Sds Co., Ltd. | Distributed database managing method and composition node thereof supporting dynamic sharding based on the metadata and data transaction quantity |
| CN108256707A (en)* | 2016-12-28 | 2018-07-06 | 平安科技（深圳）有限公司 | Declaration form pays a return visit management method and device |
| CN108269072A (en)* | 2016-12-30 | 2018-07-10 | 深圳瀚德创客金融投资有限公司 | For the transaction processing method and network node of block chain |
| WO2018126858A1 (en)* | 2017-01-06 | 2018-07-12 | 中国银联股份有限公司 | Blockchain technology-based robust atm network system and information processing method therefor |
| CN107392611A (en)* | 2017-03-24 | 2017-11-24 | 阿里巴巴集团控股有限公司 | A method and device for sending transaction information and consensus verification |
| US20180294955A1 (en)* | 2017-04-05 | 2018-10-11 | Samsung Sds Co., Ltd. | System for processing data based on blockchain and operating method thereof |
| US20180336552A1 (en)* | 2017-05-17 | 2018-11-22 | Nec Europe Ltd. | Method and system for providing a robust blockchain with an integrated proof of storage |
| CN108053211A (en)* | 2017-12-27 | 2018-05-18 | 北京欧链科技有限公司 | Transaction processing method and device based on block chain |
| CN108564470A (en)* | 2018-04-17 | 2018-09-21 | 北京天德科技有限公司 | The transaction distribution method of block is built in a kind of block chain parallel |
| CN108960837A (en)* | 2018-06-05 | 2018-12-07 | 上海和数软件有限公司 | Block chain common recognition verification method, device and computer readable storage medium |
| CN108847925A (en)* | 2018-06-20 | 2018-11-20 | 深圳大学 | A kind of fragment block chain generation method based on tree |
| CN108989410A (en)* | 2018-07-04 | 2018-12-11 | 清华大学 | A method of improving block chain throughput efficiency |
| CN108881274A (en)* | 2018-07-06 | 2018-11-23 | 众安信息技术服务有限公司 | A kind of block chain sharding method and device based on application |
| CN108881488A (en)* | 2018-08-01 | 2018-11-23 | 夸克链科技（深圳）有限公司 | It is a kind of based on the block chain transaction processing method and network that divide domain |
Non-Patent Citations (1)
| Title |
|---|
| LOI LUU等: "A Secure Sharding Protocol For Open Blockchains", pages 17 - 30* |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111353884B (en) | 2024-05-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106406896B (en) | Block chain block building method based on parallel Pipeline technology | |
| CN112511590A (en) | Efficient storage reconfiguration method for block chain fragmentation | |
| CN111708627A (en) | Task scheduling method and device based on distributed scheduling framework | |
| CN111127017B (en) | Block chain full-fragmentation method and device based on P2P storage network and multilayer architecture | |
| CN110213038B (en) | Method and system for forming consensus of block chain | |
| CN110505084B (en) | Block chain packing node consensus electing method | |
| CN109756566B (en) | Block chain based data storage method, related equipment and storage medium | |
| CN114202422B (en) | A blockchain sharding method, blockchain system and cross-sharding transaction processing method | |
| CN113157450A (en) | Method and apparatus for performing blocks in a blockchain system | |
| CN115292340B (en) | Block chain storage optimization method and device based on distributed network coding | |
| CN108616782A (en) | A kind of frequency spectrum distributing method based on the optimization of non-intersecting connection group in elastic optical network | |
| CN112181974B (en) | Identification information distribution method, system and storage device | |
| CN101465714A (en) | Method, device and system for mixed multiple connection and de-multiple connection | |
| CN115941622A (en) | A bandwidth adjustment method, system, device and storage medium | |
| WO1990010343A1 (en) | Time division multiplexer/demultiplexer with deterministic time slot assignment | |
| CN111353884A (en) | Block chain transaction processing method and system | |
| WO2016050022A1 (en) | Method, device, system and computer storage medium for allocating uplink bandwidth | |
| EP3485618A1 (en) | Device and method for managing end-to-end connections | |
| CN113676314B (en) | Quantum key management method, comparison method, output method, device and system | |
| CN118900288A (en) | Device and method for generating fine-grained flexible optical data unit signals based on FPGA | |
| CN117319422B (en) | Block chain blocking method and system for Internet of things data in urban planning field | |
| CN116012164B (en) | Block chain cross-fragment transaction method based on virtual account | |
| CN117081930A (en) | Uplink bandwidth allocation method and PON system | |
| CN113672686B (en) | Block data distribution and storage method and system | |
| CN116303343A (en) | Data slicing method, device, electronic 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 | ||
| CB03 | Change of inventor or designer information | Inventor after:He Haiwen Inventor after:He Haiwu Inventor after:Zhou Bing Inventor after:Rao Yulin Inventor after:Wang Wei Inventor before:He Haiwen Inventor before:He Haiwu Inventor before:Zhou Bing Inventor before:Rao Yulin Inventor before:Wang Wei | |
| CB03 | Change of inventor or designer information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |