CN112100171A - Method and device for establishing content index for random consensus diagram book - Google Patents
Method and device for establishing content index for random consensus diagram book Download PDFInfo
- Publication number
- CN112100171A CN112100171A CN202010815318.0A CN202010815318A CN112100171A CN 112100171 A CN112100171 A CN 112100171A CN 202010815318 A CN202010815318 A CN 202010815318A CN 112100171 A CN112100171 A CN 112100171A
- Authority
- CN
- China
- Prior art keywords
- content
- data
- identity card
- node
- target
- 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.)
- Granted
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
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- 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/23—Updating
- G06F16/2308—Concurrency control
- G06F16/2315—Optimistic concurrency control
- G06F16/2322—Optimistic concurrency control using timestamps
-
- 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/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
-
- 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
- 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
Abstract
The application provides a method and a device for establishing content index for a random consensus diagram account book, and relates to the technical field of block chains. When transaction data are collected, the hash value of the data content of the transaction data is obtained through calculation, a content identity card is generated according to the hash value of the data content, the node position and the content identity card of the data content are bound and stored, meanwhile, a distributed hash table is established at all nodes of the schema book system, the content identity card bound with the node position of the data content is issued to the distributed hash table of the nodes, a relation index of the hash value of the data content and the data content storage node is established in the nodes of the schema book, and a basis for locating the data storage node to be inquired is provided.
Description
Technical Field
The present application relates to the field of block chain technologies, and in particular, to a method and an apparatus for establishing a content index for a random consensus schema book.
Background
Blockchains, represented by bitcoin, have received a great deal of attention from the industry and academia due to their decentralized, difficult-to-tamper, non-repudiation, and data-consistent nature. The block chain technology mainly adopts node state machine replication, namely all nodes of the whole network achieve the agreement of instructions and data, but the block chain has system bottleneck and can not be expanded because the whole network can only generate one effective block in a period of time.
In order to solve the performance bottleneck of the first generation block chain technology represented by the bitcoin and realize the expandability of the block chain, a scheme structure is proposed to replace the chain structure with a diagram structure, which is different from the chain structure, each block in the block chain of the diagram structure has a plurality of front-drive blocks and rear-drive blocks, and a random consensus algorithm is applied to the diagram structure, such as PBFT, Paxos, Raft and the like, and the random consensus algorithm is essentially that part of nodes are selected from nodes of the whole network to verify and backup newly generated blocks, so that the block chain (diagram book) of the diagram structure based on the random consensus can generate a plurality of effective blocks in parallel within a period of time, the number of transaction strokes of the whole system is greatly increased, and the storage capacity is expandable.
After various data are recorded in the image type ledger, various query requirements of a user, such as account information query, account balance, transaction history, transaction content and the like, need to be met, which is the core functional requirement of the distributed ledger including the block chain and the image type ledger and is the basis of tracing and evidence storage, and therefore, efficient query operation is essential. However, in the graph book adopting random consensus, a single node randomly stores part of block data, so that the storage position of the block data is unknown, and the block data queried by a user cannot be quickly located and acquired.
Disclosure of Invention
According to the method and the device for establishing the content index for the random consensus schema book, when transaction data are collected, the hash value of the data content of the transaction data is obtained through calculation, the content identity card is generated according to the hash value of the data content, the node position of the data content and the content identity card are bound and stored, meanwhile, a distributed hash table is established at all nodes of the schema book system, the content identity card bound with the node position of the data content is issued to the distributed hash table of the nodes, the relation index of the hash value of the data content and the data content storage node is established in the nodes of the schema book, and the basis for positioning the data storage node to be inquired is provided.
A first aspect of the embodiments of the present application provides a method for establishing a content index for a random consensus diagram ledger, where the method includes:
a first target node which issues data content calculates the data content to be issued by using a target hash function to obtain a hash value of the data content to be issued;
the first target node obtains a validity period according to the generation time of the data content to be issued;
the first target node generates a content identity card according to the hash value and the data validity period;
the first target node determines a plurality of second target nodes for storing the content identification cards in the image type account book system by using a preset routing algorithm;
the first target node acquires a storage position of the data content to be issued and binds the storage position to the content identity card;
sending the content identification cards of the binding storage positions to the plurality of second target nodes;
and the second target node stores the received content identity card of the binding storage position in a local node.
Optionally, the method further comprises:
establishing a distributed hash table at each node of the graph type account book system;
the second target node stores the received content identity card of the binding storage location in a local node, and the method includes:
generating a time stamp according to the time of receiving the content identity card of the binding storage position;
and writing the content identification card of the binding storage position and the time stamp into a local distributed hash table.
Optionally, the method further comprises:
the second target node traverses the content identity card stored in the local distributed hash table at intervals of preset time;
determining invalid content identity cards in a local distributed hash table according to the validity period of data in each content identity card;
determining the content identity cards to be issued secondarily in the local distributed hash table according to the corresponding time stamps of the content identity cards;
the second target node determines a plurality of third target nodes for storing the content identity cards to be issued for the second time in the graph book system by using the preset routing algorithm;
the second target node sends the content identification cards to be issued for the second time to the plurality of third target nodes;
and the second target node removes the invalid content identity card.
Optionally, the method further comprises:
the first target node acquires the data type of the data content and the identification of the target hash function;
the first target node generates a content identity card according to the hash value and the data validity period, and the method comprises the following steps:
generating a content identity card data structure according to the hash value, the data validity period, the data type of the data content and the identification of the target hash function;
setting an encoding mode of the content identity card data structure, and adding an encoding prefix corresponding to the encoding mode to the content identity card data structure;
adding a blank reserved field to the content identity card data structure;
and determining the content identity card data structure added with the reserved field and the encoding prefix as the content identity card.
Optionally, the obtaining, by the first target node, a storage location of the data content to be published includes:
when the data content is block data, the first target node determines the node positions of the production block node and the witness node as the storage position of the data content to be issued;
when the data content is transaction data, the first target node determines the node positions of the plurality of second target nodes as the storage positions of the data content to be issued.
A second aspect of the present application provides an apparatus for establishing a content index for a random consensus diagram ledger, where the apparatus includes:
the hash value calculation module is used for enabling a first target node which issues data content to calculate the data content to be issued by using a target hash function so as to obtain a hash value of the data content to be issued;
a validity period obtaining module, configured to enable the first target node to obtain a validity period according to the generation time of the data content to be published;
the content identity card generating module is used for enabling the first target node to generate a content identity card according to the hash value and the data validity period;
a second target node obtaining module, configured to enable the first target node to determine, in the graph book system, a plurality of second target nodes that store the content identification cards by using a preset routing algorithm;
a storage location binding module, configured to enable the first target node to obtain a storage location of the data content to be published, and bind the storage location to the content identity card;
a content identification card sending module, configured to send the content identification cards in the bound storage locations to the plurality of second target nodes;
and the content identity card storage module is used for enabling the second target node to store the received content identity card at the binding storage position in a local node.
Optionally, the apparatus further comprises:
a hash table establishing module, configured to establish a distributed hash table at each node of the graph ledger system;
the content identification card storage module comprises:
the time stamp generating module is used for generating a time stamp according to the time of receiving the content identity card of the binding storage position;
and the writing module is used for writing the content identity card of the binding storage position and the time stamp into a local distributed hash table.
Optionally, the apparatus further comprises:
the traversal hash table module is used for enabling the second target node to traverse the content identity card stored in the local distributed hash table at preset time intervals;
the invalid content identity card determining module is used for determining invalid content identity cards in the local distributed hash table according to the validity period of data in each content identity card;
the secondary release content determining module is used for determining the content identity cards to be secondarily released in the local distributed hash table according to the corresponding time stamp of each content identity card;
a third target node obtaining module, configured to enable the second target node to determine, in the graph book system, a plurality of third target nodes for storing the content identification cards to be issued for the second time by using the preset routing algorithm;
the content identity card secondary issuing module is used for enabling the second target node to send the content identity cards to be issued for the second time to the plurality of third target nodes;
and the invalid content identity card removing module is used for removing the invalid content identity card from the second target node.
Optionally, the apparatus further comprises:
an identifier obtaining module of the target hash function, configured to enable the first target node to obtain the data type of the data content and the identifier of the target hash function;
the content identification card generating module comprises:
the identity card data structure generation submodule is used for generating a content identity card data structure according to the hash value, the data validity period, the data type of the data content and the identification of the target hash function;
the encoding prefix adding submodule is used for setting an encoding mode of the content identity card data structure and adding an encoding prefix corresponding to the encoding mode to the content identity card data structure;
a reserved field adding submodule for adding a blank reserved field to the content identity card data structure;
and the content identity card determining submodule is used for determining the content identity card data structure added with the reserved field and the encoding prefix as the content identity card.
Optionally, the storage location binding module includes:
a first storage location determining submodule, configured to determine, by the first target node, node locations of a production block node and a witness node as storage locations of the data content to be published when the data content is block data;
and the second storage position determining submodule is used for enabling the first target node to determine the node positions of the plurality of second target nodes as the storage positions of the data content to be issued when the data content is transaction data.
A third aspect of embodiments of the present application provides a readable storage medium, on which a computer program is stored, which, when executed by a processor, implements the steps in the method according to the first aspect of the present application.
A fourth aspect of the embodiments of the present application provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the computer program to implement the steps of the method according to the first aspect of the present application.
In the application, a node issuing data content generates a content identity card according to a hash value of the data content, then binds a node position storing the data content with the content identity card, finally issues the content identity card bound with the node position to other nodes, meanwhile, each node of the graph type account book system is provided with a distributed hash table locally, other nodes receiving the content identity card bound with the node position write the content identity card and the node position into the local distributed hash table, and a mapping relation between the hash value and the node position storing the data content is established. Through indexes of data contents and node positions for storing the data contents, the nodes for storing the data contents can be directly positioned by the hash values of the data contents, and as each node in the graph type account book system has the hash value of the block data, any node can determine the hash value corresponding to the query contents, thereby providing a basis for rapidly querying data in a randomly identified graph type account book.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed to be used in the description of the embodiments of the present application will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive exercise.
Fig. 1 is a block configuration diagram of a bdridge schema book in the embodiment of the present application;
fig. 2 is a block connection diagram of a bdridge schema book in the embodiment of the present application;
fig. 3 is a schematic diagram of a bdlenger schema account book selection node performing random consensus according to an embodiment of the present application;
FIG. 4 is a flowchart of the steps for creating a content index for a graph ledger of random consensus according to an embodiment of the present application;
FIG. 5 is a schematic structural diagram of a content ID card generated in an embodiment of the present application;
FIG. 6 is a diagram illustrating a second target node storing a content ID card of a binding node location according to an embodiment of the present application;
FIG. 7 is a diagram illustrating a DHT structure for writing timestamps according to an embodiment of the present application;
FIG. 8 is a flowchart illustrating steps of issuing a content ID card twice according to an embodiment of the present application;
fig. 9 is a schematic diagram of an apparatus for creating a content index for a graph book of random consensus according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The BDLedger schema ledger is a credible schema ledger which is researched and developed for solving the problems of credible circulation and full life cycle management and control of data in a big data scene, and the BDLedger adopts a data organization technology of a directed acyclic graph and a random witness consensus mechanism, so that the block production speed and the consensus efficiency are greatly improved, and the expandability of the schema ledger is realized.
The block data structure of the bdridge is shown in fig. 1, where fig. 1 is a block mechanism diagram of a bdridge schema book in the embodiment of the present application. The block consists of a block head and a block body, each block points to three precursor blocks, the transaction stored in the block body is 1000, and the root hash obtained by calculation according to Merkle Tree (Merckel Tree) formed by the transaction is stored in the block head. Each block is 100KB in size. As shown in fig. 2, fig. 2 is a block connection diagram of a bdridge schema book in the embodiment of the present application. The blocks are linked in a mode of directed acyclic graph.
The bdlegger block header carries the hash value of the predecessor block, the block version number, the time stamp of the generation block, the creator identifier (signature of the node that generates the block), the hash value of the transaction data (hash of the content obtained based on the merkel tree), and the block stores the collected transaction data.
As shown in fig. 3, fig. 3 is a schematic diagram of a BDLedger schema account book selection node performing random consensus according to the embodiment of the present application. The BDLedger adopts nRW (N-room Witness) random consensus, each node receives 1000 transaction data, the 1000 received transaction data are packaged to generate a block, three nodes are randomly selected from nodes in the whole network to serve as Witness nodes, and signature verification is carried out on the block. The production block nodes (the nodes for generating the blocks) and the witness nodes store the signed blocks in the respective nodes, the production block nodes synchronize block heads to other nodes of the whole network, each witness node sends the complete blocks to two randomly selected backup nodes for backup storage, and finally, each block is randomly distributed in 10 nodes of the whole network. The random storage and backup strategy of the block improves the difficulty and the cost of tampering the block, enhances the safety of the system, and simultaneously improves the difficulty of inquiring the block. Since the block data is part of nodes randomly stored in the network of the BDLedger graph ledger, each node in the network must be traversed to determine the location information of the block.
In view of the above problems, an embodiment of the present application provides a method for establishing a content index for a randomly identified schema book, which establishes a mapping relationship between data randomly stored in any node of a BDLedger schema book system and a storage node in a manner of issuing a issued content identification card to a distributed hash table, so as to provide a basis for quickly locating the storage node of data.
Establishing a distributed hash table at each node of the graph type account book system;
the nodes referred to in this application are: a plurality of computer servers, which are provided with a schema account book, are arranged in each organization, and each node is provided with a node ID which can uniquely identify the node. For example, in a government affairs service system, institutions such as banks and tax authorities establish a tax administration schema book system for storing transaction data, and computer servers deployed by institutions such as banks and tax authorities for generating blocks, verifying blocks and backup blocks are nodes for maintaining the tax administration schema book system.
The image type ledger system refers to a system composed of local image type ledgers maintained by each node. The diagram ledger system comprises all nodes maintaining the diagram ledger and also comprises a diagram block chain of all the nodes.
The distributed hash table is arranged on each node according to the characteristics of the data storage structure in the graph type account book. The block generation node of the BDLedger schema book system can acquire the hash value of the transaction data stored in the block from the block in the local BDLedger block chain, so that the index of the hash value of the data content and the address of the data content storage node is established, and the functions of initiating data query at any node and locating the storage position of the data are realized.
Meanwhile, the decentralized and extensible characteristic of the DHT is consistent with the decentralized and extensible characteristic of the schema book, and the DHT is correspondingly extended under the condition that nodes of the schema book system are increased and the schema of the nodes is enough for block chain extension, so that the extensibility of indexes of blocks and storage nodes established on the basis of the DHT is ensured.
As shown in fig. 4, fig. 4 is a flowchart of a step of establishing a content index for a graph ledger of random consensus according to an embodiment of the present application. The method is applied to the schema ledger system, in particular to the BDLedger schema ledger system.
Step S401: a first target node which issues data content calculates the data content to be issued by using a target hash function to obtain a hash value of the data content to be issued;
the data content is transaction data in a block or node transaction pool generated by the node.
The first target node to publish the data content is one or more of a production block node that generates a new block at a current time, a witness node that verifies the new block, and a node that publishes the transaction data to other nodes.
When the first target node is a production node that generates a new block at the current time or a witness node that verifies the new block, the target hash function is a hash function used to calculate transaction data in the block body of the new block. For example, the BDLedger schema ledger system uses a hash algorithm to assemble transaction data of a block into a mercker tree, and then stores the mercker tree in the block header as a hash value of the transaction data, where the mercker tree is a target hash function.
When the first target node is one or more of the nodes that distribute the single or multiple transaction data to other nodes, the target hash function is user-selected for the hash function that will calculate the hash value of the transaction data. Hashing algorithms such as MD5(Message-Digest Algorithm), Murmur3 Murmurhash, FNV-1a FNV, SpookyHash and the like can be used as the target hashing function.
When the first target node is a production block node which generates a new block at the current time or a witness node which verifies the new block, the data content to be released is the new block generated by the production block node at the current time. When the first target node is one or more nodes of nodes which issue single or multiple transaction data to other nodes, the data content to be issued is one or multiple transaction data determined by any node in the image ledger system in a transaction pool according to received data issuing operation.
Generally, when transaction data in a transaction pool reach a preset threshold (1000 transactions), a node packs the transaction data to obtain a block, randomly identifies the block, and randomly backs up the block by a node which randomly identifies the block, wherein the data content to be released is released, that is, a new block generated by each node is the data content to be released. In a specific case, for example, if the user selects to publish the target transaction data individually, the individually published target transaction data is the data content to be published.
Step S402: the first target node obtains a validity period according to the generation time of the data content to be issued;
when the data content to be distributed is transaction data, the generation time of the data content is the time when the transaction data is collected. When the data content to be distributed is a chunk, the generation time of the data content is the generation time of the chunk.
Step S403: the first target node generates a content identity card according to the hash value and the data validity period;
before generating the content identity card, the first target node also obtains the data type of the data content and the identification of the target hash function. The first target node acquires the data type of the data content and the identification of the target hash function;
the data types include transaction data and block data. The identifier of the target hash function may be preset, for example, identifiers 1, 2, 3, 4, and 5 may be respectively set for hash functions MD5(Message-Digest Algorithm), murmurur 3 murmurmurmurhash, FNV-1a FNV, SpookyHash, and Merkle Tree.
The transaction data is single or multiple data received by the node, and the block data is transaction data packaged in batches in a block generated by the node.
As shown in fig. 5, fig. 5 is a schematic structural diagram of a content identification card generated in the embodiment of the present application. The specific steps for generating the content identity card are as follows:
8 bits indicate the length of the field, e.g., the length of the coding prefix is 8 bits. The length of the hash value is based on the length of a hash value actually obtained by carrying out hash calculation on the data content.
Generating a content identity card data structure according to the hash value, the data validity period, the data type of the data content and the identification of the target hash function;
and combining the hash value, the data validity period, the data type of the data content and the identification of the target hash function to obtain the content identity card data structure.
Setting an encoding mode of the content identity card data structure, and adding an encoding prefix corresponding to the encoding mode to the content identity card data structure;
encoding refers to converting the content id card into a data structure that is displayed at the client. For example, the content identification card compiled by the code is coded to obtain a png format picture, and the png format picture is displayed on the client side and is convenient for a user to obtain. It should be noted that, the encoding method is determined for the data structure of the content id card, and what is encoded by the encoding method is the content id card finally obtained.
Adding a blank reserved field to the content identity card data structure;
and determining the content identity card data structure added with the reserved field and the encoding prefix as the content identity card.
The hash value in the content identity card is obtained by calculating transaction data by using a target hash function, and the hash values of different data contents are different, so that the hash value can be used as a unique identifier of the data contents. The data types correspond to different query requirements, the data types are used as the content of the content identity card, the mapping relation between the hash value and the data types is established, a basis for acquiring the data types according to the hash value is provided, and a basis is provided for meeting the service query requirements of different data types. The schema account book has different application scenes, different requirements on safety and different requirements on a target hash function used for encrypting transaction data, and in order to support the expandability of the target hash function, the application establishes a mapping relation between a hash value and the target hash function by taking the identification of the target hash function as the content of a content identity card. Meanwhile, in order to more conveniently realize the encoding and decoding of the hash value and the data structure which can be displayed on the client, the encoding prefix of the encoding mode is used as the content of the content identity card, and the mapping relation between the hash value and the encoding mode is established.
The reserved field is one byte reserved for subsequent upgrade optimization of the content identity card in the embodiment of the application.
The content identity card stored in the distributed hash table of each node in the release mode has the mapping relation between the hash value and the coding mode, the mapping relation between the target hash function and the mapping relation between the hash value and the data type, and the optimized reserved field for updating the content identity card, and can perform corresponding processing on different types of data according to the content identity card, so that the expandability of the distributed hash table of the node is realized. In other words, each node can establish a plurality of mapping relationships using one distributed hash table without establishing a plurality of distributed hash tables for hash values of data contents of different data types or establishing a plurality of distributed hash tables for hash values calculated using different target hash functions. The plurality of mapping relationships include a mapping relationship between a hash value and an encoding method, a mapping relationship between a target hash function, a mapping relationship between a hash value and a data content storage node, and the like.
Step S404: the first target node determines a plurality of second target nodes for storing the content identification cards in the image type account book system by using a preset routing algorithm;
the second target node is a node storing the content identity card.
The preset routing algorithm is to call a P2P network layer of the node, search N nodes closest to the xor distance of the hash value in the graph book system by using a KAD (Kademlia protocol) algorithm, where the value of N is determined by specific query requirements, and the larger the value of N is, the more nodes store the content id card with the hash value are, and the more comprehensive the index is established for the transaction data corresponding to the hash value. N is the number of second target nodes. The XOR distance is the XOR distance of the hash value and the node ID.
Specifically, the first target node selects K nodes closest to the xor distance of the hash value from neighboring nodes of the local node, simultaneously sends requests to the K nodes, respectively inquires about N pieces of node information closest to the xor distance of the hash value from the neighboring nodes of the nodes, then simultaneously sends requests to new N nodes, and repeats the steps of inquiring about the information of the N nodes closest to the xor distance of the hash value from the neighboring nodes of the nodes until the xor distance of the neighboring nodes of the inquired node to the hash value is 0 or no node closer to the xor distance of the inquired node to the hash value exists, the local node is arranged in ascending order from all the return nodes according to the xor distance to the hash value, and selects the first N nodes closest to the xor distance. The values of K and N are determined by specific query requirements, and K and N can be equal.
Step S405: the first target node acquires a storage position of the data content to be issued and binds the storage position to the content identity card;
when the data content is block data, the first target node determines the node positions of the production block node and the witness node as the storage position of the data content to be issued; the first target node can also determine the node position of the backup node as the storage position of the data content to be published. The node location may be a node ID.
When the data content is transaction data, the first target node determines the node positions of the plurality of second target nodes as the storage positions of the data content to be issued.
When the data content is transaction data, the first target node binds the transaction data and the content identity card and then simultaneously issues the transaction data and the content identity card.
Step S406: sending the content identification cards of the binding storage positions to the plurality of second target nodes;
step S407: and the second target node stores the received content identity card of the binding storage position in a local node.
The second target node stores the received content identification card of the binding storage position locally, namely, the content identification card of the binding storage position is written into a local hash table.
As shown in fig. 6, fig. 6 is a schematic diagram of a second target node storing a content id card of a binding node location according to an embodiment of the present application. The content ID card and the node position corresponding to the same data content are stored in the same storage unit of the distributed hash table. After the second target node stores the content identity card and the node position in the distributed hash table, the hash table of the second target node has information of the storage node of the block generated by the first target node, and the following manner of quickly querying data can be provided: based on the hash table of the second target node, the storage node of the query data can be positioned according to the hash value of the query data, so as to directly obtain the queried transaction data, or directly request the queried block data from the storage node, and the queried data is requested from the traversed nodes one by one without traversing each node until a certain node returns data.
In another embodiment of the present application, after receiving the content id card, the second target node further performs the following operations:
generating a time stamp according to the time of receiving the content identity card of the binding storage position;
and writing the content identification card of the binding storage position and the time stamp into a local distributed hash table.
Fig. 7 is a schematic structural diagram of a distributed hash table with a timestamp written in an embodiment of the present application. As shown in fig. 7, the content id card, the timestamp, and the node location correspond one-to-one. The dynamic secondary release of the content identity card is realized by combining the validity period of data in the time stamp Hell content identity card.
Due to the drawings, there are two cases in the ledger system: firstly, any node is possible to leave the network, and secondly, a new node is added into the network at any time. For the first case, when some of the N nodes storing a block or transaction data content id leave the network, the loss of some content id may be caused, resulting in a decrease in query efficiency; for the second case, the xor distance between the newly added node ID and the hash value of a certain issued content ID may be smaller than the xor distance between the node ID of the node currently storing the content ID and the hash value. In view of the above problems, the present application utilizes a method of dynamically issuing a content id card in a distributed hash table twice, so that the content id card is always stored in N nodes closest to the xor distance of the hash value of the content id card, so as to ensure the availability of the query function.
As shown in fig. 8, fig. 8 is a flowchart illustrating steps of issuing a content id card twice according to an embodiment of the present application.
Step S801: the second target node traverses the content identity card stored in the local distributed hash table at intervals of preset time;
the method comprises the steps that preset time is set through a timer of a node, a program is triggered every T time when the preset time is T, the program scans a distributed hash table of the node, and the content identity card needing to be issued twice at present in the distributed hash table of the node is determined.
Step S802: determining invalid content identity cards in a local distributed hash table according to the validity period of data in each content identity card;
because each node in the graph type account book system can issue the content of the local distributed hash table for the second time, in order to avoid the excessive content identification card stored in the distributed hash table, the invalid content identification card is deleted through the validity period set by the content identification card, the size of the distributed hash table is maintained, and the excessive data caused by the fact that the distributed content identification card and the secondarily issued content identification card are continuously received by the distributed hash table is avoided.
The general validity period may be longer than the preset time set by the timer, and the content identification card whose timestamp is shorter than the preset time set by the timer from the current time is not confirmed as an invalid content identification card, so that the content identification card is guaranteed to be issued to other nodes for a second time before being deleted.
Step S803: determining the content identity cards to be issued secondarily in the local distributed hash table according to the corresponding time stamps of the content identity cards;
if each node reissues all the entries of the distributed hash table after the timer is triggered, N nodes storing a certain content identity card will receive N-1 repeated publishing requests from other N-1 nodes within the next time period T, which may cause the increase of network traffic. In order to avoid the situation, each node only chooses to reissue the content identification cards with the time interval being more than T from the current time interval according to the time stamp of each content identification card. Therefore, only by paying attention to the incomplete synchronization of the time points of triggering the secondary release tasks of all nodes in the whole network, the content identity card can be guaranteed to be released again by one node in one time interval.
Step S804: the second target node determines a plurality of third target nodes for storing the content identity cards to be issued for the second time in the graph book system by using the preset routing algorithm;
the second target node may determine, in the graph ledger system, a method of determining, by using a preset routing algorithm, a plurality of third target nodes for storing content identification cards to be issued for the second time, and may determine, by referring to the first target node, a method of determining, in the graph ledger system, a plurality of second target nodes for storing content identification cards by using a preset routing algorithm.
The third target node is a node for storing the content identity card issued by the second target node for the second time.
Step S805: the second target node sends the content identification cards to be issued for the second time to the plurality of third target nodes
Step S806: and the second target node removes the invalid content identity card.
In the application, a node issuing data content generates a content identity card according to a hash value of the data content, then binds a node position storing the data content with the content identity card, finally issues the content identity card bound with the node position to other nodes, meanwhile, each node of the graph type account book system is provided with a distributed hash table, other nodes receiving the content identity card bound with the node position write the content identity card and the node position into a local distributed hash table, and a mapping relation between the hash value and the node position storing the data content is established. Through indexes of data contents and node positions for storing the data contents, the nodes for storing the data contents can be directly positioned by the hash values of the data contents, and as each node in the graph type account book system has the hash value of the block data, any node can determine the hash value corresponding to the query contents, thereby providing a basis for rapidly querying data in a randomly identified graph type account book.
Based on the same inventive concept, the embodiment of the application provides a device for establishing a content index for a random consensus diagram book. Fig. 9 is a schematic diagram of an apparatus for creating a content index for a graph book of random consensus according to an embodiment of the present application. As shown in fig. 9, the apparatus includes:
a hash value calculating module 901, configured to calculate, by using a target hash function, a data content to be published by a first target node that publishes the data content, so as to obtain a hash value of the data content to be published;
a validity period obtaining module 902, configured to enable the first target node to obtain a validity period according to the generation time of the data content to be published;
a content identity card generation module 903, configured to enable the first target node to generate a content identity card according to the hash value and the data validity period;
a second target node obtaining module 904, configured to enable the first target node to determine, in the graph book system, a plurality of second target nodes storing the content identification cards by using a preset routing algorithm;
a storage location binding module 905, configured to enable the first target node to obtain a storage location of the data content to be published, and bind the storage location to the content identity card;
a content id sending module 906, configured to enable the content id of the bound storage location to be sent to the plurality of second target nodes;
a content id storage module 907, configured to enable the second target node to store the received content id at the bound storage location in a local node.
Optionally, the apparatus further comprises:
a hash table establishing module, configured to establish a distributed hash table at each node of the graph ledger system;
the content identification card storage module comprises:
the time stamp generating module is used for generating a time stamp according to the time of receiving the content identity card of the binding storage position; and the writing module is used for writing the content identity card of the binding storage position and the time stamp into a local distributed hash table.
Optionally, the apparatus further comprises:
the traversal hash table module is used for enabling the second target node to traverse the content identity card stored in the local distributed hash table at preset time intervals; the invalid content identity card determining module is used for determining invalid content identity cards in the local distributed hash table according to the validity period of data in each content identity card; the secondary release content determining module is used for determining the content identity cards to be secondarily released in the local distributed hash table according to the corresponding time stamp of each content identity card; a third target node obtaining module, configured to enable the second target node to determine, in the graph book system, a plurality of third target nodes for storing the content identification cards to be issued for the second time by using the preset routing algorithm; the content identity card secondary issuing module is used for enabling the second target node to send the content identity cards to be issued for the second time to the plurality of third target nodes; and the invalid content identity card removing module is used for removing the invalid content identity card from the second target node.
Optionally, the apparatus further comprises:
an identifier obtaining module of the target hash function, configured to enable the first target node to obtain the data type of the data content and the identifier of the target hash function;
the content identification card generating module comprises:
the identity card data structure generation submodule is used for generating a content identity card data structure according to the hash value, the data validity period, the data type of the data content and the identification of the target hash function; the encoding prefix adding submodule is used for setting an encoding mode of the content identity card data structure and adding an encoding prefix corresponding to the encoding mode to the content identity card data structure; a reserved field adding submodule for adding a blank reserved field to the content identity card data structure; and the content identity card determining submodule is used for determining the content identity card data structure added with the reserved field and the encoding prefix as the content identity card.
Optionally, the storage location binding module includes:
a first storage location determining submodule, configured to determine, by the first target node, node locations of a production block node and a witness node as storage locations of the data content to be published when the data content is block data;
and the second storage position determining submodule is used for enabling the first target node to determine the node positions of the plurality of second target nodes as the storage positions of the data content to be issued when the data content is transaction data.
Based on the same inventive concept, another embodiment of the present application provides a readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps in the method for establishing a content index for a graph ledger of random consensus as described in any of the above embodiments of the present application.
Based on the same inventive concept, another embodiment of the present application provides an electronic device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the computer program, the electronic device implements the steps of the method for establishing a content index for a randomly-identified schema book according to any of the above embodiments of the present application.
For the device embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, refer to the partial description of the method embodiment.
The embodiments in the present specification are described in a progressive or descriptive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.
As will be appreciated by one of skill in the art, embodiments of the present application may be provided as a method, apparatus, or computer program product. Accordingly, embodiments of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
Embodiments of the present application are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus, and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing terminal to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing terminal to cause a series of operational steps to be performed on the computer or other programmable terminal to produce a computer implemented process such that the instructions which execute on the computer or other programmable terminal provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present application have been described, additional variations and modifications of these embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including the preferred embodiment and all such alterations and modifications as fall within the true scope of the embodiments of the application.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or terminal that comprises the element.
The method and the device for establishing the content index for the random consensus diagram book provided by the application are introduced in detail, and the description of the embodiment is only used for helping to understand the method and the core idea of the application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.
Claims (10)
1. A method for establishing content index for a random consensus diagram ledger is characterized in that the method is applied to a diagram ledger system; the method comprises the following steps:
a first target node which issues data content calculates the data content to be issued by using a target hash function to obtain a hash value of the data content to be issued;
the first target node obtains a validity period according to the generation time of the data content to be issued;
the first target node generates a content identity card according to the hash value and the data validity period;
the first target node determines a plurality of second target nodes for storing the content identification cards in the image type account book system by using a preset routing algorithm;
the first target node acquires a storage position of the data content to be issued and binds the storage position to the content identity card;
sending the content identification cards of the binding storage positions to the plurality of second target nodes;
and the second target node stores the received content identity card of the binding storage position in a local node.
2. The method of claim 1, further comprising:
establishing a distributed hash table at each node of the graph type account book system;
the second target node stores the received content identity card of the binding storage location in a local node, and the method includes:
generating a time stamp according to the time of receiving the content identity card of the binding storage position;
and writing the content identification card of the binding storage position and the time stamp into a local distributed hash table.
3. The method of claim 2, further comprising:
the second target node traverses the content identity card stored in the local distributed hash table at intervals of preset time;
determining invalid content identity cards in a local distributed hash table according to the validity period of data in each content identity card;
determining the content identity cards to be issued secondarily in the local distributed hash table according to the corresponding time stamps of the content identity cards;
the second target node determines a plurality of third target nodes for storing the content identity cards to be issued for the second time in the graph book system by using the preset routing algorithm;
the second target node sends the content identification cards to be issued for the second time to the plurality of third target nodes;
and the second target node removes the invalid content identity card.
4. The method of claim 1, further comprising:
the first target node acquires the data type of the data content and the identification of the target hash function;
the first target node generates a content identity card according to the hash value and the data validity period, and the method comprises the following steps:
generating a content identity card data structure according to the hash value, the data validity period, the data type of the data content and the identification of the target hash function;
setting an encoding mode of the content identity card data structure, and adding an encoding prefix corresponding to the encoding mode to the content identity card data structure;
adding a blank reserved field to the content identity card data structure;
and determining the content identity card data structure added with the reserved field and the encoding prefix as the content identity card.
5. The method according to claim 1, wherein the obtaining, by the first target node, the storage location of the data content to be published includes:
when the data content is block data, the first target node determines the node positions of the production block node and the witness node as the storage position of the data content to be issued;
when the data content is transaction data, the first target node determines the node positions of the plurality of second target nodes as the storage positions of the data content to be issued.
6. A device for establishing content index for a random consensus diagram ledger is characterized in that the device is applied to a diagram ledger system; the device comprises:
the hash value calculation module is used for enabling a first target node which issues data content to calculate the data content to be issued by using a target hash function so as to obtain a hash value of the data content to be issued;
a validity period obtaining module, configured to enable the first target node to obtain a validity period according to the generation time of the data content to be published;
the content identity card generating module is used for enabling the first target node to generate a content identity card according to the hash value and the data validity period;
a second target node obtaining module, configured to enable the first target node to determine, in the graph book system, a plurality of second target nodes that store the content identification cards by using a preset routing algorithm;
a storage location binding module, configured to enable the first target node to obtain a storage location of the data content to be published, and bind the storage location to the content identity card;
a content identification card sending module, configured to send the content identification cards in the bound storage locations to the plurality of second target nodes;
and the content identity card storage module is used for enabling the second target node to store the received content identity card at the binding storage position in a local node.
7. The apparatus of claim 6, further comprising:
a hash table establishing module, configured to establish a distributed hash table at each node of the graph ledger system;
the content identification card storage module comprises:
the time stamp generating module is used for generating a time stamp according to the time of receiving the content identity card of the binding storage position;
and the writing module is used for writing the content identity card of the binding storage position and the time stamp into a local distributed hash table.
8. The apparatus of claim 7, further comprising:
the traversal hash table module is used for enabling the second target node to traverse the content identity card stored in the local distributed hash table at preset time intervals;
the invalid content identity card determining module is used for determining invalid content identity cards in the local distributed hash table according to the validity period of data in each content identity card;
the secondary release content determining module is used for determining the content identity cards to be secondarily released in the local distributed hash table according to the corresponding time stamp of each content identity card;
a third target node obtaining module, configured to enable the second target node to determine, in the graph book system, a plurality of third target nodes for storing the content identification cards to be issued for the second time by using the preset routing algorithm;
the content identity card secondary issuing module is used for enabling the second target node to send the content identity cards to be issued for the second time to the plurality of third target nodes;
and the invalid content identity card removing module is used for removing the invalid content identity card from the second target node.
9. The apparatus of claim 6, further comprising:
an identifier obtaining module of the target hash function, configured to enable the first target node to obtain the data type of the data content and the identifier of the target hash function;
the content identification card generating module comprises:
the identity card data structure generation submodule is used for generating a content identity card data structure according to the hash value, the data validity period, the data type of the data content and the identification of the target hash function;
the encoding prefix adding submodule is used for setting an encoding mode of the content identity card data structure and adding an encoding prefix corresponding to the encoding mode to the content identity card data structure;
a reserved field adding submodule for adding a blank reserved field to the content identity card data structure;
and the content identity card determining submodule is used for determining the content identity card data structure added with the reserved field and the encoding prefix as the content identity card.
10. The apparatus of claim 6, wherein the storage location binding module comprises:
a first storage location determining submodule, configured to determine, by the first target node, node locations of a production block node and a witness node as storage locations of the data content to be published when the data content is block data;
and the second storage position determining submodule is used for enabling the first target node to determine the node positions of the plurality of second target nodes as the storage positions of the data content to be issued when the data content is transaction data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010815318.0A CN112100171B (en) | 2020-08-12 | 2020-08-12 | Method and device for establishing content index for random consensus diagram book |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010815318.0A CN112100171B (en) | 2020-08-12 | 2020-08-12 | Method and device for establishing content index for random consensus diagram book |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112100171A true CN112100171A (en) | 2020-12-18 |
| CN112100171B CN112100171B (en) | 2021-06-25 |
Family
ID=73753690
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010815318.0A Active CN112100171B (en) | 2020-08-12 | 2020-08-12 | Method and device for establishing content index for random consensus diagram book |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112100171B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114070887A (en) * | 2021-11-17 | 2022-02-18 | 安徽中科晶格技术有限公司 | Wandering compression system and method based on graph structure |
| CN115277733A (en) * | 2022-07-29 | 2022-11-01 | 北京智融云河科技有限公司 | Block header synchronization method and device, electronic equipment and storage medium |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107347009A (en) * | 2017-08-30 | 2017-11-14 | 北京知金链网络技术有限公司 | Block chain one-dimensional random number common recognition election method |
| CN107657438A (en) * | 2017-09-18 | 2018-02-02 | 联动优势科技有限公司 | A kind of block chain generation method, data verification method, node and system |
| CN107786339A (en) * | 2016-08-31 | 2018-03-09 | 陈新 | It is layered controllable alliance's block catenary system |
| CN108462568A (en) * | 2018-02-11 | 2018-08-28 | 西安电子科技大学 | A kind of secure file storage and sharing method based on block chain |
| CN108573737A (en) * | 2017-12-25 | 2018-09-25 | 北京金山云网络技术有限公司 | A kind of storage method of electronic health record, device, equipment and storage medium |
| CN108710681A (en) * | 2018-05-18 | 2018-10-26 | 腾讯科技（深圳）有限公司 | File acquisition method, device, equipment and storage medium |
| US20180337847A1 (en) * | 2017-05-16 | 2018-11-22 | Peking University Shenzhen Graduate School | Indexing a multi-layer blockchain system |
| US20180337781A1 (en) * | 2017-05-18 | 2018-11-22 | Bank Of America Corporation | Block Chain Encoding With Fair Delay For Distributed Network Devices |
| CN109785130A (en) * | 2018-12-17 | 2019-05-21 | 金蝶软件（中国）有限公司 | Block chain is known together method, apparatus, computer equipment and storage medium at random |
| US20190305957A1 (en) * | 2018-04-02 | 2019-10-03 | Ca, Inc. | Execution smart contracts configured to establish trustworthiness of code before execution |
| US20200036519A1 (en) * | 2016-09-29 | 2020-01-30 | Nokia Technologies Oy | Method and apparatus for trusted computing |
| CN111080445A (en) * | 2019-10-28 | 2020-04-28 | 北京大学 | Credible certificate storing method and system based on graph structure |
| CN111159288A (en) * | 2019-12-16 | 2020-05-15 | 郑杰骞 | Method, system, device and medium for storing, verifying and realizing chain structure data |
| CN111475538A (en) * | 2019-01-24 | 2020-07-31 | 北京京东尚科信息技术有限公司 | Data processing method, device and storage medium |
| US20200250747A1 (en) * | 2019-01-31 | 2020-08-06 | Salesforce.Com, Inc. | Systems, methods, and apparatuses for dynamically assigning nodes to a group within blockchains based on transaction type and node intelligence using distributed ledger technology (dlt) |
-
2020
- 2020-08-12 CN CN202010815318.0A patent/CN112100171B/en active Active
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107786339A (en) * | 2016-08-31 | 2018-03-09 | 陈新 | It is layered controllable alliance's block catenary system |
| US20200036519A1 (en) * | 2016-09-29 | 2020-01-30 | Nokia Technologies Oy | Method and apparatus for trusted computing |
| US20180337847A1 (en) * | 2017-05-16 | 2018-11-22 | Peking University Shenzhen Graduate School | Indexing a multi-layer blockchain system |
| US20180337781A1 (en) * | 2017-05-18 | 2018-11-22 | Bank Of America Corporation | Block Chain Encoding With Fair Delay For Distributed Network Devices |
| CN107347009A (en) * | 2017-08-30 | 2017-11-14 | 北京知金链网络技术有限公司 | Block chain one-dimensional random number common recognition election method |
| CN107657438A (en) * | 2017-09-18 | 2018-02-02 | 联动优势科技有限公司 | A kind of block chain generation method, data verification method, node and system |
| CN108573737A (en) * | 2017-12-25 | 2018-09-25 | 北京金山云网络技术有限公司 | A kind of storage method of electronic health record, device, equipment and storage medium |
| CN108462568A (en) * | 2018-02-11 | 2018-08-28 | 西安电子科技大学 | A kind of secure file storage and sharing method based on block chain |
| US20190305957A1 (en) * | 2018-04-02 | 2019-10-03 | Ca, Inc. | Execution smart contracts configured to establish trustworthiness of code before execution |
| CN108710681A (en) * | 2018-05-18 | 2018-10-26 | 腾讯科技（深圳）有限公司 | File acquisition method, device, equipment and storage medium |
| CN109785130A (en) * | 2018-12-17 | 2019-05-21 | 金蝶软件（中国）有限公司 | Block chain is known together method, apparatus, computer equipment and storage medium at random |
| CN111475538A (en) * | 2019-01-24 | 2020-07-31 | 北京京东尚科信息技术有限公司 | Data processing method, device and storage medium |
| US20200250747A1 (en) * | 2019-01-31 | 2020-08-06 | Salesforce.Com, Inc. | Systems, methods, and apparatuses for dynamically assigning nodes to a group within blockchains based on transaction type and node intelligence using distributed ledger technology (dlt) |
| CN111080445A (en) * | 2019-10-28 | 2020-04-28 | 北京大学 | Credible certificate storing method and system based on graph structure |
| CN111159288A (en) * | 2019-12-16 | 2020-05-15 | 郑杰骞 | Method, system, device and medium for storing, verifying and realizing chain structure data |
Non-Patent Citations (3)
| Title |
|---|
| FEDERICO MATTEO BENCIC等: "Distributed Ledger Technology：blockchain compared to directed acyclic graph", 《2018 IEEE 38TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEM》 * |
| KIM S等: "A Survey of Scalability Solutions on Blockchain", 《2018 INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY CONVERGENCE》 * |
| 毛志来等: "区块链性能扩展与安全研究", 《信息网络安全》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114070887A (en) * | 2021-11-17 | 2022-02-18 | 安徽中科晶格技术有限公司 | Wandering compression system and method based on graph structure |
| CN115277733A (en) * | 2022-07-29 | 2022-11-01 | 北京智融云河科技有限公司 | Block header synchronization method and device, electronic equipment and storage medium |
| CN115277733B (en) * | 2022-07-29 | 2024-02-20 | 北京智融云河科技有限公司 | Block head synchronization method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112100171B (en) | 2021-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112100171B (en) | Method and device for establishing content index for random consensus diagram book | |
| TWI733328B (en) | Method and device for sending certifiable messages across chains | |
| CN109189751B (en) | Data synchronization method based on block chain and terminal equipment | |
| CN109002725B (en) | Data processing system based on block chain | |
| CN111080445B (en) | Credible certificate storing method and system based on graph structure | |
| CN112116347B (en) | Random consensus mechanism-based graph account data release method and device | |
| CN113094396B (en) | Data processing method, device, equipment and medium based on node memory | |
| CN110493148B (en) | Block processing, block consensus and block synchronization method and device | |
| CN111405019B (en) | Data processing method, data processing device, computer equipment and storage medium | |
| CN109246190B (en) | Network addressing method, data editing method, device and storage medium | |
| CN112417001B (en) | Data processing method based on block chain network and related equipment | |
| CN110765205A (en) | Block chain based metadata management method, system and computer storage medium | |
| CN109525678B (en) | Block chain network system and corresponding node device discovery method | |
| CN110597922A (en) | Data processing method, device, terminal and storage medium | |
| CN111611321A (en) | Data storage method and device and block chain system | |
| CN112699094A (en) | File storage method, data retrieval method, corresponding device and system | |
| CN103369002A (en) | A resource downloading method and system | |
| CN112100234B (en) | Content addressing method and system of graph type account book based on random consensus | |
| CN111694502B (en) | Block chain data storage method, device, equipment and storage medium | |
| CN107493309B (en) | File writing method and device in distributed system | |
| CN107147708A (en) | A kind of peer-to-peer network redundant data balance method and system | |
| Skjegstad et al. | Low complexity set reconciliation using Bloom filters | |
| KR101600717B1 (en) | Method and apparatus for download virtual machine operating system image | |
| CN110719322B (en) | Data cross storage method based on block chain cross-chain | |
| CN114880300A (en) | Processing method and device based on block chain file, processor and electronic equipment |
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 |