WO2022095429A1 - 一种区块链网络存储结构、工作方法、装置、介质及设备 - Google Patents

一种区块链网络存储结构、工作方法、装置、介质及设备 Download PDF

Info

Publication number
WO2022095429A1
WO2022095429A1 PCT/CN2021/097180 CN2021097180W WO2022095429A1 WO 2022095429 A1 WO2022095429 A1 WO 2022095429A1 CN 2021097180 W CN2021097180 W CN 2021097180W WO 2022095429 A1 WO2022095429 A1 WO 2022095429A1
Authority
WO
WIPO (PCT)
Prior art keywords
nodes
layer
node
blockchain network
sub
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.)
Ceased
Application number
PCT/CN2021/097180
Other languages
English (en)
French (fr)
Inventor
薄辰龙
李宁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ping An Technology Shenzhen Co Ltd
Original Assignee
Ping An Technology Shenzhen Co Ltd
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 Ping An Technology Shenzhen Co Ltd filed Critical Ping An Technology Shenzhen Co Ltd
Publication of WO2022095429A1 publication Critical patent/WO2022095429A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06—Management of faults, events, alarms or notifications
    • H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0668—Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06—Management of faults, events, alarms or notifications
    • H04L41/0677—Localisation of faults
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks

Definitions

  • the present application relates to the field of blockchain technology, and more specifically, the present application relates to a blockchain network storage structure, working method, apparatus, medium and equipment.
  • Blockchain technology originated in 2008. Because of its features of decentralization, transparency, openness, autonomy, anonymity, and immutability of information, it is considered to be a computing technology after mainframes, personal computers, the Internet, and mobile social networks.
  • the fifth subversive innovation of the paradigm is the fourth milestone in the history of human credit evolution after blood kinship credit, precious metal credit, and central bank banknote credit.
  • Blockchain technology provides a solution to the problems of high cost, inefficiency and insecure data storage that are prevalent in centralized institutions.
  • an N-ary tree-based blockchain network storage structure including:
  • the first layer of the network structure is the main node, and the second layer is N sub-nodes connected to the main node, where N is an integer greater than 2;
  • the present application can also provide a working method of a blockchain network based on an N-ary tree, which acts on the blockchain network implemented by the above-mentioned N-ary tree-based blockchain network storage structure, including: :
  • S1 traverse all the sub-nodes of the second layer, determine whether there is a node that the user needs to find in the sub-nodes, if so, end the process, otherwise continue to execute S2;
  • S2 Traverse the secondary nodes corresponding to each of the sub-nodes of the third layer, determine whether there is a node that the user needs to find in the secondary nodes, if so, end the process, if not, in the next layer of network structure Keep looking.
  • the present application can also provide a computer storage medium on which a computer program is stored, and when the computer program is executed by a processor, the steps for realizing the above-mentioned working method of the N-ary tree-based blockchain network .
  • the present application also provides a kind of electronic equipment, comprising a memory, a processor and a computer program stored on the memory and running on the processor, and the above-mentioned N-ary tree-based tree is realized when the processor executes the computer program.
  • the steps of the working method of the blockchain network comprising a memory, a processor and a computer program stored on the memory and running on the processor, and the above-mentioned N-ary tree-based tree is realized when the processor executes the computer program.
  • the regularity of the node arrangement of the block chain network is effectively improved, and a more regular block chain network can improve the communication field.
  • the efficiency of data transmission between nodes in a data transmission network can quickly find the location of available spare nodes when a faulty node occurs. After consensus, the faulty node rejoins the entire blockchain network, effectively avoiding block The "island" problem in which the child nodes under the faulty node are isolated from the entire blockchain network due to the failure of individual nodes in the chain.
  • Embodiment 1 shows a schematic structural diagram of Embodiment 1 of the present application
  • FIG. 2 shows a partial schematic diagram of a blockchain network storage structure in the prior art
  • FIG. 3 shows a schematic structural diagram of the preferred embodiment of Example 1 of the present application
  • FIG. 5 shows a schematic flowchart of Embodiment 3 of the present application
  • FIG. 7 shows a schematic structural diagram of Embodiment 6 of the present application.
  • Blockchain is a distributed shared accounting technology. What it does is to enable all parties involved to establish a trust relationship at the technical level.
  • the blockchain can be roughly divided into the underlying technology of the blockchain and the upper-layer application of the blockchain.
  • the so-called application of blockchain refers to the application of transformation, optimization or innovation based on blockchain technology.
  • the core meaning of blockchain technology is to establish data credit between participants.
  • Bitcoin is the first application of blockchain technology, but the application of blockchain technology goes far beyond the financial industry.
  • the communication industry is also enthusiastic, especially in the field of telecom operators, and blockchain technology is becoming a new favorite.
  • Blockchain technology can be understood as the role of a network infrastructure similar to the TCP/IP protocol, and will be one of the key infrastructure elements to support the new Internet format characterized by peer-to-peer openness in the future, which in turn affects many industries.
  • the specific application form is just like the impact the Web has brought to various industries around the world.
  • this application has made improvements in the data transmission application level of blockchain in the field of communication, specifically referring to a new N-ary tree-based blockchain network storage structure, which is combined below Several specific embodiments explain the technical solutions of the present application in detail.
  • This application provides an N-ary tree-based blockchain network storage structure, including:
  • the first layer of the network structure is the main node, and the second layer is N sub-nodes connected to the main node, where N is an integer greater than 2;
  • the first layer, the second layer, and the third layer represent the data storage depth of the blockchain network.
  • the regularity of the node arrangement of the blockchain network is effectively improved, and a more regular blockchain network can improve the data in the communication field.
  • the transmission efficiency of data between nodes in a transmission network is effectively improved.
  • the first layer is the master node
  • the second layer is N child nodes connected to the master node, where N is an integer greater than 2;
  • the total number of nodes in the third layer is: S
  • N is the total number of child nodes in the second layer
  • N is an integer greater than 2
  • M i The number of secondary nodes under the ith child node of the second layer.
  • the blockchain network using the N-ary tree-based blockchain network storage structure of the present application compared with the traditional blockchain network, has regular node arrangement, and can save a lot of time to search for data when accessing and searching for node data in the network. time cost.
  • the sub-node is saturated and cannot continue to connect to a new secondary node
  • M i is less than N, the child node is not saturated, and new secondary nodes can continue to be connected.
  • new secondary nodes can continue to be connected.
  • the faulty node can traverse the entire blockchain network to find nodes that are not saturated and have spare chains to connect, and quickly restore node functions.
  • the faulty node of the network to be accessed and other connected subordinate nodes are connected to the node that has a spare chain, the faulty node of the network to be accessed is and other subordinate nodes connected to it as a whole to access the blockchain network.
  • the technical effect of the above-mentioned further technical solutions is that when each node is in a saturated state, the next-level node cannot be added, and when it is in an unsaturated state, the next-level node can be further added. Unsaturated nodes can add new nodes or reconnect a failed node in question.
  • 1 represents the main node of the first layer
  • 2 represents the child node of the second layer
  • 3 represents the secondary node of the third layer.
  • the blockchain network structure is divided into a three-layer network structure, including a total of 14 nodes, including 1 main node, 4 sub-nodes, and 9 secondary nodes.
  • child nodes 1, 2, and 4 are all unsaturated nodes, and can continue to connect to other nodes;
  • child node 3 is a saturated node and cannot continue to connect to other nodes.
  • the child node on the left that is, the child node with a smaller sequence number
  • the child node on the left that is, the child node with a smaller sequence number
  • it will be connected to child node 1.
  • child node 1 becomes a saturated node and cannot continue to connect new secondary nodes. Subsequent recovery or increased access nodes should be connected to sub-node 2.
  • the arrangement rules of the N child nodes are arranged in ascending order from left to right according to the first time parameter;
  • the arrangement rules of the Mi secondary nodes are arranged in ascending order from left to right according to the second time parameter.
  • the arrangement mode of nodes in each layer in the blockchain network storage structure of the present application is specifically limited. Since they are arranged in ascending order from left to right according to corresponding time parameters, in the Significant time savings can be achieved in the process of traversing the data.
  • the first time parameter and the second time parameter are determined by the time sequence of nodes accessing the blockchain network. The earlier the node accessing the blockchain network corresponds to The more to the left in the same level arrangement in the blockchain network.
  • the technical effect of the above-mentioned preferred technical solution is: determined by the time sequence of joining the blockchain network, the arrangement of nodes in the entire blockchain network is more regular.
  • N is equal to 3
  • the N-ary tree-based blockchain network storage structure is a ternary tree-based blockchain network storage structure.
  • the ternary tree can realize the storage of the same number of nodes as the binary tree in the blockchain network with a smaller tree depth, that is, the same number of nodes,
  • the number of network structure layers required to implement with a ternary tree is much smaller than that of a binary tree.
  • it is relatively simple and convenient to use a ternary tree to implement at the code level.
  • a variety of data travel methods can be provided for the user to choose flexibly according to actual needs.
  • Embodiment 2 is a diagrammatic representation of Embodiment 1:
  • Embodiment 1 The application can also make the following improvements on the basis of Embodiment 1:
  • This further improved technical solution specifically defines the blockchain network storage structure of the present application as a storage structure with a four-layer network structure.
  • the N-ary tree blockchain network structure of the present application is realized.
  • the workload of implementing the blockchain network structure of the present application at the code level is greatly reduced.
  • the arrangement rules of the N child nodes are arranged in ascending order from left to right according to the first time parameter;
  • the arrangement rules of the Mi secondary nodes are arranged in ascending order from left to right according to the second time parameter;
  • the arrangement rules of the P ji next-level nodes are arranged in ascending order from left to right according to the third time parameter.
  • the first time parameter, the second time parameter and the third time parameter are determined by the chronological order of the nodes accessing the blockchain network, and the earlier the node accessing the blockchain network corresponds to the time The smaller the parameter is, the farther the node is to the left in the same-level arrangement in the blockchain network.
  • the application also provides a working method of a blockchain network based on an N-ary tree, which acts on the blockchain network implemented by the above-mentioned N-ary tree-based blockchain network storage structure, including:
  • S1 traverses all the child nodes of the second layer, S12 judges whether there is a node that the user needs to find in the child nodes, if so, ends the process, otherwise continues to execute S2;
  • S2 traverses the secondary nodes corresponding to each of the sub-nodes of the third layer, and S22 judges whether there is a node that the user needs to find in the secondary nodes, if so, the process ends, otherwise, the next layer of network Continue to search in the structure.
  • the node that the user needs to find is searched hierarchically and level by level. If the node to be searched is found in a certain layer, there is no need to search for the next level, which greatly saves the work time of the user search. At the same time, based on the area of the application The network arrangement rules implemented by the blockchain network structure can greatly save the search time.
  • the working method of the N-ary tree-based blockchain network of the present application is based on the above-mentioned N-ary tree-based blockchain network storage structure on the blockchain network
  • the above-mentioned N-ary tree-based blockchain network storage structure The nodes in the blockchain network storage structure are arranged in ascending order from left to right according to the first time parameter according to the arrangement rule of the N sub-nodes; the arrangement rule of the Mi secondary nodes is arranged according to the second time parameter Arranged in an ascending order from left to right, wherein the first time parameter and the second time parameter are determined by the time sequence of nodes accessing the blockchain network, and the earlier the node accesses the blockchain network The smaller the time parameter corresponding to the node of the network, the more left the node is in the same level arrangement in the blockchain network.
  • Embodiment 4 is a diagrammatic representation of Embodiment 4:
  • the present application can also provide a working device for an N-ary tree-based blockchain network, based on the above-mentioned working method of the N-ary tree-based blockchain network, including:
  • the child node search module 601 is used to traverse all the child nodes of the second layer, and judge whether there is a node that the user needs to search for in the child nodes;
  • the secondary node search module 602 is configured to traverse the secondary nodes corresponding to each of the child nodes in the third layer, and determine whether there is a node that the user needs to search for in the secondary nodes.
  • sub-node search module 601 and the secondary node search module 602 in this application are connected.
  • the working device of the N-ary tree-based blockchain network of the present application is implemented on the blockchain network based on the above-mentioned N-ary tree-based blockchain network storage structure
  • the above-mentioned N-ary tree-based blockchain network storage structure The nodes in the blockchain network storage structure are arranged in ascending order from left to right according to the first time parameter according to the arrangement rule of the N sub-nodes; the arrangement rule of the Mi secondary nodes is arranged according to the second time parameter Arranged in an ascending order from left to right, wherein the first time parameter and the second time parameter are determined by the time sequence of nodes accessing the blockchain network, and the earlier the node accesses the blockchain network The smaller the time parameter corresponding to the node of the network, the more left the node is in the same level arrangement in the blockchain network.
  • Embodiment 5 is a diagrammatic representation of Embodiment 5:
  • the present application can also provide a computer storage medium on which a computer program is stored, and when the computer program is executed by a processor, is used to implement the steps of the above-mentioned working method of the N-ary tree-based blockchain network.
  • the storage medium may be non-volatile or non-volatile.
  • the storage medium may include: any entity or device capable of carrying the computer program code, recording medium, U disk, removable hard disk, magnetic disk, optical disk, computer memory, Read-Only Memory (ROM, Read-Only Memory).
  • the storage medium may mainly include a storage program area and a storage data area, wherein, the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store the usage according to the block chain node. created data, etc.
  • Embodiment 6 is a diagrammatic representation of Embodiment 6
  • the present application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and running on the processor.
  • the processor executes the computer program, the above-mentioned N-ary tree-based blockchain network is implemented. The steps of the working method.
  • FIG. 7 is a schematic diagram of the internal structure of an electronic device in one embodiment.
  • the electronic device includes a processor, a storage medium, a memory and a network interface connected through a system bus.
  • the storage medium of the computer device stores an operating system, a database and computer-readable instructions
  • the database may store a control information sequence
  • the processor can be made to implement an N-fork-based How the blockchain network of trees works.
  • the processor of the electrical equipment is used to provide computing and control capabilities and support the operation of the entire computer equipment.
  • Computer-readable instructions may be stored in the memory of the computer device, and when the computer-readable instructions are executed by the processor, the processor may execute a working method of an N-ary tree-based blockchain network.
  • the network interface of the computer equipment is used for communication with the terminal connection.
  • the electronic devices include, but are not limited to, smart phones, computers, tablet computers, wearable smart devices, artificial intelligence devices, power banks, and the like.
  • the processor may be composed of integrated circuits in some embodiments, for example, may be composed of a single packaged integrated circuit, or may be composed of a plurality of integrated circuits packaged with the same function or different functions, including one or more central Processor (Central Processing unit, CPU), microprocessor, digital processing chip, graphics processor and combination of various control chips, etc.
  • the processor is the control core (Control Unit) of the electronic device, and uses various interfaces and lines to connect various components of the entire electronic device, by running or executing programs or modules stored in the memory (for example, executing a remote control unit). data reading and writing programs, etc.), and call data stored in the memory to perform various functions of the electronic device and process data.
  • Control Unit Control Unit
  • the bus may be a peripheral component interconnect (PCI for short) bus or an extended industry standard architecture (Extended industry standard architecture, EISA for short) bus or the like.
  • PCI peripheral component interconnect
  • EISA Extended industry standard architecture
  • the bus can be divided into address bus, data bus, control bus and so on.
  • the bus is configured to enable connection communication between the memory and at least one processor or the like.
  • FIG. 7 only shows an electronic device with components. Those skilled in the art can understand that the structure shown in FIG. 7 does not constitute a limitation on the electronic device, and may include fewer or more components than those shown in the drawings. , or a combination of certain components, or a different arrangement of components.
  • the electronic device may also include a power source (such as a battery) for powering the various components, preferably, the power source may be logically connected to the at least one processor through a power management device, so as to be implemented by the power management device Charge management, discharge management, and power management functions.
  • the power source may also include one or more DC or AC power sources, recharging devices, power failure detection circuits, power converters or inverters, power status indicators, and any other components.
  • the electronic device may further include various sensors, Bluetooth modules, Wi-Fi modules, etc., which will not be repeated here.
  • the electronic device may also include a network interface, optionally, the network interface may include a wired interface and/or a wireless interface (such as a WI-FI interface, a Bluetooth interface, etc.) Establish a communication connection between other electronic devices.
  • a network interface optionally, the network interface may include a wired interface and/or a wireless interface (such as a WI-FI interface, a Bluetooth interface, etc.) Establish a communication connection between other electronic devices.
  • the electronic device may further include a user interface
  • the user interface may be a display (Display), an input unit (such as a keyboard (Keyboard)), optionally, the user interface may also be a standard wired interface or a wireless interface.
  • the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode, organic light-emitting diode) touch device, and the like.
  • the display may also be appropriately called a display screen or a display unit, which is used for displaying information processed in the electronic device and for displaying a visual user interface.
  • the computer usable storage medium may mainly include a stored program area and a stored data area, wherein the stored program area may store an operating system, an application program required by at least one function, and the like; using the created data, etc.
  • modules described as separate components may or may not be physically separated, and the components shown as modules may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution in this embodiment.
  • each functional module in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the above-mentioned integrated units can be implemented in the form of hardware, or can be implemented in the form of hardware plus software function modules.
  • the regularity of the node arrangement of the block chain network is effectively improved, and a more regular block chain network can improve the communication field.
  • the efficiency of data transmission between nodes in a data transmission network can quickly find the location of available spare nodes when a faulty node occurs. After consensus, the faulty node rejoins the entire blockchain network, effectively avoiding block The "island" problem in which the child nodes under the faulty node are isolated from the entire blockchain network due to the failure of individual nodes in the chain.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

本申请涉及区块链技术领域，本申请提供了一种区块链网络存储结构、工作方法、装置、介质及设备，其中，所述区块链网络存储结构具体包括：不少于三层网络结构，所述网络结构中第一层为主节点，第二层为与主节点相连接的N个子节点，其中N为大于2的整数；第三层为每个所述子节点依次连接的M i个次级节点，其中M i为小于等于N的自然数，i＝1、2、……、N。其中，所述工作方法，包括：S1：遍历所述第二层的全部子节点，判断所述子节点中是否存在用户需要查找的节点，若是则结束流程；S2：遍历所述第三层的每个所述子节点所对应的次级节点，判断所述次级节点中是否存在用户需要查找的节点，若是则结束流程，若否则在下一层网络结构中继续查找。

Description

一种区块链网络存储结构、工作方法、装置、介质及设备 技术领域
本申请涉及区块链技术领域，更为具体来说，本申请涉及一种区块链网络存储结构、工作方法、装置、介质及设备。
背景技术
区块链技术起源于2008年，因为具有去中心化、透明性、开放性、自治性、匿名性和信息不可篡改等特点，被认为是继大型机、个人电脑、互联网、移动社交网络之后计算范式的第五次颠覆式创新，是人类信用进化史上继血亲信用、贵金属信用、央行纸币信用之后的第四个里程碑。区块链技术为解决中心化机构普遍存在的高成本、低效率和数据存储不安全等问题提供了解决方案。
在通信领域的应用中，当用户想要访问区块链中的一条具体数据信息时，对于一个完全节点就需要遍历区块内存储的全部数据。但是，发明人意识到随着区块链应用的广泛普及，区块链中保存的数据量也会急剧增加，区块链中节点的排布也不规律，在一条完整的区块链上进行数据查询效率随之越来越慢。因此，如何提高在一条完整区块链上的数据查询效率则越来越重要。
发明内容
为解决现有技术的区块链中节点之间的连接关系混乱，不能形成有规律的体系，导致两个节点之间难以实现数据通信或者链路较长，在通信领域的数据传输网络中数据传输效率低下。同时，现有技术的区块链网络结构当某一个节点出现问题故障后，该节点下的所有子节点都会出现无法访问整个区块链网络的故障，同时出现故障的节点想在整个区块链网络中寻找好的节点进行连接非常困难的技术问题。
为实现上述技术目的，本申请提供了一种基于N叉树的区块链网络存储结构，包括：
不少于三层网络结构，所述网络结构中第一层为主节点，第二层为与主节点相连接的N个子节点，其中N为大于2的整数；
第三层为每个所述子节点依次连接的M i个次级节点，其中M i为小于等于N的自然数，i＝1、2、……、N。
为实现上述技术目的，本申请还能够提供一种基于N叉树的区块链网络的工作方法，作用于上述的基于N叉树的区块链网络存储结构实现的区块链网络上，包括：
S1：遍历所述第二层的全部子节点，判断所述子节点中是否存在用户需要查找的节点，若是则结束流程，若否则继续执行S2；
S2：遍历所述第三层的每个所述子节点所对应的次级节点，判断所述次级节点中是否存在用户需要查找的节点，若是则结束流程，若否则在下一层网络结构中继续查找。
为实现上述技术目的，本申请还能够提供一种计算机存储介质，其上存储有计算机程序，计算机程序被处理器执行时用于实现上述的基于N叉树的区块链网络的工作方法的步骤。
为实现上述技术目的，本申请还提供了一种电子设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，处理器执行计算机程序时实现上述的基于N叉树的区块链网络的工作方法的步骤。
本申请的有益效果为：
通过基于N叉树的区块链网络结构，通过N叉树的规律的节点排布，有效提高了区块链网络的节点排布规律性，更为规律的区块链网络能够提高通信领域中数据传输网络中数据在节点之间的传输效率。同时，本申请的基于N叉树的区块链网络结构，当出现故障节点时，可以快速查找到可用空余节点位置，经过共识后，故障节点重新加入整个区块链网络，有效避免了区块链中因为个别节点故障产生的故障节点下的子节点被从整 个区块链网络中孤立出来的“孤岛”问题。
附图说明
图1示出了本申请的实施例1的结构示意图；
图2示出了现有技术的区块链网络存储结构局部示意图；
图3示出了本申请的实施例1的优选实施方式结构示意图；
图4示出了本申请的实施例2的结构示意图；
图5示出了本申请的实施例3的流程示意图；
图6示出了本申请的实施例4的结构示意图；
图7示出了本申请的实施例6的结构示意图。
具体实施方式
以下，将参照附图来描述本申请的实施例。但是应该理解，这些描述只是示例性的，而并非要限制本申请的范围。此外，在以下说明中，省略了对公知结构和技术的描述，以避免不必要地混淆本申请的概念。
在附图中示出了根据本申请实施例的各种结构示意图。这些图并非是按比例绘制的，其中为了清楚表达的目的，放大了某些细节，并且可能省略了某些细节。图中所示出的各种区域、层的形状以及它们之间的相对大小、位置关系仅是示例性的，实际中可能由于制造公差或技术限制而有所偏差，并且本领域技术人员根据实际所需可以另外设计具有不同形状、大小、相对位置的区域/层。
区块链(Block chain)是一种分布式共享记账的技术，它要做的事情就是让参与的各方能够在技术层面建立信任关系。区块链可以大致分成区块链底层技术和区块链上层应用。所谓区块链的应用，就是基于区块链技术的改造、优化或者创新等应用。区块链技术最为核心的意义是参与方之间建立数据信用。
比特币是区块链技术的第一个应用，但区块链技术的应用领域远不止金融行业。通信业者同样投以热情，特别是电信运营商领域，区块链技术正在成为新宠。区块链技术可以理解为类似TCP/IP协议这样的一种网络基础设施的角色，将是支撑未来以对等开放为特征的新型互联网业态的关键设施要素之一，进而影响到众多行业领域的具体应用形态，就像Web带给全世界各行业的影响一样。
在通信领域，传统方式下的信息都是通过点对点传输来完成，这使得追踪者可以通过追踪信息传输的路径来拦截信息，这就带来了一个安全问题，由此也就产生了保障信息传输路径绝对安全的迫切需求。区块链技术的原理可能正好可以帮助解决这一问题。区块链在通信领域的全新应用可以完全改变信息传输的渠道，从根本上解决信息传递的路径安全问题，区块链技术为未来通信信息传递模式的改变打开了一扇大门。
如图2所示：
示出了采用现有技术的区块链网络存储结构的部分示意图：
不难看出，现有技术的区块链网络存储结构其节点的排布非常混乱，不能形成有规律的体系，导致两个节点之间难以实现数据通信或者链路较长，数据传输效率低下。同时，现有技术的区块链网络结构当某一个节点出现问题故障后，该节点下的所有子节点都会出现无法访问整个区块链网络的故障，形成“孤岛”，同时出现故障的节点想在整个区块链网络中寻找好的节点进行连接非常困难。
基于上述现有技术存在的问题，本申请在区块链在通信领域的数据传输应用层面做了改进，具体的指提出了一种新的基于N叉树的区块链网络存储结构，下面结合几个具体的实施例详解本申请的技术方案。
实施例一：
如图1所示：
本申请提供了一种基于N叉树的区块链网络存储结构，包括：
不少于三层网络结构，所述网络结构中第一层为主节点，第二层为与主节点相连接的N个子节点，其中N为大于2的整数；
第三层为每个所述子节点依次连接的M i个次级节点，其中M i为小于等于N的自然数，i＝1、2、……、N。
其中，所述第一层、第二层、第三层表示所述区块链网络的数据存储深度。
上述技术方案的技术效果是：
通过基于N叉树的区块链网络结构，通过N叉树的规律的节点排布，有效提高了区块链网络的节点排布规律性，更为规律的区块链网络能够提高通信领域数据传输网络中数据在节点之间的传输效率。
第一层为主节点；
第二层为N个与所述主节点相连接的子节点，其中N为大于2的整数；
第三层为M i个次级节点依次与其对应的第N个子节点相连接，其中M i为小于等于N的自然数，i＝1、2、……、N。
第三层总节点个数为：S
Figure PCTCN2021097180-appb-000001
式中，i＝1、2、……、N，N为第二层子节点的总数，N为大于2的整数，M i第二层第i个子节点下的次级节点个数。
应用本申请的基于N叉树的区块链网络存储结构的区块链网络，相对传统的区块链网络，节点排布规律，在进行网络中的节点数据访问查找时可以大量节约查找数据的用时。
进一步地，若所述M i等于N，则此子节点饱和，不能继续连接新的次级节点；
若M i小于N，则此子节点不饱和，可以继续连接新的次级节点。
具体地，当节点不饱和时，可以继续连接新的次级节点。当区块链网络中的某个节点故障时，该故障节点可以遍历整个区块链网络寻找不饱和存在空余链的节点进行连接，快速恢复节点功能。
在进行节点恢复连接时，待接入网络的故障节点及其相连的其他下属节点在所述待接入网络的故障节点与存在空余链的节点进行连接时，所述待接入网络的故障节点及其相连的其他下属节点整体接入区块链网络。
上述进一步的技术方案的技术效果为：限定了各个节点何时为饱和状态不可增加下一级节点，何时为不饱和状态可以进一步增加下一级节点。不饱和状态的节点可以增加新的节点，也可以重新连接存在问题的故障节点。
下面结合一个具体的优选实例展示本申请的区块链网络结构，如图3所示：
图3中，1表示第一层的主节点，2表示第二层的子节点，3表示第三层的次级节点。
本优选实施例中，所述区块链网络结构共分三层网络结构，共包含14个节点，其中1个主节点，4个子节点，9个次级节点。
在第二层的子节点中，子节点1、2、4均为不饱和节点，可以继续连接其他节点；
在第二层的子节点中，子节点3为饱和节点，无法继续连接其他节点。
在进行节点恢复或增加接入时，优先填补左侧的子节点，即序号小的子节点，在本例中，若有1个节点要恢复或增加接入，则与子节点1相连接。连接后子节点1变为饱和节点，无法继续连接新的次级节点。后续恢复或增加接入的节点应与子节点2相连接。
进一步地，所述N个子节点的排布规律按照第一时间参数从左至右升序排布；
所述M i个次级节点的排布规律按照第二时间参数从左至右升序排布。
上述进一步的技术方案的技术效果为：具体限定了本申请的区块链网络存储结构中 的节点在各层的排布方式，由于是按照对应的时间参数从左至右升序排布的，在进行数据遍历查找的过程中可以大量节约时间。
优选地，所述第一时间参数和所述第二时间参数由节点接入区块链网络的时间先后顺序决定，越早接入区块链网络的节点对应的时间参数越小，该节点在区块链网络中同层级排布中越靠左。
上述优选技术方案的技术效果为：由加入区块链网络的时间先后顺序决定，使整个区块链网络的节点排布更为规律。
进一步地，N等于3，所述基于N叉树的区块链网络存储结构为基于三叉树的区块链网络存储结构。
上述进一步的技术方案的技术效果为：三叉树相对于二叉树过于高的树深度，可以再较少的树深度实现同二叉树一样数量的节点在区块链网络中的存储，即同样的节点数量，用三叉树实现所需的网络结构层数远小于利用二叉树实现。同时采用三叉树在代码层级实现上又是相对简单便捷的。以及，采用三叉树可以具有多种数据周游方式可供用户根据实际需要进行灵活选择。
实施例二：
如图4所示：
本申请在实施例一的基础上还可以作如下改进：
当所述区块链网络的网络结构为四层结构时，第四层为每个所述次级节点依次连接的P ji个下一级节点，其中P ji为小于等于M i的自然数，j＝1、2、……、M i。
采用此进一步改进方案的有益效果是：
此进一步改进技术方案具体限定了本申请的区块链网络存储结构为四层网络结构的存储结构。相对三层的网络存储结构实现本申请N叉树区块链网络结构，对于例如100 万个节点数量，三层网络结构需要N＝1000左右来实现全部节点在区块链在网络中的存储，在代码级实现过程中编译工作过于复杂，而采用四层网络结构在N＝100时即可实现百万级的节点数量在整个区块链网络中的存储，在不增加整个区块链网络层深度复杂程度的基础上极大程度的减小了代码级实现本申请的区块链网络结构的工作量。
进一步地，所述N个子节点的排布规律按照第一时间参数从左至右升序排布；
所述M i个次级节点的排布规律按照第二时间参数从左至右升序排布；
所述P ji个下一级节点的排布规律按照第三时间参数从左至右升序排布。
优选地，所述第一时间参数、所述第二时间参数和所述第三时间参数由节点接入区块链网络的时间先后顺序决定，越早接入区块链网络的节点对应的时间参数越小，该节点在区块链网络中同层级排布中越靠左。
进一步地，若所述P ji等于M i，则此次级节点饱和，不能继续连接新的下一级节点；
若P ji小于M i，则此次级节点不饱和，可以继续连接新的下一级节点。
实施例三：
如图5所示：
本申请还提供了一种基于N叉树的区块链网络的工作方法，作用于上述的基于N叉树的区块链网络存储结构实现的区块链网络上，包括：
S1：S11遍历所述第二层的全部子节点，S12判断所述子节点中是否存在用户需要查找的节点，若是则结束流程，若否则继续执行S2；
S2：S21遍历所述第三层的每个所述子节点所对应的次级节点，S22判断所述次级节点中是否存在用户需要查找的节点，若是则结束流程，若否则在下一层网络结构中继续查找。
采用本申请的基于N叉树的区块链网络的工作方法在某一层查找到待查找的某一节 点时，无需继续在下一层排布的节点中继续查找，大大节约了查找节点的时间消耗。
上述技术方案的技术效果是：
分层逐级查找用户所需查找的节点，若在某一层中找到所需查找的节点则不需进行下一层级的查找，大大节约了用户查找的工作用时，同时，基于本申请的区块链网络结构实现的网络排布规律可以极大程度节约查找用时。
优选地，由于本申请的基于N叉树的区块链网络的工作方法是基于上述的基于N叉树的区块链网络存储结构实现的区块链网络上的，由于上述的基于N叉树的区块链网络存储结构中节点是按照所述N个子节点的排布规律按照第一时间参数从左至右升序排布；所述M i个次级节点的排布规律按照第二时间参数从左至右升序排布的规律进行排布的，其中，所述第一时间参数和所述第二时间参数由节点接入区块链网络的时间先后顺序决定，越早接入区块链网络的节点对应得时间参数越小，该节点在区块链网络中同层级排布中越靠左。故，本申请的区块链网络工作方法在查找某一个节点时，只需在每一层从左至右依次进行查找即可，一次快速查找便可实现一层全部节点的查找，大大提升了查找的效率。
实施例四：
如图6所示：
本申请还能够提供一种基于N叉树的区块链网络的工作装置，基于上述的基于N叉树的区块链网络的工作方法，包括：
子节点查找模块601，用于遍历所述第二层的全部子节点，并判断所述子节点中是否存在用户需要查找的节点；
次级节点查找模块602，用于遍历所述第三层的每个所述子节点所对应的次级节点，判断所述次级节点中是否存在用户需要查找的节点。
其中，本申请中的所述子节点查找模块601和所述次级节点查找模块602相连接。
优选地，由于本申请的基于N叉树的区块链网络的工作装置是基于上述的基于N叉树的区块链网络存储结构实现的区块链网络上的，由于上述的基于N叉树的区块链网络存储结构中节点是按照所述N个子节点的排布规律按照第一时间参数从左至右升序排布；所述M i个次级节点的排布规律按照第二时间参数从左至右升序排布的规律进行排布的，其中，所述第一时间参数和所述第二时间参数由节点接入区块链网络的时间先后顺序决定，越早接入区块链网络的节点对应得时间参数越小，该节点在区块链网络中同层级排布中越靠左。故，本申请的区块链网络工作方法在查找某一个节点时，只需在每一层从左至右依次进行查找即可，一次快速查找便可实现一层全部节点的查找，大大提升了查找的效率。
实施例五：
本申请还能够提供一种计算机存储介质，其上存储有计算机程序，计算机程序被处理器执行时用于实现上述的基于N叉树的区块链网络的工作方法的步骤。
所述存储介质可以是非易失性的，也可以是非易失性的。所述存储介质可以包括：能够携带所述计算机程序代码的任何实体或装置、记录介质、U盘、移动硬盘、磁碟、光盘、计算机存储器、只读存储器(ROM，Read-Only Memory)。
进一步地，所述存储介质可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序等；存储数据区可存储根据区块链节点的使用所创建的数据等。
实施例六：
本申请还提供了一种电子设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，处理器执行计算机程序时实现上述的基于N叉树的区块链网络 的工作方法的步骤。
图7为一个实施例中电子设备的内部结构示意图。如图7所示，该电子设备包括通过系统总线连接的处理器、存储介质、存储器和网络接口。其中，该计算机设备的存储介质存储有操作系统、数据库和计算机可读指令，数据库中可存储有控件信息序列，该计算机可读指令被处理器执行时，可使得处理器实现一种基于N叉树的区块链网络的工作方法。该电设备的处理器用于提供计算和控制能力，支撑整个计算机设备的运行。该计算机设备的存储器中可存储有计算机可读指令，该计算机可读指令被处理器执行时，可使得处理器执行一种基于N叉树的区块链网络的工作方法。该计算机设备的网络接口用于与终端连接通信。本领域技术人员可以理解，图7中示出的结构，仅仅是与本申请方案相关的部分结构的框图，并不构成对本申请方案所应用于其上的计算机设备的限定，具体的计算机设备可以包括比图中所示更多或更少的部件，或者组合某些部件，或者具有不同的部件布置。
该电子设备包括但不限于智能电话、计算机、平板电脑、可穿戴智能设备、人工智能设备、移动电源等。
所述处理器在一些实施例中可以由集成电路组成，例如可以由单个封装的集成电路所组成，也可以是由多个相同功能或不同功能封装的集成电路所组成，包括一个或者多个中央处理器(Central Processing unit，CPU)、微处理器、数字处理芯片、图形处理器及各种控制芯片的组合等。所述处理器是所述电子设备的控制核心(Control Unit)，利用各种接口和线路连接整个电子设备的各个部件，通过运行或执行存储在所述存储器内的程序或者模块(例如执行远端数据读写程序等)，以及调用存储在所述存储器内的数据，以执行电子设备的各种功能和处理数据。
所述总线可以是外设部件互连标准(peripheral component interconnect，简称PCI)总 线或扩展工业标准结构(extended industry standard architecture，简称EISA)总线等。该总线可以分为地址总线、数据总线、控制总线等。所述总线被设置为实现所述存储器以及至少一个处理器等之间的连接通信。
图7仅示出了具有部件的电子设备，本领域技术人员可以理解的是，图7示出的结构并不构成对所述电子设备的限定，可以包括比图示更少或者更多的部件，或者组合某些部件，或者不同的部件布置。
例如，尽管未示出，所述电子设备还可以包括给各个部件供电的电源(比如电池)，优选地，电源可以通过电源管理装置与所述至少一个处理器逻辑相连，从而通过电源管理装置实现充电管理、放电管理、以及功耗管理等功能。电源还可以包括一个或一个以上的直流或交流电源、再充电装置、电源故障检测电路、电源转换器或者逆变器、电源状态指示器等任意组件。所述电子设备还可以包括多种传感器、蓝牙模块、Wi-Fi模块等，在此不再赘述。
进一步地，所述电子设备还可以包括网络接口，可选地，所述网络接口可以包括有线接口和/或无线接口(如WI-FI接口、蓝牙接口等)，通常用于在该电子设备与其他电子设备之间建立通信连接。
可选地，该电子设备还可以包括用户接口，用户接口可以是显示器(Display)、输入单元(比如键盘(Keyboard))，可选地，用户接口还可以是标准的有线接口、无线接口。可选地，在一些实施例中，显示器可以是LED显示器、液晶显示器、触控式液晶显示器以及OLED(Organic Light-Emitting Diode，有机发光二极管)触摸器等。其中，显示器也可以适当的称为显示屏或显示单元，用于显示在电子设备中处理的信息以及用于显示可视化的用户界面。
进一步地，所述计算机可用存储介质可主要包括存储程序区和存储数据区，其中， 存储程序区可存储操作系统、至少一个功能所需的应用程序等；存储数据区可存储根据区块链节点的使用所创建的数据等。
在本申请所提供的几个实施例中，应该理解到，所揭露的设备，装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述模块的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。
所述作为分离部件说明的模块可以是或者也可以不是物理上分开的，作为模块显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。
另外，在本申请各个实施例中的各功能模块可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用硬件加软件功能模块的形式实现。
通过基于N叉树的区块链网络结构，通过N叉树的规律的节点排布，有效提高了区块链网络的节点排布规律性，更为规律的区块链网络能够提高通信领域中数据传输网络中数据在节点之间的传输效率。同时，本申请的基于N叉树的区块链网络结构，当出现故障节点时，可以快速查找到可用空余节点位置，经过共识后，故障节点重新加入整个区块链网络，有效避免了区块链中因为个别节点故障产生的故障节点下的子节点被从整个区块链网络中孤立出来的“孤岛”问题。
以上对本申请的实施例进行了描述。但是，这些实施例仅仅是为了说明的目的，而并非为了限制本申请的范围。本申请的范围由所附权利要求及其等价物限定。不脱离本申请的范围，本领域技术人员可以做出多种替代和修改，这些替代和修改都应落在本申请的范围之内。

Claims (20)

  1. 一种基于N叉树的区块链网络存储结构，其中，包括：
    不少于三层网络结构，所述网络结构中第一层为主节点，第二层为与主节点相连接的N个子节点，其中N为大于2的整数；
    第三层为与每个所述子节点依次连接的M i个次级节点，其中M i为小于等于N的自然数，i＝1、2、……、N。
  2. 根据权利要求1所述的区块链网络存储结构，其中，若所述M i等于N，则此子节点饱和，不能继续连接新的次级节点；
    若M i小于N，则此子节点不饱和，可以继续连接新的次级节点。
  3. 根据权利要求1所述的区块链网络存储结构，其中，所述N个子节点的排布规律按照第一时间参数从左至右升序排布；
    所述M i个次级节点的排布规律按照第二时间参数从左至右升序排布。
  4. 根据权利要求3所述的区块链网络存储结构，其中，所述第一时间参数和第二时间参数由节点加入区块链网络的时间决定。
  5. 根据权利要求4所述的区块链网络存储结构，其中，所述区块链网络包括四层网络结构，第四层为与每个所述次级节点依次连接的P ji个下一级节点，其中P ji为小于等于Mi的自然数，j＝1、2、……、M i。
  6. 根据权利要求5所述的区块链网络存储结构，其中，
    若所述P ji等于M i，则此次级节点饱和，不能继续连接新的下一级节点；
    若P ji小于M i，则此次级节点不饱和，可以继续连接新的下一级节点。
  7. 根据权利要求6所述的区块链网络存储结构，其中，
    所述P ji个下一级节点的排布规律按照第三时间参数从左至右升序排布。
  8. 根据权利要求7所述的区块链网络存储结构，其中，
    所述第三时间参数由节点加入区块链网络的时间决定。
  9. 一种基于N叉树的区块链网络的工作方法，作用于如权利要求1中所述的基于N叉树的区块链网络存储结构实现的区块链网络上，其中，包括：
    S1：遍历所述第二层的全部子节点，判断所述子节点中是否存在用户需要查找的节点，若是则结束流程，若否则继续执行S2；
    S2：遍历所述第三层的每个所述子节点所对应的次级节点，判断所述次级节点中是否存在用户需要查找的节点，若是则结束流程，若否则在下一层网络结构中继续查找。
  10. 根据权利要求9所述的方法，其中，所述遍历所述第二层的全部子节点具体为：
    按照从左至右的顺序依次遍历所述第二层的全部子结点。
  11. 根据权利要求10所述的方法，其中，所述遍历所述第三层的每个所述子节点所对应的次级节点具体为：
    按照从左至右的顺序依次遍历所述第三层的每个所述子结点所对应的次级节点。
  12. 一种基于N叉树的区块链网络的工作装置，所述工作装置用于实现权利要求9中所述的基于N叉树的区块链网络的工作方法，其中，所述工作装置包括：
    子节点查找模块，用于遍历所述第二层的全部子节点，并判断所述子节点中是否存在用户需要查找的节点；
    次级节点查找模块，用于遍历所述第三层的每个所述子节点所对应的次级节点，判断所述次级节点中是否存在用户需要查找的节点。
  13. 根据权利要求12中所述的工作装置，其中，所述遍历所述第二层的全部子节点具体为：
    按照从左至右的顺序依次遍历所述第二层的全部子结点。
  14. 根据权利要求13中所述的工作装置，其中，所述遍历所述第三层的每个所述子节点所对应的次级节点具体为：
    按照从左至右的顺序依次遍历所述第三层的每个所述子结点所对应的次级节点。
  15. 一种电子设备，包括存储器、处理器，所述存储器上存储有可在处理器上运行的计算机程序，其中，所述处理器执行所述计算机程序时实现如下步骤：
    S1：遍历所述第二层的全部子节点，判断所述子节点中是否存在用户需要查找的节点，若是则结束流程，若否则继续执行S2；
    S2：遍历所述第三层的每个所述子节点所对应的次级节点，判断所述次级节点中是否存在用户需要查找的节点，若是则结束流程，若否则在下一层网络结构中继续查找。
  16. 根据权利要求15所述的电子设备，其中，所述遍历所述第二层的全部子节点具体为：
    按照从左至右的顺序依次遍历所述第二层的全部子结点。
  17. 根据权利要求16所述的电子设备，其中，所述遍历所述第三层的每个所述子节点所对应的次级节点具体为：
    按照从左至右的顺序依次遍历所述第三层的每个所述子结点所对应的次级节点。
  18. 一种计算机存储介质，其上存储有计算机程序，其中，所述程序被处理器执行如下应的步骤：
    S1：遍历所述第二层的全部子节点，判断所述子节点中是否存在用户需要查找的节点，若是则结束流程，若否则继续执行S2；
    S2：遍历所述第三层的每个所述子节点所对应的次级节点，判断所述次级节点中是否存在用户需要查找的节点，若是则结束流程，若否则在下一层网络结构中继续查找。
  19. 根据权利要求18所述的介质，其中，所述遍历所述第二层的全部子节点具体为：
    按照从左至右的顺序依次遍历所述第二层的全部子结点。
  20. 根据权利要求19所述的介质，其中，所述遍历所述第三层的每个所述子节点所对应的次级节点具体为：
    按照从左至右的顺序依次遍历所述第三层的每个所述子结点所对应的次级节点。
PCT/CN2021/097180 2020-11-03 2021-05-31 一种区块链网络存储结构、工作方法、装置、介质及设备 Ceased WO2022095429A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202011209045.1A CN112333269A (zh) 2020-11-03 2020-11-03 一种区块链网络存储结构、工作方法、装置、介质及设备
CN202011209045.1 2020-11-03

Publications (1)

Publication Number Publication Date
WO2022095429A1 true WO2022095429A1 (zh) 2022-05-12

Family

ID=74322781

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/097180 Ceased WO2022095429A1 (zh) 2020-11-03 2021-05-31 一种区块链网络存储结构、工作方法、装置、介质及设备

Country Status (2)

Country Link
CN (1) CN112333269A (zh)
WO (1) WO2022095429A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112333269A (zh) * 2020-11-03 2021-02-05 平安科技（深圳）有限公司 一种区块链网络存储结构、工作方法、装置、介质及设备

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109165221A (zh) * 2018-08-16 2019-01-08 北京京东尚科信息技术有限公司 区块链的数据存储方法、装置、区块链节点及存储介质
US20190171849A1 (en) * 2016-08-01 2019-06-06 Cryptowerk Corp. Computer-Implemented Method And System Of Tamper-Evident Recording Of A Plurality Of Service Data Items
US20190318022A1 (en) * 2018-04-11 2019-10-17 Intel Corporation Technologies for flexible tree-based lookups for network devices
CN111209341A (zh) * 2020-01-07 2020-05-29 北京众享比特科技有限公司 区块链的数据存储方法、装置、设备及介质
CN111340623A (zh) * 2020-02-21 2020-06-26 上海优扬新媒信息技术有限公司 一种数据存储方法及装置
CN112333269A (zh) * 2020-11-03 2021-02-05 平安科技（深圳）有限公司 一种区块链网络存储结构、工作方法、装置、介质及设备

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108632385B (zh) * 2018-05-15 2020-08-21 上海海事大学 基于时间序列的多叉树数据索引结构云存储隐私保护方法
CN108846133B (zh) * 2018-07-04 2020-11-27 东北大学 基于b-m树的区块链存储结构、b-m树建立算法及查找算法
CN109039847A (zh) * 2018-08-07 2018-12-18 广州三牛信息科技有限公司 一种利用dmt解决区块链全网消息一致性问题的方法及装置
CN109447630A (zh) * 2018-09-10 2019-03-08 北京安易信科技有限公司 一种支持多行业多应用的区块链构建方法及系统
CN109635165A (zh) * 2018-12-06 2019-04-16 北京磁云数字科技有限公司 基于树形区块链网络的数据汇总方法、装置、设备及介质
CN109600433B (zh) * 2018-12-06 2022-03-29 北京磁云数字科技有限公司 一种系统内数据汇总方法及装置
CN109785170B (zh) * 2019-01-21 2021-01-29 中国联合网络通信集团有限公司 基于区块链的投保方法、基于区块链的投保系统
CN111611315B (zh) * 2020-05-25 2023-11-10 辽宁大学 面向金融大数据的多叉树结构区块链集成优化存储方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190171849A1 (en) * 2016-08-01 2019-06-06 Cryptowerk Corp. Computer-Implemented Method And System Of Tamper-Evident Recording Of A Plurality Of Service Data Items
US20190318022A1 (en) * 2018-04-11 2019-10-17 Intel Corporation Technologies for flexible tree-based lookups for network devices
CN109165221A (zh) * 2018-08-16 2019-01-08 北京京东尚科信息技术有限公司 区块链的数据存储方法、装置、区块链节点及存储介质
CN111209341A (zh) * 2020-01-07 2020-05-29 北京众享比特科技有限公司 区块链的数据存储方法、装置、设备及介质
CN111340623A (zh) * 2020-02-21 2020-06-26 上海优扬新媒信息技术有限公司 一种数据存储方法及装置
CN112333269A (zh) * 2020-11-03 2021-02-05 平安科技（深圳）有限公司 一种区块链网络存储结构、工作方法、装置、介质及设备

Also Published As

Publication number Publication date
CN112333269A (zh) 2021-02-05

Similar Documents

Publication Publication Date Title
US12284092B1 (en) Systems and methods for enterprise information technology (IT) monitoring
US10769148B1 (en) Relocating data sharing operations for query processing
CN110704434A (zh) 图谱最短路径的查询方法、装置、电子设备和存储介质
US20170147621A1 (en) Expression tree interning
US10983815B1 (en) System and method for implementing a generic parser module
WO2018214898A1 (zh) 一种向区块链系统中写入业务数据的方法和装置
WO2020024895A1 (zh) 用于搜索区块链数据的方法、装置及存储介质
JP2021089704A (ja) データ照会方法、装置、電子機器、可読記憶媒体、及びコンピュータープログラム
CN102142032A (zh) 一种分布式文件系统的数据读写方法及系统
WO2020024903A1 (zh) 用于搜索区块链数据的方法、设备及计算机可读存储介质
CN105306481B (zh) 一种访问控制策略规则的操作方法
WO2022134783A1 (zh) 一种区块链网络的构建方法及增加节点方法、介质及设备
US12461969B2 (en) Graph data partitioning
CN103294799A (zh) 一种数据并行批量导入只读查询系统的方法及系统
WO2022095429A1 (zh) 一种区块链网络存储结构、工作方法、装置、介质及设备
US12417247B2 (en) Systems and methods for metadata based path finding
EP3939236B1 (en) Node and cluster management on distributed self-governed ecosystem
CN107103253B (zh) 基于mpi的ac串匹配并行算法的磁盘敏感信息扫描系统
US11567996B2 (en) Collaborative document graph-based user interfaces
Jo et al. A data layout with good data locality for single-machine based graph engines
Rawat et al. A study on challenges of big data and their approaches in present environment
Gu et al. Optimization of service addition in multilevel index model for edge computing
CN116708430A (zh) 注册中心集群调度方法、装置、计算机设备及存储介质
US10853366B2 (en) Cooperative expression visitors
CN116186761A (zh) 一种多关键字查询的动态对称可搜索加密方法

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

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

Country of ref document: EP

Kind code of ref document: A1