CN109447804B - Transaction distribution method, device and storage medium - Google Patents
Transaction distribution method, device and storage medium Download PDFInfo
- Publication number
- CN109447804B CN109447804B CN201811272469.5A CN201811272469A CN109447804B CN 109447804 B CN109447804 B CN 109447804B CN 201811272469 A CN201811272469 A CN 201811272469A CN 109447804 B CN109447804 B CN 109447804B
- Authority
- CN
- China
- Prior art keywords
- transaction
- fragment
- transfer transaction
- node
- transfer
- 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.)
- Active
Links
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
-
- 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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/08—Payment architectures
- G06Q20/16—Payments settled via telecommunication systems
-
- 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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3827—Use of message hashing
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Engineering & Computer Science (AREA)
- Finance (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Technology Law (AREA)
- Computer Security & Cryptography (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The invention provides a transaction shunting method, equipment and a storage medium, wherein the method comprises the following steps: determining whether a transaction amount of the received transfer transaction is greater than a preconfigured first threshold: if yes, broadcasting the transfer transaction to each node of the first block chain; if not, the transfer transaction is broadcasted to the distributed fragment nodes according to a pre-configured transaction distribution method; wherein the first blockchain network comprises a plurality of tiles. According to the scheme, transactions are divided according to transaction amounts, transactions with large transaction amounts need to be identified in a whole network node, transactions with small transaction amounts are allocated to different segments for identification, and the security of the transactions is guaranteed while the performance of a block chain network is improved.
Description
Technical Field
The application relates to the technical field of internet finance, in particular to a transaction distribution method, equipment and a storage medium.
Background
In the traditional block chain technology, each transaction needs to be known by all nodes in a block chain network; after the fragmentation technology is adopted, each transaction only needs to pass through a part of the nodes of the characteristics to be subjected to consensus, so that the time for achieving consensus is reduced, and the performance (capacity and throughput) of the block chain network is improved. However, the performance (i.e., capacity and throughput) of the blockchain network is improved at the cost of reducing the security of the blockchain network and improving the centralization, and the use of the fragmentation technique reduces the security of the transaction.
Disclosure of Invention
In view of the foregoing drawbacks and deficiencies of the prior art, it is desirable to provide a transaction offloading method, device, and storage medium for improving performance of a blockchain network and ensuring security of a transaction.
In a first aspect, the present invention provides a transaction offloading method, including:
determining whether a transaction amount of the received transfer transaction is greater than a preconfigured first threshold:
if yes, broadcasting the transfer transaction to each node of the first block chain;
if not, the transfer transaction is broadcasted to the distributed fragment nodes according to a pre-configured transaction distribution method; wherein the first blockchain network comprises a plurality of tiles.
In a second aspect, the present invention also provides an apparatus comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform a transaction diversion method provided according to embodiments of the present invention.
In a third aspect, the present invention further provides a storage medium storing a computer program, where the computer program makes a computer execute the transaction distribution method provided in accordance with the embodiments of the present invention.
The transaction distribution method, the device and the storage medium provided by the embodiments of the invention determine whether the transaction amount of the received transfer transaction is larger than a pre-configured first threshold value: if yes, broadcasting the transfer transaction to each node of the first block chain; if not, the transfer transaction is broadcasted to the distributed fragment nodes according to a pre-configured transaction distribution method; the first blockchain network comprises a plurality of fragment methods, the transaction is divided according to the transaction amount, the transaction with large transaction amount needs to be identified by the nodes of the whole network, the transaction with small transaction amount is allocated to different fragments for identification, and the security of the transaction is ensured while the performance of the blockchain network is improved.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a schematic diagram of a transaction diversion scenario according to an embodiment of the present invention.
Fig. 2 is a flowchart of a transaction offloading method according to an embodiment of the present invention.
Fig. 3 is a flowchart of step S13 in a preferred embodiment of the method shown in fig. 2.
Fig. 4 is a flowchart of step S14 in a preferred embodiment of the method shown in fig. 2.
Fig. 5 is a flowchart of step S144 in a preferred embodiment of the method shown in fig. 4.
Fig. 6 is a flowchart of step S142 in a preferred embodiment of the method shown in fig. 4.
FIG. 7 is a flow chart of a preferred embodiment of the method shown in FIG. 2.
Fig. 8 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
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.
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.
Fig. 1 is a schematic diagram of a transaction diversion scenario according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, after receiving a transaction sent by a user and screening out a transfer transaction, a node of a first block chain provides a transaction offloading service according to a transaction amount of the transfer transaction. The transaction with large transaction amount needs to be identified by the nodes of the whole network, and the transaction with small transaction amount is distributed to different segments for identification. The transaction distribution method provided by the present invention is specifically described below with reference to fig. 2.
Fig. 2 is a flowchart of a transaction offloading method according to an embodiment of the present invention. As shown in fig. 2, in this embodiment, the present invention provides a transaction offloading method, including:
determining whether a transaction amount of the received transfer transaction is greater than a preconfigured first threshold:
if yes, go to step S13, otherwise go to step S14;
s13: broadcasting the transfer transaction to each node of the first blockchain;
s14: broadcasting the transfer transaction to the distributed fragmented nodes according to a pre-configured transaction distribution method; wherein the first blockchain network comprises a plurality of tiles.
Specifically, taking the application scenario shown in fig. 1 as an example, the preconfigured first threshold is 1000, the transaction amount of the transfer transaction a is 5000, and the transaction amount of the transfer transaction B is 500; the first blockchain includes 2400 nodes in total, where nodes 1 to 600 are nodes constituting segment 1, the segment number of segment 1 is 0, nodes 601 to 1200 are nodes constituting segment 2, the segment number of segment 2 is 1, nodes 1201 to 1800 are nodes constituting segment 3, the segment number of segment 3 is 2, nodes 1801 to 2400 are nodes constituting segment 4, and the segment number of segment 4 is 3.
The node of the first blockchain determines whether the transaction amount of the received transfer transaction a is greater than a preconfigured first threshold:
since the transaction amount of the transfer transaction a is 5000, which is greater than the preconfigured first threshold 1000, step S13 is performed to broadcast the transfer transaction a to the nodes of the first blockchain.
The node of the first blockchain determines whether the transaction amount of the received transfer transaction B is greater than a preconfigured first threshold:
since the transaction amount of the transfer transaction B is 500 and not greater than the preconfigured first threshold 1000, performing step S14, broadcasting the transfer transaction to the assigned sharded nodes according to the preconfigured transaction assignment method; wherein the first blockchain network comprises a plurality of tiles.
In the above embodiment, the transaction splitting method provided by the present invention is described in detail by taking the preconfigured first threshold as 1000, the transaction amount of the transfer transaction a as 5000, and the transaction amount of the transfer transaction B as 500 as examples, and in further embodiments, the transaction splitting method provided by the present invention is not limited to the above examples, and the first threshold may be configured as any value according to actual requirements, so that the same technical effect may be achieved.
The embodiment divides the transaction according to the transaction amount, the transaction with large transaction amount needs to be identified in common by the nodes of the whole network, the transaction with small transaction amount is allocated to different segments for identification, and the security of the transaction is ensured while the performance of the block chain network is improved.
Fig. 3 is a flowchart of step S13 in a preferred embodiment of the method shown in fig. 2. As shown in fig. 3, in a preferred embodiment, step S13 includes:
s132: storing the transfer transaction into a global transaction pool of the current node; and the number of the first and second groups,
and broadcasting the transfer transaction to each node of the first block chain so that each node can perform global consensus.
Specifically, taking the application scenario shown in fig. 1 as an example, the transaction amount of the transfer transaction a is 5000, which is greater than the preconfigured first threshold 1000;
in step S132, the node of the first block chain stores the transfer transaction a in the global transaction pool of the current node; and the number of the first and second groups,
the transfer transaction a is broadcast to each node of the first blockchain for global consensus by each node.
Fig. 4 is a flowchart of step S14 in a preferred embodiment of the method shown in fig. 2. As shown in fig. 4, in a preferred embodiment, step S14 includes:
s142: calculating the fragment number of the fragment corresponding to the transfer transaction;
s144: and broadcasting the transfer transaction to the corresponding fragmented nodes according to the fragment numbers so as to ensure that the corresponding fragmented nodes can perform fragment consensus.
Specifically, taking the application scenario shown in fig. 1 as an example, the transaction amount of the transfer transaction B is 500, and is not greater than the preconfigured first threshold 1000, and the shard number of the shard corresponding to the transfer transaction B is calculated to be 0;
in step S142, the node of the first block chain calculates the segment number of the segment corresponding to the transfer transaction B, and the segment number of the segment corresponding to the transfer transaction B is 0;
in step S144, the node of the first block chain broadcasts the transfer transaction B to the node of the segment with the segment number 0 according to the segment number 0, so that the node of the segment with the segment number 0 performs segment consensus.
Fig. 5 is a flowchart of step S144 in a preferred embodiment of the method shown in fig. 4. As shown in fig. 5, in a preferred embodiment, step S144 includes:
judging whether the transfer transaction is distributed to the fragment where the current node is located according to whether the first fragment number is the same as the second fragment number; the first fragment number is the fragment number of the fragment where the current node is located, and the second fragment number is the fragment number of the fragment to which the transfer transaction is allocated according to a pre-configured transaction allocation method:
if yes, executing step S1442, otherwise, executing step S1444;
s1442: storing the transfer transaction into the fragmented transaction pool of the current node; and the number of the first and second groups,
broadcasting the transfer transaction to each node of the fragment of the first fragment number so as to enable each node of the fragment of the first fragment number to perform fragment consensus;
s1444: and broadcasting the transfer transaction to the node of the fragment numbered by the second fragment so as to ensure that the node of the fragment numbered by the second fragment performs fragment consensus.
Specifically, taking the application scenario shown in fig. 1 as an example, the current node provides a full-network consensus service for the first blockchain network and also provides a segment consensus service for the segment with the segment number 0, the transfer transaction C is assigned to the segment with the segment number 0, and the transfer transaction D is assigned to the segment with the segment number 1.
The node of the first block chain judges whether the transfer transaction is distributed to the fragment where the current node is located according to whether the first fragment number is the same as the second fragment number; the first fragment number is the fragment number of the fragment where the current node is located, and the second fragment number is the fragment number of the fragment to which the transfer transaction is allocated according to a pre-configured transaction allocation method;
because the current node provides the whole network consensus service for the first block chain network and also provides the fragment consensus service for the fragment with the fragment number of 0, the transfer transaction C is distributed to the fragment with the fragment number of 0, and the first fragment number is the same as the second fragment number, the step S1442 is executed, and the transfer transaction C is stored in the fragment transaction pool of the fragment with the fragment number of 0; and broadcasting the transfer transaction to each node of the segment with the segment number of 0 so as to enable each node of the segment with the segment number of 0 to perform segment consensus.
Because the current node provides the whole network consensus service for the first block chain network and also provides the fragment consensus service for the fragment with the fragment number of 0, the transfer transaction D is assigned to the fragment with the fragment number of 1, and the first fragment number is different from the second fragment number, step S1444 is executed to broadcast the transfer transaction B to the node of the fragment with the fragment number of 1, so as to perform fragment consensus for the node of the fragment with the fragment number of 1.
Fig. 6 is a flowchart of step S142 in a preferred embodiment of the method shown in fig. 4. As shown in fig. 6, in a preferred embodiment, step S142 includes:
s1422: generating a first random number according to transaction hash of the transfer transaction;
s1424: and the first random number and the total number of the fragments in the first block chain are subjected to complementation to obtain the fragment number.
Specifically, taking the application scenario shown in fig. 1 as an example, the hash value of the transfer transaction a is a 256-bit binary hash value with four bits at the rightmost side being 1 and the remaining bits being 0, which is recorded as 0000 … … 1111, and the first random number is generated by converting the transaction hash into a decimal number according to the method for generating the first random number by the transaction hash of the transaction.
In step S1422, the node of the first block chain generates a first random number according to the transaction hash of the transfer transaction a, and since the transaction hash of the transfer transaction a is a 256-bit binary hash value in which four bits on the rightmost side are 1 and the rest are 0, 1111 is converted into a decimal number, the converted decimal number is 15, and the first random number is 15;
in step S1424, a node of the first blockchain performs remainder on the first random number and the total number of the segments in the first blockchain to obtain a segment number; with segment number 15mod3 equal to 0, transfer transaction a is assigned to segment number 0, segment 1.
In the above embodiment, the 256-bit binary hash value with the transfer transaction a as the rightmost four bits of 1 and the remaining bits of 0 is recorded as 0000 … … 1111, and the method for generating the first random number according to the transaction hash is described in detail as an example of converting the transaction hash into a decimal number to generate the first random number.
FIG. 7 is a flow chart of a preferred embodiment of the method shown in FIG. 2. As shown in fig. 7, in a preferred embodiment, the method further includes:
s11: receiving a transaction sent by a client of a user;
judging whether the received transaction is a transfer transaction according to the first identifier in the received transaction, if not, ending and returning;
wherein the first identifier is used for identifying whether the transaction is a transfer transaction.
Specifically, taking the application scenario shown in fig. 1 as an example, a first identifier is configured for a transfer transaction, the first identifier is obtained by adding a prefix acc before the transaction, the first identifier is configured for each of transaction a, transaction B, transaction C, and transaction D, and the first identifier is not configured for transaction E;
in step S11, the node of the first blockchain receives the transaction sent by the client of the user;
the node of the first block chain judges whether the received transaction is a transfer transaction according to the first identifier in the received transaction, and the transaction E is ended and returned because the transaction E is not configured with the first identifier; the transaction A, the transaction B, the transaction C and the transaction D are all provided with first identifications, the transaction A, the transaction B, the transaction C and the transaction D are transfer transactions, and the transfer transactions A, the transfer transactions B, the transfer transactions C and the transfer transactions D are nodes of a first block chain and execute a transaction distribution method.
In the embodiments, the first identifier is configured in the transfer transaction, the first identifier is obtained by adding a prefix acc before the transaction, the first identifiers are configured in the transaction a, the transaction B, the transaction C and the transaction D, and the first identifier is not configured in the transaction E.
In a preferred embodiment, the total number of slices is related to the total number of nodes in the first blockchain.
In a preferred embodiment, the relationship between the total number of slices and the total number of nodes in the first blockchain is:
wherein, N is the total number of the fragments, M is the total number of the nodes in the first block chain, L is the total number of the nodes pre-configured in each fragment, and round is an upward rounding function; taking the total number of nodes in the first blockchain as 2400, the total number of nodes preconfigured in each slice as 600 as an example,
the total number of slices is calculated to be 4. In further embodiments, the total number of preconfigured nodes may be configured to other values according to actual requirements, and the same technical effect may be achieved.
Fig. 8 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 8, as another aspect, the present application also provides an apparatus 800 including one or more Central Processing Units (CPUs) 801 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. In the RAM803, various programs and data necessary for the operation of the apparatus 800 are also stored. The CPU801, ROM802, and RAM803 are connected to each other via a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.
The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.
In particular, according to an embodiment of the present disclosure, the transaction offloading method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing a transaction diversion method. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811.
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 transaction diversion 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 (10)
1. A transaction offloading method, comprising:
determining whether a transaction amount of the received transfer transaction is greater than a preconfigured first threshold:
if yes, broadcasting the transfer transaction to each node of the first block chain so that each node can perform global consensus;
if not, broadcasting the transfer transaction to the distributed fragmented nodes according to a pre-configured transaction distribution method so as to enable the corresponding fragmented nodes to perform fragment consensus; wherein the first blockchain network comprises a plurality of said slices.
2. The method of claim 1, wherein broadcasting the transfer transaction to the nodes of the first blockchain comprises:
storing the transfer transaction into a global transaction pool of a current node; and the number of the first and second groups,
and broadcasting the transfer transaction to each node of the first block chain so that each node can perform global consensus.
3. The method of claim 1, wherein the broadcasting the transfer transaction to the assigned sharded nodes according to a preconfigured transaction assignment method comprises:
calculating the fragment number of the fragment corresponding to the transfer transaction;
and broadcasting the transfer transaction to the corresponding fragmented nodes according to the fragment numbers so as to ensure that the corresponding fragmented nodes can perform fragment consensus.
4. The method of claim 3, wherein the broadcasting the transfer transaction to the corresponding fragmented nodes according to the fragment numbers for fragmented consensus comprises:
judging whether the transfer transaction is distributed to the segment where the current node is located according to whether the first segment number is the same as the second segment number; the first fragment number is the fragment number of the fragment where the current node is located, and the second fragment number is the fragment number of the fragment to which the transfer transaction is allocated according to a pre-configured transaction allocation method:
if yes, the transfer transaction is stored in a fragment transaction pool of the current node; and the number of the first and second groups,
broadcasting the transfer transaction to each node of the segment of the first segment number so as to enable each node of the segment of the first segment number to perform segment consensus;
and if not, broadcasting the transfer transaction to the node of the fragment numbered by the second fragment so as to enable the node of the fragment numbered by the second fragment to perform fragment consensus.
5. The method of claim 3, wherein calculating the segment number corresponding to the transfer transaction comprises:
generating a first random number according to the transaction hash of the transfer transaction;
and the first random number and the total number of the fragments in the first block chain are subjected to complementation to obtain the fragment number.
6. The method of any of claims 1-5, wherein the transactions include transfer transactions and contract transactions, further comprising:
receiving a transaction sent by a client of a user;
judging whether the received transaction is the transfer transaction according to the first identifier in the received transaction, if not, ending and returning;
wherein the first identifier is used for identifying whether the transaction is a transfer transaction.
7. The method according to any of claims 1-5, wherein the total number of slices is related to the total number of nodes in the first blockchain.
8. The method of claim 7, wherein the total number of slices and the total number of nodes in the first blockchain are related by:
wherein, N is the total number of the fragments, M is the total number of nodes in the first blockchain, L is the total number of nodes preconfigured in each of the fragments, and round is an upward rounding function.
9. An apparatus for transaction triage, the apparatus comprising:
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-8.
10. 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-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811272469.5A CN109447804B (en) | 2018-10-30 | 2018-10-30 | Transaction distribution method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811272469.5A CN109447804B (en) | 2018-10-30 | 2018-10-30 | Transaction distribution method, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109447804A CN109447804A (en) | 2019-03-08 |
| CN109447804B true CN109447804B (en) | 2020-08-14 |
Family
ID=65549214
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811272469.5A Active CN109447804B (en) | 2018-10-30 | 2018-10-30 | Transaction distribution method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109447804B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110414955A (en) * | 2019-07-25 | 2019-11-05 | 泰康保险集团股份有限公司 | Transfer account method, device, medium and electronic equipment based on block chain |
| CN110933022A (en) * | 2019-10-11 | 2020-03-27 | 深圳壹账通智能科技有限公司 | Block processing method and device, computer equipment and storage medium |
| CN111404781B (en) * | 2020-03-13 | 2021-08-31 | 杭州复杂美科技有限公司 | Speed limiting method, apparatus and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108241968A (en) * | 2017-03-26 | 2018-07-03 | 杭州复杂美科技有限公司 | The method that front end processor participates in block chain common recognition |
| CN108648078A (en) * | 2018-05-02 | 2018-10-12 | 杭州秘猿科技有限公司 | A kind of transaction preprocess method, device and electronic equipment |
| CN108664221A (en) * | 2018-05-11 | 2018-10-16 | 北京奇虎科技有限公司 | A kind of data proof of possession method, apparatus and readable storage medium storing program for executing |
| CN108681583A (en) * | 2018-05-11 | 2018-10-19 | 北京奇虎科技有限公司 | Data proof of possession method, apparatus and readable storage medium storing program for executing based on block chain |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108648084B (en) * | 2018-05-18 | 2022-01-04 | 百度在线网络技术（北京）有限公司 | Data processing method, device and equipment of block chain network and storage medium |
| CN108681943B (en) * | 2018-05-18 | 2022-07-12 | 百度在线网络技术（北京）有限公司 | Data processing method, device and equipment of block chain network and storage medium |
-
2018
- 2018-10-30 CN CN201811272469.5A patent/CN109447804B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108241968A (en) * | 2017-03-26 | 2018-07-03 | 杭州复杂美科技有限公司 | The method that front end processor participates in block chain common recognition |
| CN108648078A (en) * | 2018-05-02 | 2018-10-12 | 杭州秘猿科技有限公司 | A kind of transaction preprocess method, device and electronic equipment |
| CN108664221A (en) * | 2018-05-11 | 2018-10-16 | 北京奇虎科技有限公司 | A kind of data proof of possession method, apparatus and readable storage medium storing program for executing |
| CN108681583A (en) * | 2018-05-11 | 2018-10-19 | 北京奇虎科技有限公司 | Data proof of possession method, apparatus and readable storage medium storing program for executing based on block chain |
Non-Patent Citations (2)
| Title |
|---|
| 《区块链可扩展性研究：问题与方法》;潘晨 等;《计算机研究与发展》;20181001;第55卷(第10期);第2100-2105页 * |
| 潘晨 等.《区块链可扩展性研究：问题与方法》.《计算机研究与发展》.2018,第55卷(第10期),第2100-2105页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109447804A (en) | 2019-03-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109447804B (en) | Transaction distribution method, device and storage medium | |
| CN110175212B (en) | Block chain distributed storage method, data reading method, device and storage medium | |
| CN111046045B (en) | Method, device, equipment and storage medium for processing data inclination | |
| CN110852882B (en) | Packet consensus method, apparatus, device, and medium for blockchain networks | |
| CN112308521A (en) | Micro-service dividing method and system | |
| CN111782383A (en) | Task allocation method, server, electronic terminal and computer readable storage medium | |
| CN111475250A (en) | Network optimization method and device in cloud environment | |
| CN115357571A (en) | Data deduplication method, device, equipment and medium | |
| CN110490734B (en) | Transaction group construction and broadcasting method and system, equipment and storage medium | |
| CN106909619B (en) | Hybrid social network clustering method and system based on offset adjustment and bidding | |
| CN111611317B (en) | Block chain distributed storage grouping method, device and storage medium | |
| CN112600905B (en) | Transaction broadcasting and block generating method, apparatus and storage medium | |
| CN111836135A (en) | Spectrum allocation method and device | |
| JP7107671B2 (en) | Resource allocation device | |
| CN111400043A (en) | Transaction pool management method, device and storage medium | |
| CN110582122A (en) | resource indication method, device, service node and storage medium | |
| US9769263B2 (en) | Predictive connection request shedding | |
| WO2021115015A1 (en) | Beam selection method, terminal and storage medium | |
| CN110909288B (en) | Service data processing method, device, platform, service end, system and medium | |
| CN112181829B (en) | User distribution method, device, terminal and medium for AB experiment | |
| CN111274209B (en) | Method and device for processing ticket file | |
| CN109344119B (en) | File merging processing method and device, computing equipment and computer storage medium | |
| CN111106945B (en) | VNF instantiation method, device, equipment and storage medium | |
| CN113590322A (en) | Data processing method and device | |
| CN111177478A (en) | Query method, device and system |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |