WO2022007345A1 - 区块并行处理方法、设备和存储介质 - Google Patents

区块并行处理方法、设备和存储介质 Download PDF

Info

Publication number
WO2022007345A1
WO2022007345A1 PCT/CN2020/138874 CN2020138874W WO2022007345A1 WO 2022007345 A1 WO2022007345 A1 WO 2022007345A1 CN 2020138874 W CN2020138874 W CN 2020138874W WO 2022007345 A1 WO2022007345 A1 WO 2022007345A1
Authority
WO
WIPO (PCT)
Prior art keywords
container
block
transaction
transactions
consensus
Prior art date
Application number
PCT/CN2020/138874
Other languages
English (en)
French (fr)
Inventor
刘业章
王志文
吴思进
Original Assignee
江苏复杂美科技有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 江苏复杂美科技有限公司 filed Critical 江苏复杂美科技有限公司
Publication of WO2022007345A1 publication Critical patent/WO2022007345A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023—Free address space management
    • 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

Definitions

  • the present application relates to the field of Internet technologies, and in particular, to a block parallel processing method, device and storage medium.
  • the currently disclosed blockchain parallel execution solutions usually classify or group multiple transactions that have been packaged into a block, and then execute them in parallel.
  • the disadvantage of the above solution is that it can only improve the efficiency of transaction execution, but cannot improve the efficiency of block generation.
  • the present invention provides a method for parallel processing of blocks.
  • the memory pool of a blockchain node is configured with a first number of containers, and each container records and maintains addresses related to each transaction in the current container.
  • the method includes: :
  • 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 various functions according to the present invention.
  • the block parallel processing method provided by the embodiment.
  • the present invention further provides a storage medium storing a computer program, and the computer program enables a computer to execute the block parallel processing method provided according to each embodiment of the present invention.
  • the block parallel processing method, device, and storage medium configured by various embodiments of the present invention configure a container that classifies transactions by address in the memory pool of a blockchain node, and executes packaging blocks, executing transactions, and aligning blocks in parallel with the container as a unit.
  • Block consensus and finally determine the global block height of the block that has passed the consensus, realizes the multi-link parallel processing of block packaging, execution and consensus, thereby improving system efficiency.
  • FIG. 1 is a flowchart of a block parallel processing method according to an embodiment of the present invention.
  • FIG. 2 is a schematic diagram of a block parallel processing mechanism of the present application.
  • FIG. 3 is a schematic structural diagram of a device according to an embodiment of the present invention.
  • FIG. 1 is a flowchart of a block parallel processing method according to an embodiment of the present invention.
  • FIG. 2 is a schematic diagram of a block parallel processing mechanism of the present application.
  • the present invention provides a block parallel processing method.
  • the memory pool of the blockchain node is configured with a first number of containers, and each container records and maintains the current container respectively.
  • Each address related to each transaction in the internal transaction the method includes:
  • S11 Determine whether the relevant address of the first transaction to be stored in the memory pool is recorded in the first container:
  • step S12 deposit the first transaction into the first container
  • step S13 deposit the first transaction into the second container with the smallest number of transactions in the current container;
  • S15 Determine the global block height of each block that has passed the consensus.
  • the judgment result is that the two related addresses of the first transaction are recorded in the third container and the fourth container, respectively, all transactions in the fourth container are moved to the third container, and the first transaction is stored in the third container.
  • the method shown in FIG. 1 is exemplarily described below by taking the first number as 10 as an example.
  • step S11 when the blockchain node receives a transaction tx1, and passes the legality check of tx1 (for example, duplication check, etc.), when tx1 needs to be stored in the memory pool, the relevant address of tx1 is parsed, and tx1 is determined. Whether the relevant address has been recorded in a container.
  • tx1 for example, duplication check, etc.
  • the relevant address of tx1 only includes the sending address addr1 of tx1.
  • the judgment result is that addr1 is recorded in container 3
  • step S13 is executed, and tx1 is stored in container 7 with the smallest number of transactions in the current 10 containers.
  • tx1 When the blockchain supports the transfer function, if tx1 is a non-transfer transaction, the relevant address of tx1 also only includes the sending address addr1 of tx1, and the processing process will not be repeated;
  • tx1 is a transfer transaction
  • the relevant addresses of tx1 include the sending address addr1 and the address addr2 of the transfer object. At this time, there are:
  • step S14 the transactions in each container are processed in parallel by 10 threads, and each thread packs the transactions in the container into blocks, executes the transactions in the blocks, and reaches consensus on the blocks.
  • the process of packaging blocks, executing transactions, and reaching consensus on the blocks in the chain system is basically the same. The difference is that: on the one hand, the blocks generated in step S14 do not have the global block height of the current blockchain; on the other hand, when executing transactions , it is necessary to call and modify the global data, that is, 10 threads share the same blockchain database when executing transactions (since the addresses of each transaction of each block executed in parallel are not related, it will not cause problems such as waiting or deadlock, you can parallel processing) instead of 10 separate databases.
  • step S15 for several blocks that are generated in parallel in step S14 and pass the consensus, the global block height of each block is determined in the order of the time stamp of each block.
  • the global block height of the current blockchain is 231.
  • 4 blocks block1, block2, block3, and block4 that have passed the consensus are generated in parallel.
  • the timestamps are sorted as block2, block3, block1, block4, then the global block height of block2 is 232, the global block height of block3 is 233, the global block height of block1 is 234, and the global block height of block4 is 235.
  • the timestamps of two blocks are the same, they can be sorted in the order of the container number.
  • each container corresponds to a virtual chain
  • the first block includes the virtual chain ID of the corresponding virtual chain and the virtual chain height of the current block.
  • the container by configuring a container that classifies transactions by address in the memory pool of the blockchain node, the container is used as a unit to execute the packaging block, execute the transaction, and agree on the block in parallel, and finally determine the global area of the block that has passed the consensus.
  • the block height realizes multi-link parallel processing of block packaging, execution and consensus, thereby improving system efficiency.
  • FIG. 3 is a schematic structural diagram of a device according to an embodiment of the present invention.
  • the present application also provides a device 300 including one or more central processing units (CPUs) 301 , which can operate according to a program stored in a read only memory (ROM) 302 or Various appropriate actions and processes are executed from the program loaded into the random access memory (RAM) 303 from the storage section 308 .
  • ROM read only memory
  • RAM random access memory
  • various programs and data necessary for the operation of the device 300 are also stored.
  • the CPU 301 , the ROM 302 , and the RAM 303 are connected to each other through a bus 304 .
  • An input/output (I/O) interface 305 is also connected to bus 304 .
  • the following components are connected to the I/O interface 305: an input section 306 including a keyboard, a mouse, etc.; an output section 307 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 308 including a hard disk, etc. ; and a communication section 309 including a network interface card such as a LAN card, a modem, and the like. The communication section 309 performs communication processing via a network such as the Internet.
  • a drive 310 is also connected to the I/O interface 305 as needed.
  • a removable medium 311, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is mounted on the drive 310 as needed so that a computer program read therefrom is installed into the storage section 308 as needed.
  • the method described in any of the above embodiments may be implemented as a computer software program.
  • embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program containing program code for performing any of the methods described above.
  • the computer program may be downloaded and installed from the network via the communication portion 309 and/or installed from the removable medium 311 .
  • the present application also provides a computer-readable storage medium.
  • the computer-readable storage medium may be a computer-readable storage medium included in the apparatus of the foregoing embodiment; A computer-readable storage medium in a device.
  • the computer-readable storage medium stores one or more programs that are used by one or more processors to perform the methods described in the present application.
  • each block in the flowchart or block diagrams may represent a module, segment, or portion of code that contains one or more logical functions for implementing the specified functions executable instructions.
  • the functions noted in the blocks 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.
  • each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations can be implemented by dedicated hardware-based systems that perform the specified functions or operations , or can be implemented by a combination of dedicated hardware and computer instructions.
  • the units or modules involved in the embodiments of the present application may be implemented in a software manner, and may also be implemented in a hardware manner.
  • the described units or modules may also be provided in the processor, for example, each unit may be a software program provided in a computer or a mobile smart device, or may be a separately configured hardware device. Wherein, the names of these units or modules do not constitute limitations on the units or modules themselves under certain circumstances.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Accounting & Taxation (AREA)
  • General Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Finance (AREA)
  • Computing Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Technology Law (AREA)
  • General Business, Economics & Management (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

本发明提供一种区块并行处理方法、设备和存储介质，该方法包括：判断待存入内存池的第一交易的相关地址是否记录在第一容器中：是，则将第一交易存入第一容器；否，则将第一交易存入当前容器内交易数量最少的第二容器；对各容器并行执行以下步骤：串行打包当前容器中的交易以生成第一区块，执行第一区块，对第一区块进行共识；确定通过共识的各区块的全局区块高度。本发明实现了在区块的打包、执行和共识的多环节并行处理，提升了系统效率。

Description

区块并行处理方法、设备和存储介质 技术领域
本申请涉及互联网技术领域，具体涉及一种区块并行处理方法、设备和存储介质。
背景技术
当前已公开的区块链并行执行方案通常都是对已经打包到一个区块中的多笔交易进行分类或分组，再进行并行执行。
上述方案的缺陷在于，只能提升交易执行环节的效率，无法提升出块效率。
发明内容
鉴于现有技术中的上述缺陷或不足，期望提供一种在打包区块、执行交易、共识各环节均提升系统效率的区块并行处理方法、设备和存储介质。
第一方面，本发明提供一种区块并行处理方法，区块链节点的内存池配置有第一数量个容器，每个容器分别记录并维护当前容器内各交易相关的各地址，该方法包括：
判断待存入内存池的第一交易的相关地址是否记录在第一容器中：
是，则将第一交易存入第一容器；
否，则将第一交易存入当前容器内交易数量最少的第二容器；
对各容器并行执行以下步骤：
串行打包当前容器中的交易以生成第一区块，执行第一区块，对第一区块进行共识；
确定通过共识的各区块的全局区块高度。
第二方面，本发明还提供一种设备，包括一个或多个处理器和存储器，其中存储器包含可由该一个或多个处理器执行的指令以使得该一个或多个处理器执行根据本发明各实施例提供的区块并行处理方法。
第三方面，本发明还提供一种存储有计算机程序的存储介质，该计算机程序使计算机执行根据本发明各实施例提供的区块并行处理方法。
本发明诸多实施例提供的区块并行处理方法、设备和存储介质通过在区块链节点的内存池配置对交易按地址分类的容器，以容器为单位并行执行打包区块、执行交易、对区块共识，最后再确定通过共识的区块的全局区块高度，实现了在区块的打包、执行和共识的多环节并行处理，从而实现了提升系统效率。
附图说明
通过阅读参照以下附图所作的对非限制性实施例所作的详细描述，本申请的其它特征、目的和优点将会变得更明显：
图1为本发明一实施例提供的一种区块并行处理方法的流程图。
图2为本申请的区块并行处理机制示意图。
图3为本发明一实施例提供的一种设备的结构示意图。
具体实施方式
下面结合附图和实施例对本申请作进一步的详细说明。可以理解的是，此处所描述的具体实施例仅仅用于解释相关发明，而非对该发明的限定。另外还需要说明的是，为了便于描述，附图中仅示出了与发明相关的部分。
需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。下面将参考附图并结合实施例来详细说明本申请。
图1为本发明一实施例提供的一种区块并行处理方法的流程图。图2为本申请的区块并行处理机制示意图。
如图1和图2所示，在本实施例中，本发明提供一种区块并行处理方法，区块链节点的内存池配置有第一数量个容器，每个容器分别记录并维护当前容器内各交易相关的各地址，该方法包括：
S11：判断待存入内存池的第一交易的相关地址是否记录在第一容器中：
是，则执行步骤S12：将第一交易存入第一容器；
否，则执行步骤S13：将第一交易存入当前容器内交易数量最少的第二容器；
S14：对各容器并行执行以下步骤：
串行打包当前容器中的交易以生成第一区块，执行第一区块，对第一区块进行共识；
S15：确定通过共识的各区块的全局区块高度。
优选地，当判断结果为第一交易的两个相关地址分别记录在第三容器和第四容器中时，将第四容器的所有交易移至第三容器中，并将第一交易存入第三容器。
以下以第一数量为10为例，对图1所示的方法进行示例性的阐述。
在步骤S11中，当区块链节点收到一笔交易tx1，并且通过tx1的合法性检查(例如查重等)，需要将tx1存入内存池时，解析tx1的相关地址，并判断tx1的相关地址是否已记录在某一容器中。
具体地，当该区块链为不支持转账功能的功能性区块链时，tx1的相关地址仅包括tx1的发送地址addr1，此时，当判断结果为容器3记录有addr1时，则执行步骤S12，将tx1存入容器3；当判断结果为addr1未记录在任一容器中时，则执行步骤S13，将tx1存入当前10个容器中容器内交易数量最少的容器7。
当该区块链支持转账功能时，若tx1为非转账交易，则tx1的相关地址同样仅包括tx1的发送地址addr1，处理过程不再赘述；
若tx1为转账交易，则tx1的相关地址包括发送地址addr1和转账对象的地址addr2，此时有：
当判断结果为addr1和addr2同时记录在容器3中，或，addr1记录在容器3中、addr2未记录在任一容器中，或，addr2记录在容器 3中、addr1未记录在任一容器中时，将tx1存入容器3；
当判断结果为addr1和addr2均未记录在任一容器中时，将tx1存入当前10个容器中容器内交易数量最少的容器7；
当判断结果为addr1记录在容器4中、addr2记录在容器5中时，将容器5中的所有交易移至容器4中(可以将此时存有交易数量少的容器中的交易移至此时存有交易数量多的容器，也可以将编号靠后的容器中的交易移至编号靠前的容器中，等，只要每个区块链节点所配置的规则相同即可)，并将tx1存入容器4。
在步骤S14中，通过10个线程并行处理每个容器中的交易，每个线程将容器中的交易打包成区块、执行区块中的交易、对区块进行共识的过程与现有区块链系统打包区块、执行交易、对区块进行共识的过程基本相同，区别在于：一方面，步骤S14生成的区块不具有当前区块链的全局区块高度；另一方面，执行交易时，需要调用和修改全局数据，即，10个线程在执行交易时共用同一区块链数据库(由于并行执行的各区块的各交易的地址各不相关，不会导致等待或死锁等问题，可以并行处理)，而非10个各自独立的数据库。
在步骤S15中，对于步骤S14并行生成并通过共识的若干个区块，以各区块的时间戳为序，确定各区块的全局区块高度。例如，当前区块链的全局区块高度为231，基于容器4、容器8、容器9、容器10并行生成了4个通过共识的区块block1、block2、block3、block4，以该4个区块的时间戳为序排序为block2、block3、block1、block4，则block2的全局区块高度为232、block3的全局区块高度为233、block1的全局区块高度为234、block4的全局区块高度为235。特殊地，当两个区块的时间戳相同时，可以再按容器的编号为序进行排序。
优选地，每个容器对应于一条虚拟链，第一区块包括所对应的虚拟链的虚拟链ID，以及，当前区块的虚拟链高度。
上述实施例通过在区块链节点的内存池配置对交易按地址分类的容器，以容器为单位并行执行打包区块、执行交易、对区块共识，最后再确定通过共识的区块的全局区块高度，实现了在区块的打包、执行和共识的多环节并行处理，从而实现了提升系统效率。
图3为本发明一实施例提供的一种设备的结构示意图。
如图3所示，作为另一方面，本申请还提供了一种设备300，包括一个或多个中央处理单元(CPU)301，其可以根据存储在只读存储器(ROM)302中的程序或者从存储部分308加载到随机访问存储器(RAM)303中的程序而执行各种适当的动作和处理。在RAM303中，还存储有设备300操作所需的各种程序和数据。CPU301、ROM302以及RAM303通过总线304彼此相连。输入/输出(I/O)接口305也连接至总线304。
以下部件连接至I/O接口305：包括键盘、鼠标等的输入部分306；包括诸如阴极射线管(CRT)、液晶显示器(LCD)等以及扬声器等的输出部分307；包括硬盘等的存储部分308；以及包括诸如LAN卡、调制解调器等的网络接口卡的通信部分309。通信部分309经由诸如因特网的网络执行通信处理。驱动器310也根据需要连接至I/O接口305。可拆卸介质311，诸如磁盘、光盘、磁光盘、半导体存储器等等，根据需要安装在驱动器310上，以便于从其上读出的计算机程序根据需要被安装入存储部分308。
特别地，根据本公开的实施例，上述任一实施例描述的方法可以被实现为计算机软件程序。例如，本公开的实施例包括一种计算机程序产品，其包括有形地包含在机器可读介质上的计算机程序，计算机程序包含用于执行上述任一方法的程序代码。在这样的实施例中，该计算机程序可以通过通信部分309从网络上被下载和安装，和/或从可拆卸介质311被安装。
作为又一方面，本申请还提供了一种计算机可读存储介质，该计算机可读存储介质可以是上述实施例的装置中所包含的计算机可读存储介质；也可以是单独存在，未装配入设备中的计算机可读存储介质。计算机可读存储介质存储有一个或者一个以上程序，该程序被一个或者一个以上的处理器用来执行描述于本申请提供的方法。
附图中的流程图和框图，图示了按照本发明各种实施例的系统、方法和计算机程序产品的可能实现的体系架构、功能和操作。在这点上，流程图或框图中的每个方框可以代表一个模块、程序段、或代码 的一部分，该模块、程序段、或代码的一部分包含一个或多个用于实现规定的逻辑功能的可执行指令。也应当注意，在有些作为替换的实现中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，两个接连地表示的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这根据所涉及的功能而定。也要注意的是，框图和/或流程图中的每个方框、以及框图和/或流程图中的方框的组合，可以通过执行规定的功能或操作的专用的基于硬件的系统来实现，或者可以通过专用硬件与计算机指令的组合来实现。
描述于本申请实施例中所涉及到的单元或模块可以通过软件的方式实现，也可以通过硬件的方式来实现。所描述的单元或模块也可以设置在处理器中，例如，各单元可以是设置在计算机或移动智能设备中的软件程序，也可以是单独配置的硬件装置。其中，这些单元或模块的名称在某种情况下并不构成对该单元或模块本身的限定。
以上描述仅为本申请的较佳实施例以及对所运用技术原理的说明。本领域技术人员应当理解，本申请中所涉及的发明范围，并不限于上述技术特征的特定组合而成的技术方案，同时也应涵盖在不脱离本申请构思的情况下，由上述技术特征或其等同特征进行任意组合而形成的其它技术方案。例如上述特征与本申请中公开的(但不限于)具有类似功能的技术特征进行互相替换而形成的技术方案。

Claims (5)

  1. 一种区块并行处理方法，其特征在于，区块链节点的内存池配置有第一数量个容器，每个容器分别记录并维护当前容器内各交易相关的各地址，所述方法包括：
    判断待存入内存池的第一交易的相关地址是否记录在第一容器中：
    是，则将所述第一交易存入所述第一容器；
    否，则将所述第一交易存入当前容器内交易数量最少的第二容器；
    对各所述容器并行执行以下步骤：
    串行打包当前容器中的交易以生成第一区块，执行所述第一区块，对所述第一区块进行共识；
    确定通过共识的各区块的全局区块高度。
  2. 根据权利要求1所述的方法，其特征在于，还包括：
    当判断结果为所述第一交易的两个相关地址分别记录在第三容器和第四容器中时，将所述第四容器的所有交易移至所述第三容器中，并将所述第一交易存入所述第三容器。
  3. 根据权利要求1所述的方法，其特征在于，每个所述容器对应于一条虚拟链；
    所述第一区块包括所对应的虚拟链的虚拟链ID，以及，当前区块的虚拟链高度。
  4. 一种设备，其特征在于，所述设备包括：
    一个或多个处理器；
    存储器，用于存储一个或多个程序，
    当所述一个或多个程序被所述一个或多个处理器执行时，使得所述一个或多个处理器执行如权利要求1-3中任一项所述的方法。
  5. 一种存储有计算机程序的存储介质，其特征在于，该程序被处理器执行时实现如权利要求1-3中任一项所述的方法。
PCT/CN2020/138874 2020-07-09 2020-12-24 区块并行处理方法、设备和存储介质 WO2022007345A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010658830.9A CN111797168A (zh) 2020-07-09 2020-07-09 区块并行处理方法、设备和存储介质
CN202010658830.9 2020-07-09

Publications (1)

Publication Number Publication Date
WO2022007345A1 true WO2022007345A1 (zh) 2022-01-13

Family

ID=72810694

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/138874 WO2022007345A1 (zh) 2020-07-09 2020-12-24 区块并行处理方法、设备和存储介质

Country Status (2)

Country Link
CN (1) CN111797168A (zh)
WO (1) WO2022007345A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114884617A (zh) * 2022-05-07 2022-08-09 杭州复杂美科技有限公司 区块传输方法、计算机设备和存储介质
CN114944887A (zh) * 2022-05-07 2022-08-26 杭州复杂美科技有限公司 区块传输方法、计算机设备和存储介质

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111797168A (zh) * 2020-07-09 2020-10-20 杭州复杂美科技有限公司 区块并行处理方法、设备和存储介质
CN112801794B (zh) * 2021-02-08 2022-04-15 网易（杭州）网络有限公司 交易执行方法、装置、电子设备、存储介质
CN114416765B (zh) * 2022-03-28 2022-06-14 北京微芯感知科技有限公司 一种区块链交易无级预测执行方法及系统

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108241968A (zh) * 2017-03-26 2018-07-03 杭州复杂美科技有限公司 前置机参与区块链共识的方法
WO2019117311A1 (ja) * 2017-12-16 2019-06-20 株式会社ｂｉｔＦｌｙｅｒ ブロックチェーン・ネットワークにおいて過去のトランザクションにアクセス可能とするための方法及びノード
CN110019202A (zh) * 2017-10-19 2019-07-16 深圳区块链金融服务有限公司 用于并发处理区块链交易的方法、计算机系统和介质
CN110135985A (zh) * 2019-04-04 2019-08-16 杭州抖音科技有限公司 一种区块链上交易的并行执行方法及系统
CN110659988A (zh) * 2019-09-10 2020-01-07 杭州秘猿科技有限公司 区块链共识与执行的并行处理方法、装置和电子设备
CN111324449A (zh) * 2019-12-13 2020-06-23 杭州复杂美科技有限公司 内存池的交易存储和广播方法、设备和存储介质
CN111797168A (zh) * 2020-07-09 2020-10-20 杭州复杂美科技有限公司 区块并行处理方法、设备和存储介质

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180130034A1 (en) * 2016-11-07 2018-05-10 LedgerDomain, LLC Extended blockchains for event tracking and management
CN110555763A (zh) * 2018-05-30 2019-12-10 上海诺亚投资管理有限公司 基于区块链的金融数据处理方法及装置
CN110489413A (zh) * 2019-07-15 2019-11-22 杭州复杂美科技有限公司 一种交易记录存储、查询方法和系统、设备及存储介质
CN110392052B (zh) * 2019-07-22 2021-05-25 中国工商银行股份有限公司 一种区块链智能合约处理系统及方法

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108241968A (zh) * 2017-03-26 2018-07-03 杭州复杂美科技有限公司 前置机参与区块链共识的方法
CN110019202A (zh) * 2017-10-19 2019-07-16 深圳区块链金融服务有限公司 用于并发处理区块链交易的方法、计算机系统和介质
WO2019117311A1 (ja) * 2017-12-16 2019-06-20 株式会社ｂｉｔＦｌｙｅｒ ブロックチェーン・ネットワークにおいて過去のトランザクションにアクセス可能とするための方法及びノード
CN110135985A (zh) * 2019-04-04 2019-08-16 杭州抖音科技有限公司 一种区块链上交易的并行执行方法及系统
CN110659988A (zh) * 2019-09-10 2020-01-07 杭州秘猿科技有限公司 区块链共识与执行的并行处理方法、装置和电子设备
CN111324449A (zh) * 2019-12-13 2020-06-23 杭州复杂美科技有限公司 内存池的交易存储和广播方法、设备和存储介质
CN111797168A (zh) * 2020-07-09 2020-10-20 杭州复杂美科技有限公司 区块并行处理方法、设备和存储介质

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114884617A (zh) * 2022-05-07 2022-08-09 杭州复杂美科技有限公司 区块传输方法、计算机设备和存储介质
CN114944887A (zh) * 2022-05-07 2022-08-26 杭州复杂美科技有限公司 区块传输方法、计算机设备和存储介质
CN114884617B (zh) * 2022-05-07 2023-12-26 深圳北宸博裕科技有限公司 区块传输方法、计算机设备和存储介质
CN114944887B (zh) * 2022-05-07 2024-01-23 北京差旅天下网络科技有限责任公司 区块传输方法、计算机设备和存储介质

Also Published As

Publication number Publication date
CN111797168A (zh) 2020-10-20

Similar Documents

Publication Publication Date Title
WO2022007345A1 (zh) 区块并行处理方法、设备和存储介质
EP2184680B1 (en) An infrastructure for parallel programming of clusters of machines
EP3889774A1 (en) Heterogeneous computing-based task processing method and software-hardware framework system
CN109726250B (zh) 数据存储系统、元数据库同步及数据跨域计算方法
WO2020082871A1 (zh) 一种并行化执行区块链交易的方法、装置及系统
US10831843B2 (en) Grouping aggregation with filtering aggregation query processing
US7917574B2 (en) Infrastructure for parallel programming of clusters of machines
US20140108861A1 (en) Systems and methods for fault tolerant, adaptive execution of arbitrary queries at low latency
US20130227194A1 (en) Active non-volatile memory post-processing
EP3867774B1 (en) System and method for dependency analysis in a multidimensional database environment
CN110032442A (zh) 采用集成gpu来加速元组空间搜索的架构和机制
US20140368513A1 (en) Software Only Intra-Compute Unit Redundant Multithreading for GPUs
US20100169289A1 (en) Two Phase Commit With Grid Elements
US20200250192A1 (en) Processing queries associated with multiple file formats based on identified partition and data container objects
CN106462386B (zh) 排序分布式输入数据的排序方法和处理系统
US20220138195A1 (en) User defined functions for database query languages based on call-back functions
US9164969B1 (en) Method and system for implementing a stream reader for EDA tools
US9569378B2 (en) Processing element data sharing
US9830369B1 (en) Processor for database analytics processing
GB2556635A (en) Event handling instruction processing
US11836190B2 (en) Method and system for identifying, managing, and monitoring data dependencies
US7792824B2 (en) Apparatus and method for enabling parallel processing of a computer program using existing database parallelism
US8024380B2 (en) Improving data access speed while processing transaction requests from web based applications
CN112965782A (zh) 针对Docker容器的智能监控方法、装置、存储介质及电子设备
Böhm et al. Demaq/Transscale: automated distribution and scalability for declarative applications

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20944241

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20944241

Country of ref document: EP

Kind code of ref document: A1