CN111415259B - Transaction queuing method, device and storage medium - Google Patents
Transaction queuing method, device and storage medium Download PDFInfo
- Publication number
- CN111415259B CN111415259B CN202010225738.3A CN202010225738A CN111415259B CN 111415259 B CN111415259 B CN 111415259B CN 202010225738 A CN202010225738 A CN 202010225738A CN 111415259 B CN111415259 B CN 111415259B
- Authority
- CN
- China
- Prior art keywords
- transaction
- queue
- static
- dynamic
- queuing
- 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
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000003068 static effect Effects 0.000 claims abstract description 63
- 238000004590 computer program Methods 0.000 claims description 8
- 238000004806 packaging method and process Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000012163 sequencing technique Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 1
- 230000003111 delayed 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
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/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3827—Use of message hashing
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
- G07C2011/04—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere related to queuing systems
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Physics & Mathematics (AREA)
- Finance (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Technology Law (AREA)
- Computer Security & Cryptography (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a transaction queuing method, equipment and a storage medium, which relate to the technical field of blockchains and the like, and the method comprises the following steps: receiving a first transaction; determining whether a first renewal of the first transaction is greater than a pre-configured threshold: if yes, adding the first transaction to the static queue when the static queue can store the first transaction; if not, storing the first transaction into a dynamic queue according to a preset queuing rule; and pulling a plurality of transactions from the static queue and the dynamic queue according to a pre-configured transaction pulling rule to generate a block. The method and the device support dynamic queuing of transactions, expand static queuing space, increase certainty of transaction packaging and improve user experience.
Description
Technical Field
The present application relates to the technical field of blockchains, and in particular, to a transaction queuing method, device, and storage medium.
Background
In the existing blockchain technology, the ordering manner of transactions in a transaction pool is mainly divided into two types: time sequencing and trade rate high-low sequencing.
The time sequencing relies on broadcasting delay in the network, and when the network is crowded, the transaction priority cannot be manually controlled through an effective means, namely the sequencing is relatively fixed and static, and cannot be dynamically adjusted.
The trade rate high-low ordering can make trade priority higher, but because the number of the trade packed by a single block is limited, the trade can not be guaranteed to be packed into the block in time, namely, before the block is packed, other trade with higher trade fees are added, the trade is delayed to be packed and possibly extruded out of a trade pool, the ordering mode has stronger dynamic property and larger uncertainty, and even if a user spends higher commission, the trade can not be packed in time, even the trade can not be packed, and the user experience is poor.
Disclosure of Invention
In view of the foregoing drawbacks or deficiencies of the prior art, it is desirable to provide a transaction queuing method, apparatus and storage medium that supports dynamic queuing of transactions, increases the certainty of the packaging of transactions.
In a first aspect, the present invention provides a transaction queuing method applicable to a blockchain node, where a static queue and a dynamic queue are configured in a transaction pool, the method includes:
receiving a first transaction;
determining whether a first renewal of the first transaction is greater than a pre-configured threshold:
if yes, judging whether the static queue can store the first transaction:
if yes, adding the first transaction to a static queue;
if not, storing the first transaction into a dynamic queue according to a preset queuing rule;
and pulling a plurality of transactions from the static queue and the dynamic queue according to a pre-configured transaction pulling rule to generate a block.
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 queuing method provided according to embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute the transaction queuing method provided according to the embodiments of the present invention.
The transaction queuing method, the device and the storage medium provided by the embodiments of the invention are used for receiving a first transaction; determining whether a first renewal of the first transaction is greater than a pre-configured threshold: if yes, adding the first transaction to the static queue when the static queue can store the first transaction; if not, storing the first transaction into a dynamic queue according to a preset queuing rule; the method for pulling a plurality of transactions from the static queue and the dynamic queue according to the preconfigured transaction pulling rule to generate the block supports the dynamic queuing of the transactions, expands the static queuing space, increases the certainty of transaction packaging and improves the user experience.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the detailed description of non-limiting embodiments, made with reference to the following drawings, in which:
fig. 1 is a flowchart of a transaction queuing method according to an embodiment of the present invention.
Fig. 2 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
The present application is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be noted that, for convenience of description, only the portions related to the invention are shown in the drawings.
It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other. The present application will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 is a flowchart of a transaction queuing method according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, a transaction queuing method applicable to a blockchain node, a static queue and a dynamic queue are configured in a transaction pool, and the method includes:
s12: receiving a first transaction;
s141: determining whether a first renewal of the first transaction is greater than a pre-configured threshold:
if yes, step S142 is executed: determining whether the static queue can store the first transaction:
if yes, step S1421 is executed: appending the first transaction to a static queue;
if not, then step S143 is performed: storing the first transaction into a dynamic queue according to a pre-configured queuing rule;
s16: and pulling a plurality of transactions from the static queue and the dynamic queue according to a pre-configured transaction pulling rule to generate a block.
Specifically, assume that S142 includes determining whether the first remaining capacity of the static queue is not less than the first capacity required to store the first transaction; discarding the first transaction when the static queue is unable to store the first transaction; the transaction pulling rule is to preferentially pull the transactions in the static queue; the queuing rule is queuing according to the order of the commission fees from big to small, S143 includes:
determining whether the dynamic queue can store the first transaction:
if yes, storing the first transaction into a dynamic queue;
if not, judging whether a second transaction with the commission lower than the first commission exists:
if yes, deleting the second transaction from the dynamic queue, and storing the first transaction into the dynamic queue;
if not, discarding the first transaction;
with a pre-configured threshold of 10AAA; the first residual capacity is 100k, and the user A generates tx1 with the commission of 10.1AAA and the size of 85k and sends the tx1 to the blockchain node;
the block chain node executes step S12 to receive tx1;
the blockchain node executes step S141 to determine whether the handling fee of tx1 is greater than 10AAA:
since tx1 has a handling fee of 10.1AAA, which is greater than 10AAA, step S142 is performed: judging whether the static queue can store tx1:
since tx1 has a size of 85k and the first remaining capacity is 100k, tx1 may be stored, and the blockchain node performs step S1421: append tx1 to the static queue;
the blockchain node performs step S16 to preferentially pull transactions from the static and dynamic queues to generate blocks.
With a pre-configured threshold of 10AAA; the first residual capacity is 100k, and the user B generates tx2 with the commission of 10.1AAA and the size of 125k and sends the tx2 to the blockchain node;
the block chain node executes step S12 to receive tx2;
the blockchain node executes step S141 to determine whether the commission of tx2 is greater than a preconfigured threshold:
since tx2 has a handling fee of 10.1AAA, which is greater than 10AAA, step S142 is performed: judging whether the static queue can store tx2:
since tx2 is 125k in size, the first remaining capacity is 100k, tx1 cannot be stored, and tx2 is discarded by the blockchain node.
The blockchain node performs step S16 to preferentially pull transactions from the static and dynamic queues to generate blocks.
With a pre-configured threshold of 10AAA; the first residual capacity is 100k, the user C generates tx3 with the commission of 5.1AAA and the size of 85k and sends the tx3 to the blockchain node, and the dynamic queue can store tx3 as an example;
the block chain node executes step S12 to receive tx3;
the blockchain node executes step S141 to determine whether the handling fee of tx3 is greater than 10AAA:
since the handling fee of tx3 is 5.1AAA and is not greater than 10AAA, step S143 is performed: judging whether the dynamic queue can store tx3:
since the dynamic queue can store tx3, the block link point stores tx3 into the dynamic queue;
the blockchain node performs step S16 to preferentially pull transactions from the static and dynamic queues to generate blocks.
With a pre-configured threshold of 10AAA; the first residual capacity is 100k, the user D generates tx4 with the handling fee of 5.1AAA and the size of 125k and sends the tx4 to the blockchain node, the tx4 can not be stored in a dynamic queue, and tx5 with the size of more than 125k and the handling fee of less than 5.1AAA is used as an example in the dynamic queue;
the block chain node executes step S12 to receive tx4;
the blockchain node executes step S141 to determine whether the handling fee of tx4 is greater than 10AAA:
since the handling fee of tx4 is 5.1AAA and is not greater than 10AAA, step S143 is performed: judging whether the dynamic queue can store tx4:
because the dynamic queue can not store tx4, and tx5 with the size of more than 125k and the handling fee of less than 5.1AAA exists in the dynamic queue, the tx5 is deleted from the dynamic queue, and tx4 is stored in the dynamic queue;
the blockchain node performs step S16 to preferentially pull transactions from the static and dynamic queues to generate blocks.
With a pre-configured threshold of 10AAA; the first residual capacity is 100k, the user E generates tx6 with a handling fee of 5.1AAA and a size of 125k and sends the tx6 to the blockchain node, the tx6 cannot be stored in the dynamic queue, and no transaction with the handling fee lower than 5.1AAA exists in the dynamic queue as an example;
the block chain node executes step S12 to receive tx6;
the blockchain node executes step S141 to determine whether the handling fee of tx6 is greater than 10AAA:
since the handling fee of tx6 is 5.1AAA and is not greater than 10AAA, step S143 is performed: judging whether the dynamic queue can store tx6:
because the dynamic queue can not store tx6 and no transaction with a handling fee lower than 5.1AAA exists in the dynamic queue, discarding tx6;
the blockchain node performs step S16 to preferentially pull transactions from the static and dynamic queues to generate blocks.
It should be noted that, the transaction whose commission fee is greater than the threshold value is added to the static queue, and the addition means that the transaction is queued in order of time when the transaction is received once it enters the static queue.
The foregoing embodiments illustrate the transaction queuing method provided by the present invention in detail, and in more embodiments, the threshold is not limited to the foregoing examples, and may be configured to other values according to actual needs, so long as the threshold is far greater than the common commission, and the same technical effect can be achieved.
In further embodiments, whether the static queue can store the first transaction may be configured in other ways, such as, for example, as follows: the same technical effect can be achieved by judging whether the storable transaction number of the static queue is greater than one.
In more embodiments, the queuing rules may be further configured according to actual requirements, for example, configured to queue according to a sequence from small to large of the first data, where the first data is a ratio of the first recurring fee to the transaction size of the first transaction, so that the same technical effect can be achieved.
In more embodiments, the transaction pulling rule may be configured according to actual requirements, for example, when the number of transactions in the static queue is greater than X, pull X transactions from the static queue, and pull several transactions from the dynamic queue to generate a block, which may achieve the same technical effect.
The embodiment reduces uncertainty of transaction packaging on the basis of supporting dynamic adjustment of commission.
Preferably, the first transaction is stored in the dynamic queue according to the queuing rules when the static queue is unable to store the first transaction.
Preferably, the first transaction is discarded when the static queue is unable to store the first transaction.
Preferably, when the static queue cannot store the first transaction, adding the first transaction to the deterministic queue outside the transaction pool, and pulling a plurality of transactions from the static queue and the dynamic queue according to a pre-configured transaction pulling rule to generate a block comprises:
pulling a plurality of transactions from a static queue and a dynamic queue according to a pre-configured transaction pulling rule to generate a block;
several transactions in the deterministic queue are moved into a static queue.
Specifically, assuming that the first residual capacity is 100k, the deterministic queue is empty, and the blockchain node receives tx10 with a handling fee of 10.1AAA and a size of 150 k;
the blockchain node executes step S12 to receive tx10;
the blockchain node executes step S141 to determine whether the handling fee of tx10 is greater than 10AAA:
since the handling fee of tx10 is 10.1AAA, which is greater than 10AAA, tx10 is appended to the deterministic queue;
step S16 is executed by the block chain node, and a plurality of transactions are preferentially pulled from the static queue and the dynamic queue to generate a block;
move tx10 into the static queue;
if the blockchain node receives the transaction with the commission fee larger than the threshold value, the transaction should be added to the tx10 of the static queue;
the first transaction is added to the deterministic queue outside the transaction pool, and the addition means that the transaction is queued in order of time of receiving the transaction once the transaction enters the deterministic queue.
Preferably, determining whether the static queue can store the first transaction comprises:
it is determined whether the first remaining capacity of the static queue is not less than a first capacity required to store the first transaction.
Preferably, determining whether the static queue can store the first transaction comprises:
it is determined whether the number of storable transactions in the static queue is greater than one.
Preferably, the queuing rule is queuing in order of from big to small according to the commission fee, and storing the first transaction into the dynamic queue according to the preconfigured queuing rule includes:
determining whether the dynamic queue can store the first transaction:
if yes, storing the first transaction into a dynamic queue;
if not, judging whether a second transaction with the commission lower than the first commission exists:
if yes, deleting the second transaction from the dynamic queue, and storing the first transaction into the dynamic queue;
if not, the first transaction is discarded.
Preferably, the transaction pulling rules are to preferentially pull transactions in a static queue.
Fig. 2 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 2, as another aspect, the present application also provides an apparatus 200 including one or more Central Processing Units (CPUs) 201, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 202 or a program loaded from a storage portion 208 into a Random Access Memory (RAM) 203. In the RAM203, various programs and data required for the operation of the apparatus 200 are also stored. The CPU201, ROM202, and RAM203 are connected to each other through a bus 204. An input/output (I/O) interface 205 is also connected to bus 204.
The following components are connected to the I/O interface 205: an input section 206 including a keyboard, a mouse, and the like; an output portion 207 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage section 208 including a hard disk or the like; and a communication section 209 including a network interface card such as a LAN card, a modem, and the like. The communication section 209 performs communication processing via a network such as the internet. The drive 210 is also connected to the I/O interface 205 as needed. A removable medium 211 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed on the drive 210 as needed, so that a computer program read out therefrom is installed into the storage section 208 as needed.
In particular, according to embodiments of the present disclosure, the transaction queuing method described in any of the embodiments above 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 queuing method. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 209, and/or installed from the removable medium 211.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be a computer-readable storage medium contained in the apparatus of the above-described embodiment; or may be a computer-readable storage medium, alone, that is not assembled into a device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the transaction queuing methods described herein.
The flowcharts 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 may be implemented by hardware. The described units or modules may also be provided in a processor, for example, each of the units may be a software program provided in a computer or a mobile smart device, or may be separately configured hardware devices. Wherein the names of the units or modules do not in some cases constitute a limitation of the units or modules themselves.
The foregoing description is only of the preferred embodiments of the present application and is presented as a description of the principles of the technology being utilized. It will be appreciated by persons skilled in the art that the scope of the invention referred to in this application is not limited to the specific combinations of features described above, but also covers other embodiments which may be formed by any combination of features described above or their equivalents without departing from the spirit of the application. Such as the above-described features and technical features having similar functions (but not limited to) disclosed in the present application are replaced with each other.
Claims (10)
1. A transaction queuing method, wherein a static queue and a dynamic queue are configured in a transaction pool, the method being applicable to a blockchain node, the method comprising:
receiving a first transaction;
determining whether a first renewal of the first transaction is greater than a pre-configured threshold:
greater than the threshold, determining whether the static queue can store the first transaction:
storable, then appending the first transaction to the static queue;
if the first transaction is not greater than the threshold value, storing the first transaction into the dynamic queue according to a preset queuing rule;
and pulling a plurality of transactions from the static queue and the dynamic queue according to a pre-configured transaction pulling rule to generate a block.
2. The method of claim 1, wherein the first transaction is stored in the dynamic queue according to the queuing rules when the static queue is unable to store the first transaction.
3. The method of claim 1, wherein the first transaction is discarded when the static queue is unable to store the first transaction.
4. The method of claim 1, wherein appending the first transaction to a deterministic queue outside a transaction pool when the static queue is unable to store the first transaction, the pulling transactions from the static queue and the dynamic queue according to pre-configured transaction pulling rules to generate chunks comprises:
pulling a plurality of transactions from the static queue and the dynamic queue according to a pre-configured transaction pulling rule to generate a block;
a number of transactions in the deterministic queue are moved into the static queue.
5. The method of claim 1, wherein the determining whether the static queue can store the first transaction comprises:
and judging whether the first residual capacity of the static queue is not smaller than the first capacity required for storing the first transaction.
6. The method of claim 1, wherein the determining whether the static queue can store the first transaction comprises:
and judging whether the storable transaction quantity of the static queue is more than one.
7. The method of claim 1, wherein the queuing discipline is queuing in order of increasing commission fees, wherein the storing the first transaction in the dynamic queue according to the pre-configured queuing discipline comprises:
determining whether the dynamic queue can store the first transaction:
if yes, storing the first transaction into the dynamic queue;
if not, judging whether a second transaction with the commission lower than the first commission exists:
if yes, deleting the second transaction from the dynamic queue, and storing the first transaction into the dynamic queue;
and if not, discarding the first transaction.
8. The method of any of claims 1-7, wherein the transaction pulling rule is to preferentially pull transactions in the static queue.
9. An apparatus, 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 of any of claims 1-8.
10. A storage medium storing a computer program, which when executed by a processor implements the method of any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010225738.3A CN111415259B (en) | 2020-03-26 | 2020-03-26 | Transaction queuing method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010225738.3A CN111415259B (en) | 2020-03-26 | 2020-03-26 | Transaction queuing method, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111415259A CN111415259A (en) | 2020-07-14 |
| CN111415259B true CN111415259B (en) | 2024-02-06 |
Family
ID=71494570
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010225738.3A Active CN111415259B (en) | 2020-03-26 | 2020-03-26 | Transaction queuing method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111415259B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115271746B (en) * | 2022-09-27 | 2023-01-31 | 江苏荣泽信息科技股份有限公司 | Block chain transaction sequencing method with priority |
| CN115604354B (en) * | 2022-12-09 | 2023-03-28 | 北京百度网讯科技有限公司 | Transaction processing method, device and equipment based on block chain and storage medium |
Citations (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2249554A1 (en) * | 1997-10-10 | 1999-04-10 | General Instrument Corporation | Secure processor with external memory using block chaining and block re-ordering |
| CN106886890A (en) * | 2017-02-07 | 2017-06-23 | 杭州秘猿科技有限公司 | A kind of timing transaction execution method based on block chain |
| CN107592966A (en) * | 2015-05-13 | 2018-01-16 | 思科技术公司 | To the dynamic protection of shared memory used in the output queue in the network equipment |
| CN107742352A (en) * | 2017-09-20 | 2018-02-27 | 黄玉宇 | Decentralization lot/queuing strategy and system based on block chain and intelligent contract |
| CN107809480A (en) * | 2017-10-25 | 2018-03-16 | 上海瀚银信息技术有限公司 | One kind transaction commutation system |
| CN107819696A (en) * | 2017-11-22 | 2018-03-20 | 中国银行股份有限公司 | A kind of transaction flow control method and system |
| CN108288156A (en) * | 2018-01-04 | 2018-07-17 | 杭州复杂美科技有限公司 | A kind of storage of block chain transaction and queuing strategy |
| CN108846745A (en) * | 2018-04-19 | 2018-11-20 | 深圳市网心科技有限公司 | Block chain trading processing auxiliary system, block chain data processing system and method |
| CN108876521A (en) * | 2018-06-04 | 2018-11-23 | 贵州数据宝网络科技有限公司 | A kind of high concurrent data transacting system and method |
| CN109450659A (en) * | 2018-12-25 | 2019-03-08 | 杭州复杂美科技有限公司 | Block delayed broadcast method, equipment and storage medium |
| CN109669789A (en) * | 2018-12-10 | 2019-04-23 | 杭州复杂美科技有限公司 | Transaction queuing strategy, trading pit storage method, equipment and storage medium |
| CN109995666A (en) * | 2019-04-12 | 2019-07-09 | 深圳市元征科技股份有限公司 | A kind of method for message transmission and relevant apparatus |
| CN110163609A (en) * | 2019-05-28 | 2019-08-23 | 深圳前海微众银行股份有限公司 | Data processing method and device in a kind of block chain |
| CN110445755A (en) * | 2019-07-04 | 2019-11-12 | 杭州复杂美科技有限公司 | Hand over pregnable defence method, equipment and storage medium |
| CN110457342A (en) * | 2019-07-02 | 2019-11-15 | 网联清算有限公司 | Transaction processing method and device |
| CN110659988A (en) * | 2019-09-10 | 2020-01-07 | 杭州秘猿科技有限公司 | Parallel processing method and device for block chain consensus and execution and electronic equipment |
| CN110738497A (en) * | 2019-12-19 | 2020-01-31 | 腾讯科技（深圳）有限公司 | data processing method, device, node equipment and storage medium |
| CN110838065A (en) * | 2019-10-24 | 2020-02-25 | 腾讯云计算（北京）有限责任公司 | Transaction data processing method and device |
| CN110992009A (en) * | 2019-12-04 | 2020-04-10 | 杭州复杂美科技有限公司 | Delayed transaction advanced processing method, device and storage medium |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7028116B2 (en) * | 2001-02-08 | 2006-04-11 | Hewlett-Packard Development Company, L.P. | Enhancement of transaction order queue |
| US20070283131A1 (en) * | 2006-01-30 | 2007-12-06 | Ati Technologies Inc. | Processing of high priority data elements in systems comprising a host processor and a co-processor |
| CN107040585B (en) * | 2017-02-22 | 2020-06-19 | 创新先进技术有限公司 | Service checking method and device |
| CN107391526B (en) * | 2017-03-28 | 2021-04-02 | 创新先进技术有限公司 | Data processing method and device based on block chain |
| WO2019056006A1 (en) * | 2017-09-18 | 2019-03-21 | James Leftwich | Method for producing a dynamically ordered queue |
| US11379824B2 (en) * | 2018-06-20 | 2022-07-05 | International Business Machines Corporation | Privacy preserving transactions with probabilistic transaction fees |
| US11489662B2 (en) * | 2018-08-30 | 2022-11-01 | International Business Machines Corporation | Special relationships in a blockchain |
-
2020
- 2020-03-26 CN CN202010225738.3A patent/CN111415259B/en active Active
Patent Citations (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2249554A1 (en) * | 1997-10-10 | 1999-04-10 | General Instrument Corporation | Secure processor with external memory using block chaining and block re-ordering |
| CN107592966A (en) * | 2015-05-13 | 2018-01-16 | 思科技术公司 | To the dynamic protection of shared memory used in the output queue in the network equipment |
| CN106886890A (en) * | 2017-02-07 | 2017-06-23 | 杭州秘猿科技有限公司 | A kind of timing transaction execution method based on block chain |
| CN107742352A (en) * | 2017-09-20 | 2018-02-27 | 黄玉宇 | Decentralization lot/queuing strategy and system based on block chain and intelligent contract |
| CN107809480A (en) * | 2017-10-25 | 2018-03-16 | 上海瀚银信息技术有限公司 | One kind transaction commutation system |
| CN107819696A (en) * | 2017-11-22 | 2018-03-20 | 中国银行股份有限公司 | A kind of transaction flow control method and system |
| CN108288156A (en) * | 2018-01-04 | 2018-07-17 | 杭州复杂美科技有限公司 | A kind of storage of block chain transaction and queuing strategy |
| CN108846745A (en) * | 2018-04-19 | 2018-11-20 | 深圳市网心科技有限公司 | Block chain trading processing auxiliary system, block chain data processing system and method |
| CN108876521A (en) * | 2018-06-04 | 2018-11-23 | 贵州数据宝网络科技有限公司 | A kind of high concurrent data transacting system and method |
| CN109669789A (en) * | 2018-12-10 | 2019-04-23 | 杭州复杂美科技有限公司 | Transaction queuing strategy, trading pit storage method, equipment and storage medium |
| CN109450659A (en) * | 2018-12-25 | 2019-03-08 | 杭州复杂美科技有限公司 | Block delayed broadcast method, equipment and storage medium |
| CN109995666A (en) * | 2019-04-12 | 2019-07-09 | 深圳市元征科技股份有限公司 | A kind of method for message transmission and relevant apparatus |
| CN110163609A (en) * | 2019-05-28 | 2019-08-23 | 深圳前海微众银行股份有限公司 | Data processing method and device in a kind of block chain |
| CN110457342A (en) * | 2019-07-02 | 2019-11-15 | 网联清算有限公司 | Transaction processing method and device |
| CN110445755A (en) * | 2019-07-04 | 2019-11-12 | 杭州复杂美科技有限公司 | Hand over pregnable defence method, equipment and storage medium |
| CN110659988A (en) * | 2019-09-10 | 2020-01-07 | 杭州秘猿科技有限公司 | Parallel processing method and device for block chain consensus and execution and electronic equipment |
| CN110838065A (en) * | 2019-10-24 | 2020-02-25 | 腾讯云计算（北京）有限责任公司 | Transaction data processing method and device |
| CN110992009A (en) * | 2019-12-04 | 2020-04-10 | 杭州复杂美科技有限公司 | Delayed transaction advanced processing method, device and storage medium |
| CN110738497A (en) * | 2019-12-19 | 2020-01-31 | 腾讯科技（深圳）有限公司 | data processing method, device, node equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111415259A (en) | 2020-07-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111415259B (en) | Transaction queuing method, device and storage medium | |
| CN111221638B (en) | Concurrent task scheduling processing method, device, equipment and medium | |
| CN110135925B (en) | Order processing system, method and device | |
| CN111324449A (en) | Transaction storage and broadcasting method, device and storage medium of memory pool | |
| CN111858773B (en) | Transaction packaging method, device and storage medium | |
| CN112379982B (en) | Task processing method, device, electronic equipment and computer readable storage medium | |
| CN114385353A (en) | Resource scheduling method and device, electronic equipment and storage medium | |
| CN110928905B (en) | Data processing method and device | |
| CN111026552B (en) | Resource scheduling method and device, electronic equipment and computer readable storage medium | |
| CN114911598A (en) | Task scheduling method, device, equipment and storage medium | |
| CN112600905B (en) | Transaction broadcasting and block generating method, apparatus and storage medium | |
| US10250515B2 (en) | Method and device for forwarding data messages | |
| CN111405037A (en) | Block synchronization method, device and storage medium | |
| CN113535420A (en) | Message processing method and device | |
| CN116069518A (en) | Dynamic allocation processing task method and device, electronic equipment and readable storage medium | |
| CN114493875A (en) | Transaction execution method, computer device, and storage medium | |
| CN113127561B (en) | Method and device for generating service single number, electronic equipment and storage medium | |
| CN109905443B (en) | Data processing method, system, electronic device and computer readable medium | |
| CN111639939A (en) | Block restoring method, equipment and storage medium | |
| CN111711971A (en) | Data transmission method and device, storage medium and electronic equipment | |
| CN115604354B (en) | Transaction processing method, device and equipment based on block chain and storage medium | |
| CN109831484B (en) | Election method, device, medium and electronic equipment for APP (application) sharing pushing SDK (software development kit) service | |
| CN113259261B (en) | Network flow control method and electronic equipment | |
| US10303437B2 (en) | Synchronizing multi-threaded servicing of a server event buffer | |
| CN112804322B (en) | Block generation method, computer device 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240516 Address after: 361000 No. 728, Yangming Road, Haicang District, Xiamen City, Fujian Province Patentee after: Zhuo Mimi Country or region after: China Address before: 310000 Room 702, 7th Floor, Building 6, East Software Park, No. 90 Wensan Road, Xihu District, Hangzhou City, Zhejiang Province Patentee before: HANGZHOU FUZAMEI TECHNOLOGY Co.,Ltd. Country or region before: China |