WO2020135434A1 - 数据存储方法、数据读取方法、设备和存储介质 - Google Patents

数据存储方法、数据读取方法、设备和存储介质 Download PDF

Info

Publication number
WO2020135434A1
WO2020135434A1 PCT/CN2019/127997 CN2019127997W WO2020135434A1 WO 2020135434 A1 WO2020135434 A1 WO 2020135434A1 CN 2019127997 W CN2019127997 W CN 2019127997W WO 2020135434 A1 WO2020135434 A1 WO 2020135434A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
data
mpt
parameter
encoding
Prior art date
Application number
PCT/CN2019/127997
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 WO2020135434A1 publication Critical patent/WO2020135434A1/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/22—Indexing; Data structures therefor; Storage structures

Definitions

  • This application relates to the field of blockchain technology, and in particular to a data storage method, data reading method, device, and storage medium.
  • the Merkle Patricia Tries (MPT) tree is usually used to store the blockchain status data (such as account balance, etc.).
  • RLP is used to encode MPT.
  • RLP does not support complex data structure types, and additional conversion is required.
  • RLP encodes MPT.
  • the read efficiency of the MPT is 15000 ns/op, and the read efficiency is low.
  • the present invention provides a data storage method, including:
  • the present invention provides a data reading method, including:
  • the data is generated by the structure code of various nodes of the Merkel Patricia Tree (MPT) defined by the protocol protocol, the structure includes the first parameter;
  • MPT Merkel Patricia Tree
  • the node type and location information of each node is obtained by parsing the first parameter of each node in the data.
  • the present invention also provides an apparatus, including one or more processors and a memory, where the memory contains instructions executable by the one or more processors to cause the one or more processors to execute each according to the present invention
  • the present invention also provides a storage medium storing a computer program, which causes the computer to execute the data storage method and the data reading method provided according to the embodiments of the present invention.
  • the data storage method, data reading method, device and storage medium provided by many embodiments of the present invention define the structure of various types of nodes of the Merkle Patricia Tree (MPT) in the blockchain through the protocol protocol;
  • the method of encoding the structure and storing the data generated by the encoding in the local database optimizes the data storage mode of MPT and improves the reading efficiency of MPT.
  • MPT Merkle Patricia Tree
  • the data storage method, the data reading method, the device and the storage medium provided by some embodiments of the present invention further include a first parameter through the structure, and the first parameter encodes the node type and position information of the node through a parseable encoding method , Reduce the amount of data stored in the data storage, further improve the efficiency of MPT reading.
  • FIG. 1 is a flowchart of a data storage method according to an embodiment of the present invention.
  • 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 data storage method according to an embodiment of the present invention. As shown in FIG. 1, in this embodiment, the present invention provides a data storage method, including:
  • S12 Define the structure of various nodes of the Merkel Patricia Tree (MPT) in the blockchain through the protocol protocol;
  • nodes take various types of nodes including full nodes and short nodes, define Children[]node and flags for the structure of full node, and define Key, Val and flags for the structure of short node.
  • step S12 the structure of the Merkel Patricia Tree (MPT) node in the blockchain and the structure of the node type of some nodes: full node and short node structure are defined through the protocol protocol;
  • MPT Merkel Patricia Tree
  • the structure of the defined node is as follows:
  • the structure of the defined short node is as follows:
  • step S14 the structure of the node and the structure of full node and short node of some node types are used for encoding, and the data generated by the encoding is stored in the local database.
  • the data storage method provided by the present invention is not limited to the above example, and the structure of nodes and structures of various types of nodes can also be defined according to actual needs.
  • a defined structure such as a hash node can also be defined.
  • the information contained in the volume is not limited to the above example, and can be configured according to actual needs, and all can achieve the same technical effect.
  • the above embodiment optimizes the data storage mode of MPT and improves the efficiency of MPT reading.
  • the structure includes a first parameter, and the first parameter is generated by encoding the node type and position information of the node through a parseable encoding method.
  • the structure includes a first parameter Ty, and the first parameter Ty is defined as follows:
  • the first parameter ty is generated by encoding the node type and position information of the node through a parseable encoding method. Specifically, in the position 5 of the Children[17] node of the full node, there is a short node as an example.
  • the node type is generally defined as one parameter, and the position information is defined as another parameter.
  • the two parameter information is stored in the database, which increases the amount of data stored in the data; read the node type information from the database And location information, will reduce the efficiency of reading.
  • the first parameter can also be defined according to actual needs, and the first parameter can also protect the information of other nodes, and the same technical effect can be achieved.
  • the above embodiment reduces the amount of data stored in the data and further improves the efficiency of MPT reading.
  • the reading efficiency of MPT has been increased from 15000ns/op to 10000ns/op, and the reading efficiency has been improved.
  • the node type includes at least one of the following: full node, short node, value node, and hash node.
  • FIG. 2 is a flowchart of a data reading method according to an embodiment of the present invention. As shown in FIG. 2, in this embodiment, the present invention provides a data reading method, including:
  • S22 Read the data from the local database; the data is generated by the structure code of various nodes of the Merkel Patricia Tree (MPT) defined by the protocol protocol, the structure includes the first parameter;
  • MPT Merkel Patricia Tree
  • short node (A) the key of short node (A) is 8
  • Val is the hash value of full node (a), and it is in position 5 of children [17] node of full node (a)
  • short node (B) the key of short node (B) is 1344
  • the Val of short node (B) is 1 token
  • the first parameter Ty of short node (B) is 0x52 as an example.
  • step S22 read the data from the local database, read the key of the short node (B) is 851344, and the Val of the short node (B) is 1 token; where, the data is defined by the protocol protocol Merkel Patri Summer tree (MPT) structure coding of various nodes, the structure includes the first parameter Ty;
  • MPT Merkel Patri Summer tree
  • 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 (CPU) 301, which can be based on a program stored in a read-only memory (ROM) 302 or The program loaded into the random access memory (RAM) 303 from the storage section 308 performs various appropriate actions and processes.
  • 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, ROM 302, and RAM 303 are connected to each other via a bus 304.
  • the input/output (I/O) interface 305 is also connected to the 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; 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, etc.
  • the communication section 309 performs communication processing via a network such as the Internet.
  • the drive 310 is also connected to the I/O interface 305 as needed.
  • the data storage method and the data reading method described in any of the above embodiments may be implemented as computer software programs.
  • an embodiment of the present disclosure includes a computer program product including a computer program tangibly contained on a machine-readable medium, the computer program including program code for performing a data storage method and a data reading method.
  • the computer program may be downloaded and installed from the network through the communication section 309, and/or installed from the removable medium 311.
  • the present application also provides a computer-readable storage medium, which may be a computer-readable storage medium included in the device of the foregoing embodiment; or may exist alone and not assembled The computer-readable storage medium in the device.
  • the computer-readable storage medium stores one or more programs, which are used by one or more processors to execute the data storage method and the data reading method described in this application.
  • each block in the flowchart or block diagram may represent a module, program segment, or part of code that contains one or more logic functions Executable instructions.
  • the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may actually be executed in parallel, and they may sometimes be executed in reverse order, depending on the functions involved.
  • each block in the block diagrams and/or flowcharts, and combinations of blocks in the block diagrams and/or flowcharts can be implemented by dedicated hardware-based systems that perform specified functions or operations Or, it can be realized by a combination of dedicated hardware and computer instructions.
  • the units or modules described in the embodiments of the present application may be implemented in software or hardware.
  • the described unit or module may also be provided in the processor.
  • each of the units may be a software program provided in a computer or a mobile smart device, or may be a separately configured hardware device.
  • the names of these units or modules do not constitute a limitation on the units or modules themselves.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

本发明提供一种数据存储方法、数据读取方法、设备和存储介质，该方法包括：通过protocol buffers协议定义区块链中梅克尔帕特里夏树(MPT)的各类节点的结构体；利用各结构体进行编码，将编码生成的数据存入本地数据库；本发明优化了MPT的数据存储模式，提升MPT读取效率。

Description

数据存储方法、数据读取方法、设备和存储介质 技术领域
本申请涉及区块链技术领域，具体涉及一种数据存储方法、数据读取方法、设备和存储介质。
背景技术
当前区块链系统的数据结构存储解决方案中，通常会利用Merkle Patricia Tries(MPT)树等对区块链的状态数据(如账户余额等)进行存储。现有的方案中利用RLP编码MPT，RLP对于复杂数据结构体类型支持不够完善，需要做额外的转化，且使用RLP编码MPT，该MPT的读取效率为15000ns/op，读取效率较低。
发明内容
鉴于现有技术中的上述缺陷或不足，期望提供一种优化MPT数据存储，提升MPT读取效率的数据存储方法、数据读取方法、设备和存储介质。
第一方面，本发明提供一种数据存储方法，包括：
通过protocol buffers协议定义区块链中梅克尔帕特里夏树(MPT)的各类节点的结构体；
利用各结构体进行编码，将编码生成的数据存入本地数据库。
第二方面，本发明提供一种数据读取方法，包括：
从本地数据库中读取数据；其中，数据通过protocol buffers协议定义的梅克尔帕特里夏树(MPT)各类节点的结构体编码生成，结构体包括第一参数；
通过解析数据中各节点的第一参数获取各节点的节点类型和位置信息。
第三方面，本发明还提供一种设备，包括一个或多个处理器和存 储器，其中存储器包含可由该一个或多个处理器执行的指令以使得该一个或多个处理器执行根据本发明各实施例提供的数据存储方法及数据读取方法。
第四方面，本发明还提供一种存储有计算机程序的存储介质，该计算机程序使计算机执行根据本发明各实施例提供的数据存储方法及数据读取方法。
本发明诸多实施例提供的数据存储方法、数据读取方法、设备和存储介质通过protocol buffers协议定义区块链中梅克尔帕特里夏树(MPT)的各类节点的结构体；利用各结构体进行编码，将编码生成的数据存入本地数据库的方法，优化了MPT的数据存储模式，提升MPT读取效率。
本发明一些实施例提供的数据存储方法、数据读取方法、设备和存储介质进一步通过结构体包括第一参数，第一参数通过可解析的编码方法对节点的节点类型与位置信息编码生成的方法，减少了数据存储的数据量，进一步提升MPT读取效率。
附图说明
通过阅读参照以下附图所作的对非限制性实施例所作的详细描述，本申请的其它特征、目的和优点将会变得更明显：
图1为本发明一实施例提供的一种数据存储方法的流程图。
图2为本发明一实施例提供的一种数据读取方法的流程图
图3为本发明一实施例提供的一种设备的结构示意图。
具体实施方式
下面结合附图和实施例对本申请作进一步的详细说明。可以理解的是，此处所描述的具体实施例仅仅用于解释相关发明，而非对该发明的限定。另外还需要说明的是，为了便于描述，附图中仅示出了与发明相关的部分。
需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。下面将参考附图并结合实施例来详细说明本 申请。
图1为本发明一实施例提供的一种数据存储方法的流程图。如图1所示，在本实施例中，本发明提供一种数据存储方法，包括：
S12：通过protocol buffers协议定义区块链中梅克尔帕特里夏树(MPT)的各类节点的结构体；
S14：利用各结构体进行编码，将编码生成的数据存入本地数据库。
具体地，以各类节点包括full node及short node，为full node的结构体定义Children[]node及flags，为short node的结构体定义Key，Val及flags为例。
在步骤S12中，通过protocol buffers协议定义区块链中梅克尔帕特里夏树(MPT)的节点的结构体，以及部分节点的节点类型的结构体：full node及short node的结构体；
定义的节点的结构体如下：
Figure PCTCN2019127997-appb-000001
定义的full node的结构体如下：
Figure PCTCN2019127997-appb-000002
定义的short node的结构体如下：
Figure PCTCN2019127997-appb-000003
在步骤S14中，利用节点的结构体，以及部分节点类型的结构体full node及short node的结构体进行编码，将编码生成的数据存入本地数据库。
在更多实施例中，本发明提供的数据存储方法不以上述举例为限，还可以根据实际需求定义节点的结构体及各类节点的结构体，例如还可以定义hash node等，定义的结构体所包含的信息也不以上述举例为限，可根据实际需求进行配置，均可实现相同的技术效果。
上述实施例优化了MPT的数据存储模式，提升了MPT读取效率。
在一优选实施例中，结构体包括第一参数，第一参数通过可解析的编码方法对节点的节点类型与位置信息编码生成。
具体地，结构体包括第一参数Ty，定义第一参数Ty如下：
Figure PCTCN2019127997-appb-000004
第一参数ty通过可解析的编码方法对节点的节点类型与位置信息编码生成。具体地，以在full node的Children[17]node的位置5中，有short node为例。
Ty＝2+(5<<4)＝0x52；其中，5代表该short node在Children[17]node的位置，2代表节点的节点类型为short node。
在一般系统中，普遍将节点类型定义为一个参数，又将位置信息定义为又一参数，将两个参数信息存放在数据库中，增加了数据存储的数据量；从数据库中读取节点类型信息及位置信息时，会降低读取的效率。
在更多实施例中，还可以根据实际需求定义第一参数，第一参数还可保护其它的节点的信息，可实现相同的技术效果。
上述实施例减少了数据存储的数据量，进一步提升MPT读取效 率。
根据实际测试，MPT的读取效率已从15000ns/op提升为10000ns/op，读取效率提高。
在一优选实施例中，节点类型包括以下至少一项：full node、short node、value node及hash node。
图2为本发明一实施例提供的一种数据读取方法的流程图。如图2所示，在本实施例中，本发明提供一种数据读取方法，包括：
S22：从本地数据库中读取数据；其中，数据通过protocol buffers协议定义的梅克尔帕特里夏树(MPT)各类节点的结构体编码生成，结构体包括第一参数；
S24：通过解析数据中各节点的第一参数获取各节点的节点类型和位置信息。
具体地，以有short node(A)，short node(A)的Key是8，Val是full node(a)的哈希值，且在full node(a)的Children[17]node的位置5中，有short node(B)，short node(B)的Key为1344，short node(B)的Val为1token，short node(B)的第一参数Ty为0x52为例。
在步骤S22中，从本地数据库中读取数据，读取short node(B)的Key为851344，short node(B)的Val为1token；其中，数据通过protocol buffers协议定义的梅克尔帕特里夏树(MPT)各类节点的结构体编码生成，结构体包括第一参数Ty；
在步骤S24中，通过解析数据中short node(B)的第一参数获取short node(B)的节点类型和位置信息；由于Ty＝2+(5<<4)＝0x52；其中，5代表该short node在Children[17]node的位置，2代表节点的节点类型为short node，解析出short node(B)的节点类型为short node，short node(B)的位置信息为5。
图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 (7)

  1. 一种数据存储方法，其特征在于，包括：
    通过protocol buffers协议定义区块链中梅克尔帕特里夏树(MPT)的各类节点的结构体；
    利用各所述结构体进行编码，将编码生成的数据存入本地数据库。
  2. 根据权利要求1所述的方法，其特征在于，所述结构体包括第一参数，所述第一参数通过可解析的编码方法对节点的节点类型与位置信息编码生成。
  3. 根据权利要求2所述的方法，其特征在于，所述节点类型包括以下至少一项：full node、short node、value node及hash node。
  4. 一种数据读取方法，其特征在于，包括：
    从本地数据库中读取数据；其中，所述数据通过protocol buffers协议定义的梅克尔帕特里夏树(MPT)各类节点的结构体编码生成，所述结构体包括第一参数；
    通过解析所述数据中各节点的第一参数获取各所述节点的节点类型和位置信息。
  5. 根据权利要求4所述的方法，其特征在于，所述节点类型包括以下至少一项：full node、short node、value node及hash node。
  6. 一种设备，其特征在于，所述设备包括：
    一个或多个处理器；
    存储器，用于存储一个或多个程序，
    当所述一个或多个程序被所述一个或多个处理器执行时，使得所述一个或多个处理器执行如权利要求1-5中任一项所述的方法。
  7. 一种存储有计算机程序的存储介质，其特征在于，该程序被处理器执行时实现如权利要求1-5中任一项所述的方法。
PCT/CN2019/127997 2018-12-29 2019-12-24 数据存储方法、数据读取方法、设备和存储介质 WO2020135434A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811643200.3 2018-12-29
CN201811643200.3A CN109710620B (zh) 2018-12-29 2018-12-29 数据存储方法、数据读取方法、设备和存储介质

Publications (1)

Publication Number Publication Date
WO2020135434A1 true WO2020135434A1 (zh) 2020-07-02

Family

ID=66259731

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/127997 WO2020135434A1 (zh) 2018-12-29 2019-12-24 数据存储方法、数据读取方法、设备和存储介质

Country Status (2)

Country Link
CN (1) CN109710620B (zh)
WO (1) WO2020135434A1 (zh)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109710620B (zh) * 2018-12-29 2021-03-16 杭州复杂美科技有限公司 数据存储方法、数据读取方法、设备和存储介质
CN110099069B (zh) * 2019-05-17 2021-07-20 赛尔网络有限公司 一种智慧充电桩数据传输装置、处理系统及方法
CN110471795B (zh) * 2019-07-31 2020-10-02 阿里巴巴集团控股有限公司 区块链状态数据恢复方法及装置、电子设备
US10761948B1 (en) 2019-07-13 2020-09-01 Alibaba Group Holding Limited Method, apparatus, and electronic device for restoring state data of blockchain
CN111209341B (zh) * 2020-01-07 2023-03-14 北京众享比特科技有限公司 区块链的数据存储方法、装置、设备及介质
CN112506918B (zh) * 2020-11-03 2024-06-04 深圳市宏电技术股份有限公司 数据存取方法、终端及计算机可读存储介质

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108052321A (zh) * 2017-12-28 2018-05-18 杭州趣链科技有限公司 一种基于配置信息自动生成区块链智能合约的方法
CN109710620A (zh) * 2018-12-29 2019-05-03 杭州复杂美科技有限公司 数据存储方法、数据读取方法、设备和存储介质

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8560523B2 (en) * 2008-06-26 2013-10-15 Microsoft Corporation View matching of materialized XML views
CN107786339A (zh) * 2016-08-31 2018-03-09 陈新 分层可控联盟区块链系统
CN107092656B (zh) * 2017-03-23 2019-12-03 中国科学院计算技术研究所 一种树状结构数据处理方法及系统
CN108039943B (zh) * 2017-12-06 2020-10-30 清华大学深圳研究生院 一种可验证的加密搜索方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108052321A (zh) * 2017-12-28 2018-05-18 杭州趣链科技有限公司 一种基于配置信息自动生成区块链智能合约的方法
CN109710620A (zh) * 2018-12-29 2019-05-03 杭州复杂美科技有限公司 数据存储方法、数据读取方法、设备和存储介质

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
MA YUSHENG: "Secure DNS Design Based on Blockchain Technology", CHINESE MASTER’S THESES FULL-TEXT DATABASE, no. 8, 15 August 2018 (2018-08-15), pages 1 - 82, XP055714480, ISSN: 1674-0246 *

Also Published As

Publication number Publication date
CN109710620B (zh) 2021-03-16
CN109710620A (zh) 2019-05-03

Similar Documents

Publication Publication Date Title
WO2020135434A1 (zh) 数据存储方法、数据读取方法、设备和存储介质
CN109902274B (zh) 一种将json字符串转化为thrift二进制流的方法及系统
US9530012B2 (en) Processing extensible markup language security messages using delta parsing technology
US8344916B2 (en) System and method for simplifying transmission in parallel computing system
US10373300B1 (en) System and method for lossy image and video compression and transmission utilizing neural networks
CN107256206B (zh) 字符流格式转换的方法和装置
US10489936B1 (en) System and method for lossy image and video compression utilizing a metanetwork
US20090284400A1 (en) Method and System for Reducing Required Storage During Decompression of a Compressed File
US9966971B2 (en) Character conversion
US20120033886A1 (en) Image processing systems employing image compression
WO2020015087A1 (zh) 大规模图片处理方法、系统、计算机设备及计算机存储介质
KR20200094364A (ko) 이미지 파일의 블록 간 차이를 통한 압축율 향상 방법 및 시스템
CN109614411B (zh) 数据存储方法、设备和存储介质
US20190312588A1 (en) Efficient software closing of hardware-generated encoding context
CN111523896B (zh) 防攻击方法、设备和存储介质
WO2016008317A1 (zh) 数据处理方法和中心节点
US11449461B2 (en) Metadata-driven distributed dynamic reader and writer
US20180337905A1 (en) Systems and methods for encoding additional authentication data into an active directory security identifier
CN115604365B (zh) 数据编解码方法、装置、电子设备及可读存储介质
US11475356B2 (en) Data processing method, electronic device and computer readable storage method for deduplication of a training dataset
CN115794494A (zh) 基于动态策略的数据备份方法、系统、装置、设备及介质
CN115904240A (zh) 数据处理方法、装置、电子设备和存储介质
WO2021238289A1 (zh) 序列处理的方法与装置
US9160820B2 (en) Large volume data transfer
US20220215511A1 (en) System and method for lossy image and video compression and/or transmission utilizing a metanetwork or neural networks

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: 19904856

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: 19904856

Country of ref document: EP

Kind code of ref document: A1