WO2022134797A1 - Procédé et appareil de stockage de fragmentation de données, dispositif informatique et support de stockage - Google Patents

Procédé et appareil de stockage de fragmentation de données, dispositif informatique et support de stockage Download PDF

Info

Publication number
WO2022134797A1
WO2022134797A1 PCT/CN2021/124953 CN2021124953W WO2022134797A1 WO 2022134797 A1 WO2022134797 A1 WO 2022134797A1 CN 2021124953 W CN2021124953 W CN 2021124953W WO 2022134797 A1 WO2022134797 A1 WO 2022134797A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
master node
node cluster
data storage
data
Prior art date
Application number
PCT/CN2021/124953
Other languages
English (en)
Chinese (zh)
Inventor
王强
Original Assignee
深圳壹账通智能科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳壹账通智能科技有限公司 filed Critical 深圳壹账通智能科技有限公司
Publication of WO2022134797A1 publication Critical patent/WO2022134797A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • 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
    • 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/24—Querying
    • G06F16/248—Presentation of query results
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Definitions

  • the present application relates to the technical field of block storage, and in particular, to a method, device, computer equipment and storage medium for data fragmentation storage.
  • each blockchain node stores complete blockchain data.
  • the above distributed data storage method can ensure the security of the data stored in the blockchain. Even if the data in a certain node in the blockchain is lost, since all the other nodes in the blockchain store the complete blockchain data, any other node can completely verify whether the entire blockchain data is Tampering occurs.
  • the existing nodes in the blockchain are often single nodes, because the ability of a single node to store data is limited.
  • the inventor realized that when there is too much data to be stored, the storage capacity of a single node of the blockchain cannot meet the needs of practical application scenarios.
  • the present application provides a data fragmentation storage method, device, computer equipment and storage medium, which solve the problem of limited data storage capacity of a single node in the existing blockchain.
  • a first aspect of the present application provides a data fragmentation storage method, the method includes: acquiring a node cluster composed of a plurality of fragmented nodes, the node cluster is used to store the first data in the blockchain.
  • One data the total amount of data storage of the first data is the total amount of the first data storage of any node cluster in the blockchain;
  • the master node in the node cluster is selected by preset selection conditions, and all The remaining shard nodes in the node cluster except the master node are configured as slave nodes; the account book query result is obtained through the master node, and the account book update result is obtained through the master node.
  • a second aspect of the present application provides a computer device including a memory, a processor, and computer-readable instructions stored on the memory and executable on the processor, the processor executing the computer-readable instructions The following steps are implemented during the time: obtaining a node cluster composed of multiple shard nodes, the node cluster is used to store the first data in the blockchain, and the total amount of data storage of the first data is the same as that in the blockchain.
  • a third aspect of the present application provides a computer-readable storage medium, where computer instructions are stored in the computer-readable storage medium, and when the computer instructions are executed on a computer, the computer is caused to perform the following steps: obtaining the A node cluster composed of shard nodes, the node cluster is used to store the first data in the blockchain, and the total data storage amount of the first data is the first data storage total of any node cluster in the blockchain. select the master node in the node cluster through preset selection conditions, and configure the remaining shard nodes in the node cluster except the master node as slave nodes; query the ledger through the master node , obtain the ledger query result, and update the ledger through the master node to obtain the ledger update result.
  • a fourth aspect of the present application provides a data fragmentation storage device, comprising: an acquisition unit configured to acquire a node cluster composed of a plurality of fragmented nodes, the node cluster being used to store first data in the blockchain, The total amount of data storage of the first data is the total amount of first data storage of any node cluster in the blockchain; the master node selection unit is used to select the node cluster obtained by the acquisition unit through preset selection conditions The master node in the node cluster; the configuration unit is used to configure the remaining shard nodes in the node cluster except the master node elected by the master node selection unit as slave nodes; the data processing unit is used to pass The master node selected by the master node selection unit performs a ledger query to obtain a ledger query result, and the master node selected by the master node selection unit performs a ledger update to obtain a ledger update result.
  • a node cluster composed of multiple shard nodes is obtained, the node cluster is used to store the first data in the blockchain, and the total amount of data storage of the first data is any node in the blockchain The total amount of the first data storage of the cluster; the master node in the node cluster is selected by the preset selection conditions, and the remaining shard nodes in the node cluster except the master node are configured as slave nodes; the account book query is performed through the master node, Obtain the result of the ledger query, and update the ledger through the master node to obtain the updated result of the ledger.
  • Fig. 1 is the implementation environment diagram of a kind of data fragmentation storage method provided in one embodiment
  • FIG. 2 is a block diagram of the internal structure of a computer device in one embodiment
  • FIG. 3 is a schematic flowchart of a method for storing data fragments provided by an embodiment of the present disclosure
  • FIG. 4 is a schematic structural diagram of a data fragmentation storage device provided by an embodiment of the present disclosure.
  • the present application provides a data fragmentation storage method, device, computer equipment and storage medium, which solve the problem of limited data storage capacity of a single node in the existing blockchain.
  • FIG. 1 is an implementation environment diagram of a method for storing data fragments provided in an embodiment. As shown in FIG. 1 , the implementation environment includes a computer device 110 and a terminal 120 .
  • the terminal 120 and the computer device 110 may be a smart phone, a tablet computer, a notebook computer, a desktop computer, etc., but are not limited thereto.
  • the computer device 110 and the terminal 110 can be connected through Bluetooth, USB (Universal Serial Bus, Universal Serial Bus) or other communication connection methods, which are not limited in this application.
  • FIG. 2 is a schematic diagram of the internal structure of a computer device in one embodiment.
  • the computer device includes a processor, a non-volatile storage medium, a memory, and a network interface connected through a system bus.
  • the non-volatile storage medium of the computer device stores an operating system, a database and computer-readable instructions
  • the database may store a sequence of control information.
  • the processor can realize a A data fragmentation storage method.
  • the processor of the computer device is used to provide computing and control capabilities and support the operation of the entire computer device.
  • Computer-readable instructions may be stored in the memory of the computer device, and when executed by the processor, the computer-readable instructions may cause the processor to execute a method for storing data slices.
  • the network interface of the computer equipment is used for communication with the terminal connection.
  • an embodiment of the present disclosure provides a data fragmentation storage method.
  • the data fragmentation storage method is applied to the server side, and specifically includes the following method steps:
  • S302 Obtain a node cluster composed of multiple shard nodes, the node cluster is used to store the first data in the blockchain, and the total amount of data storage of the first data is the first data storage of any node cluster in the blockchain total.
  • the number of sharding nodes in the node cluster may be adjusted according to data storage requirements in different application scenarios, and the number of sharding nodes is not specifically limited here.
  • the number of shard nodes in the node cluster will be larger; otherwise, If the total amount of first data storage is smaller and the storage capacity of each shard node in the node cluster is larger, the number of shard nodes in the node cluster is smaller.
  • the master node can store data information and metadata information of each fragment; in addition, the master node can also serve as a routing node and an endorsement node.
  • the master node can store the data information of each shard node in the node cluster, for example, the number information of each shard node in the node cluster, the unique shard number information of each shard node in the node cluster, and the storage In this way, the master node can achieve unified management of the remaining slave nodes in the node cluster. In order to ensure the data security of the blockchain network, the master node can store data that cannot be tampered with.
  • S304 Select the master node in the node cluster according to the preset selection condition, and configure the remaining shard nodes in the node cluster except the master node as slave nodes.
  • the preset selection conditions include: the number of votes obtained by the current shard node in the node cluster exceeds half of the total number of votes, and the number of votes obtained by the shard node is the most, then the shard node obtains the most votes. Elected as the master node in the node cluster.
  • the master node is a peer node, and the master node provides external services on the chain.
  • shard nodes form a node cluster, which is a small cluster.
  • a vote is initiated in the node cluster by preset selection conditions, and the master node is elected from all shard nodes.
  • the node can provide on-chain services to the outside world, and the master node acts as a peer node.
  • the process of selecting the master node in the node cluster through the preset selection conditions is as follows:
  • the voting status of each shard node in the node cluster Obtain the voting status of each shard node in the node cluster, and count the voting status to obtain the statistical results. If the statistical results show that in the node cluster, a shard node has obtained more than half of the votes, and the shard node has obtained the most votes, then the shard node will be elected as the master node.
  • the number of shard nodes in the node cluster is 10.
  • the voting situation is counted to obtain the statistical result. If the statistical results show that the number of votes obtained by a shard node is 6 votes, the shard node has more than half of the total number of shard nodes supported by the shard nodes, and the shard node has the most support, Then, the shard node is elected as the master node, and the remaining shard nodes in the node cluster except the master node are configured as slave nodes.
  • S306 Query the ledger through the master node to obtain the result of the ledger query, and update the ledger through the master node to obtain the update result of the ledger.
  • the master node provides external services on the chain, and the master node acts as a peer node.
  • a blockchain network consists of peer nodes, each of which holds one or more ledgers and one or more smart contracts.
  • Network N consists of three peers P1, P2 and P3. Each peer holds a ledger instance L1; each peer accesses its own ledger copy L1 through the chain code (smart contract) S1. Each peer has some system chaincode.
  • the ledger can be accessed through peers.
  • the interaction between the application and the peer mainly includes ledger query and ledger update.
  • Ledger queries require only three simple sessions; ledger updates require two additional sessions.
  • Applications always access the ledger and chaincode through peers.
  • the SDK provided by Hyperledger allows applications to connect to peers, invoke chaincode to generate transactions, submit transactions to the entire network, and receive events generated during processing.
  • the application executes the chaincode to query or update the ledger.
  • Query results can be returned quickly; however, updating the ledger requires more complex interactions involving application, peer, and ordering service modules.
  • the ordering service module is used to ensure that the ledgers held by all peers are updated synchronously.
  • the master node is a peer node
  • the account book query is performed through the master node to obtain the account book query result, including the following steps:
  • the master node calls the corresponding first chaincode according to the proposal, so that the first chaincode can query the corresponding hyperledger according to the proposal, and obtain the ledger query result returned to the application.
  • the account book update is performed by the master node, and the corresponding account book update result is obtained, including the following steps:
  • the acquisition application generates a transaction according to the returned ledger query result, and sends the transaction to the ordering service module, so that the ordering service module can send the transaction to the master node in the blockchain;
  • the master node invokes the relevant second chain code according to the transaction, so as to update the ledger according to the second chain code, and obtain the corresponding ledger update result.
  • a notification event is generated to notify the application that the update is completed.
  • the data fragmentation storage method provided by the embodiment of the present disclosure further includes the following steps: expanding the first data storage total amount of the node cluster to obtain the expanded second data storage total amount; thus , the total data storage capacity of any node cluster of the blockchain can be expanded.
  • the method further includes the following steps: determining the number of shard nodes to be added in the node cluster; thus, the embodiments of the present application provide
  • the new data sharding storage method can introduce newly added sharding nodes into the current node cluster according to the different requirements of blockchain storage capacity, and automatically allocate storage data to the newly added sharding nodes, and finally achieve an effective The purpose of expanding the storage capacity of any node cluster in the blockchain.
  • the master node in addition to storing the data information of each shard node in the node cluster, can store the data information of each shard node in the node cluster, for example, the number information of each shard node in the node cluster, and the unique data of each shard node in the node cluster.
  • the shard number information and data stored in each shard node can also store the data information of each shard node newly added to the node cluster, for example, the number information of the newly added shard nodes, the newly added shard nodes The unique shard number information of the shard node in the node cluster, and the data stored in each newly added shard node; in this way, the master node can not only achieve unified management of the original slave nodes in the node cluster, but also The unified management of each newly added slave node in the node cluster can be realized, thereby ultimately improving the orderliness and security of data storage.
  • determining the number of shard nodes to be added in the node cluster includes the following steps:
  • the number of shard nodes to be added in the node cluster is determined according to the third total amount of data storage and the data storage amount threshold of any shard node in the node cluster.
  • each sharding node capable of a node cluster can perform automatic sharding, and newly added sharding nodes can be automatically allocated to store data.
  • the storage threshold of each shard node in the node cluster is smaller, and the number of shard nodes in the current node cluster is smaller, it is necessary to join the node cluster
  • the storage threshold of each shard node in the node cluster is larger, and the number of shard nodes in the current node cluster is larger.
  • the sharding in any node cluster in the blockchain can be The number of nodes is dynamically and precisely regulated.
  • a node cluster composed of multiple shard nodes is obtained, the node cluster is used to store the first data in the blockchain, and the total amount of data storage of the first data is any node cluster in the blockchain The first total amount of data storage; select the master node in the node cluster through the preset selection conditions, and configure the remaining shard nodes in the node cluster except the master node as slave nodes; query the ledger through the master node, get The result of the ledger query, and the ledger update through the master node, the ledger update result is obtained. Therefore, using the embodiments of the present application, since a node cluster composed of multiple shard nodes is introduced, compared with the existing single node, the data storage of any node cluster in the blockchain is greatly improved performance.
  • the following is the embodiment of the data fragmentation storage device of the present application, which can be used to execute the embodiment of the data fragmentation storage method of the present application.
  • the embodiments of the data fragmentation storage device of the present application please refer to the embodiments of the data fragmentation storage method of the present application.
  • FIG. 4 shows a schematic structural diagram of a data fragmentation storage device provided by an exemplary embodiment of the present application.
  • the data fragmentation storage device can be implemented as all or a part of the terminal through software, hardware or a combination of the two.
  • the data fragmentation storage device includes an acquisition unit 402 , a master node selection unit 404 , a configuration unit 406 and a data processing unit 408 .
  • the obtaining unit 402 is configured to obtain a node cluster composed of a plurality of sharded nodes, the node cluster is used to store the first data in the blockchain, and the total amount of data storage of the first data is any arbitrary amount in the blockchain.
  • the master node selection unit 404 is configured to select the master node in the node cluster obtained by the obtaining unit 402 through preset selection conditions;
  • a configuration unit 406 configured to configure the remaining shard nodes in the node cluster except the master node selected by the master node selection unit 404 as slave nodes;
  • the data processing unit 408 is configured to query the ledger through the master node selected by the master node selection unit 404 to obtain the result of the ledger query, and update the ledger through the master node selected by the master node selection unit 404 to obtain the updated result of the ledger.
  • the master node is a peer node
  • the data processing unit 408 is specifically used for:
  • the master node calls the corresponding first chaincode according to the proposal, so that the first chaincode can query the corresponding hyperledger according to the proposal, and obtain the ledger query result returned to the application.
  • the data processing unit 408 is also specifically used for:
  • the acquisition application generates a transaction according to the returned ledger query result, and sends the transaction to the ordering service module, so that the ordering service module can send the transaction to the master node in the blockchain;
  • the master node invokes the relevant second chain code according to the transaction, so as to update the ledger according to the second chain code, and obtain the corresponding ledger update result.
  • the data fragmentation storage device further includes:
  • the capacity expansion unit (not shown in FIG. 4 ) is configured to expand the first data storage total amount of the node cluster obtained by the obtaining unit 402 to obtain the expanded second data storage total amount.
  • the data fragmentation storage device further includes:
  • the quantity determination unit (not shown in FIG. 4 ) is configured to determine the quantity of the shard nodes to be added in the node cluster after the expansion unit expands the capacity to obtain the expanded second data storage capacity.
  • the quantity determination unit is specifically used for:
  • the number of shard nodes to be added in the node cluster is determined according to the third total amount of data storage and the data storage amount threshold of any shard node in the node cluster.
  • the preset selection conditions include: the number of votes obtained by the current shard node in the node cluster exceeds half of the total number of votes, and the shard node has the most votes obtained, then the shard node is elected as the node cluster. primary node in .
  • the data fragmentation storage device provided in the above embodiment executes the data fragmentation storage method
  • only the division of the above functional modules is used as an example for illustration.
  • the functional modules of the device are completed, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.
  • the data fragmentation storage device and the data fragmentation storage method provided by the above embodiments belong to the same concept, and the implementation process of the data fragmentation storage method is described in detail in the data fragmentation storage method embodiment, which will not be repeated here.
  • the obtaining unit is used to obtain a node cluster composed of a plurality of sharded nodes, the node cluster is used to store the first data in the blockchain, and the total amount of data storage of the first data is the amount in the blockchain.
  • the total amount of first data storage in any node cluster the master node selection unit selects the master node in the node cluster obtained by the acquisition unit through the preset selection conditions, and the configuration unit is used to select the master node selection unit in the node cluster except the master node selection unit.
  • the remaining shard nodes other than the master node are configured as slave nodes; and the data processing unit is used to query the ledger through the master node elected by the master node selection unit to obtain the ledger query result, and the master node selected by the master node selection unit.
  • the ledger is updated, and the ledger update result is obtained. Therefore, using the embodiments of the present application, since a node cluster composed of multiple shard nodes is introduced, compared with the existing single node, the data storage of any node cluster in the blockchain is greatly improved performance.
  • a computer device in one embodiment, includes a memory, a processor, and a computer program stored in the memory and running on the processor.
  • the processor executes the computer program, the processor implements the following steps: acquiring a plurality of A node cluster composed of sharded nodes, the node cluster is used to store the first data in the blockchain, and the total amount of data storage of the first data is the total amount of the first data storage of any node cluster in the blockchain;
  • the selection criteria select the master node in the node cluster, and configure the remaining shard nodes in the node cluster except the master node as slave nodes; query the ledger through the master node, get the query result of the ledger, and update the ledger through the master node , to get the ledger update result.
  • the present application further provides a computer-readable storage medium
  • the computer-readable storage medium may be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium.
  • the computer-readable storage medium stores computer instructions, and when the computer instructions are executed on the computer, the computer performs the following steps: obtaining a node cluster composed of multiple shard nodes, and the node cluster is used to store the first node in the blockchain.
  • One data, the total amount of data storage of the first data is the total amount of the first data storage of any node cluster in the blockchain;
  • the master node in the node cluster is selected according to the preset selection conditions, and all the nodes in the node cluster except the master node are selected.
  • the remaining shard nodes other than sharding nodes are configured as slave nodes; the account book query result is obtained through the master node, and the account book update result is obtained through the master node.
  • the realization of all or part of the processes in the methods of the above embodiments can be accomplished by instructing relevant hardware through a computer program, and the computer program can be stored in a computer-readable storage medium, and the program is During execution, it may include the processes of the embodiments of the above-mentioned methods.
  • the aforementioned storage medium may be a non-volatile storage medium such as a magnetic disk, an optical disk, a read-only memory (Read-Only Memory, ROM), or a random access memory (Random Access Memory, RAM) or the like.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Business, Economics & Management (AREA)
  • Computational Linguistics (AREA)
  • Software Systems (AREA)
  • Finance (AREA)
  • Accounting & Taxation (AREA)
  • Computer Security & Cryptography (AREA)
  • Probability & Statistics with Applications (AREA)
  • Development Economics (AREA)
  • Bioethics (AREA)
  • Health & Medical Sciences (AREA)
  • Mathematical Physics (AREA)
  • Fuzzy Systems (AREA)
  • Computer Hardware Design (AREA)
  • General Health & Medical Sciences (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Technology Law (AREA)
  • General Business, Economics & Management (AREA)
  • Computing Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne un procédé et un appareil de stockage de fragmentation de données, un dispositif informatique et un support de stockage. Le procédé consiste : à acquérir un groupe de nœuds constitué d'une pluralité de nœuds de fragmentation (S302), le groupe de nœuds étant utilisé pour stocker des premières données dans une chaîne de blocs et la quantité de stockage de données totale des premières données étant une première quantité de stockage de données totale de n'importe quel groupe de nœuds dans la chaîne de blocs ; à sélectionner un nœud maître dans le groupe de nœuds selon une condition de sélection prédéfinie et à configurer les nœuds de fragmentation dans le groupe de nœuds autres que le nœud maître en tant que nœuds esclaves (S304) ; et à réaliser une interrogation de livre de compte au moyen du nœud maître pour obtenir un résultat d'interrogation de livre de compte et à réaliser une mise à jour de livre de compte au moyen du nœud maître pour obtenir un résultat de mise à jour de compte (S306). Par conséquent, selon le procédé décrit, en raison de l'introduction d'un groupe de nœuds constitué d'une pluralité de nœuds de fragmentation, par comparaison avec les nœuds de signal existants, les performances de stockage de données de n'importe quel groupe de nœuds dans la chaîne de blocs sont considérablement améliorées.
PCT/CN2021/124953 2020-12-22 2021-10-20 Procédé et appareil de stockage de fragmentation de données, dispositif informatique et support de stockage WO2022134797A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202011529237.0 2020-12-22
CN202011529237.0A CN112650812A (zh) 2020-12-22 2020-12-22 一种数据分片存储方法、装置、计算机设备和存储介质

Publications (1)

Publication Number Publication Date
WO2022134797A1 true WO2022134797A1 (fr) 2022-06-30

Family

ID=75359048

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/124953 WO2022134797A1 (fr) 2020-12-22 2021-10-20 Procédé et appareil de stockage de fragmentation de données, dispositif informatique et support de stockage

Country Status (2)

Country Link
CN (1) CN112650812A (fr)
WO (1) WO2022134797A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114089924A (zh) * 2021-12-02 2022-02-25 东软集团股份有限公司 区块链账本数据存储系统及方法
CN114089924B (zh) * 2021-12-02 2024-06-04 东软集团股份有限公司 区块链账本数据存储系统及方法

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112650812A (zh) * 2020-12-22 2021-04-13 深圳壹账通智能科技有限公司 一种数据分片存储方法、装置、计算机设备和存储介质
CN114363363B (zh) * 2021-12-31 2024-03-22 杭州趣链科技有限公司 基于多链的数据存储方法、装置、设备及介质
US20240036739A1 (en) * 2022-07-26 2024-02-01 Silicon Motion, Inc. Method and apparatus for performing data fragmentation reduction control of memory device in predetermined communications architecture with aid of fragmentation information detection, and associated computer-readable medium

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109345386A (zh) * 2018-08-31 2019-02-15 阿里巴巴集团控股有限公司 基于区块链的交易共识处理方法及装置、电子设备
US20190140935A1 (en) * 2017-08-03 2019-05-09 Liquineq AG System and method for performance testing of scalable distributed network transactional databases
CN109785136A (zh) * 2019-01-30 2019-05-21 北京京东尚科信息技术有限公司 一种区块链的交易处理方法、客户端及区块链网络
US20190205884A1 (en) * 2017-12-28 2019-07-04 International Business Machines Corporation Converting processes into multiple blockchain smart contracts
CN110570202A (zh) * 2019-09-02 2019-12-13 杭州趣链科技有限公司 一种基于分片技术的混合共识方法
CN111092896A (zh) * 2019-12-23 2020-05-01 北京工商大学 基于优化paxos的食品溯源分布式数据同步方法
CN112650812A (zh) * 2020-12-22 2021-04-13 深圳壹账通智能科技有限公司 一种数据分片存储方法、装置、计算机设备和存储介质

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190140935A1 (en) * 2017-08-03 2019-05-09 Liquineq AG System and method for performance testing of scalable distributed network transactional databases
US20190205884A1 (en) * 2017-12-28 2019-07-04 International Business Machines Corporation Converting processes into multiple blockchain smart contracts
CN109345386A (zh) * 2018-08-31 2019-02-15 阿里巴巴集团控股有限公司 基于区块链的交易共识处理方法及装置、电子设备
CN109785136A (zh) * 2019-01-30 2019-05-21 北京京东尚科信息技术有限公司 一种区块链的交易处理方法、客户端及区块链网络
CN110570202A (zh) * 2019-09-02 2019-12-13 杭州趣链科技有限公司 一种基于分片技术的混合共识方法
CN111092896A (zh) * 2019-12-23 2020-05-01 北京工商大学 基于优化paxos的食品溯源分布式数据同步方法
CN112650812A (zh) * 2020-12-22 2021-04-13 深圳壹账通智能科技有限公司 一种数据分片存储方法、装置、计算机设备和存储介质

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114089924A (zh) * 2021-12-02 2022-02-25 东软集团股份有限公司 区块链账本数据存储系统及方法
CN114089924B (zh) * 2021-12-02 2024-06-04 东软集团股份有限公司 区块链账本数据存储系统及方法

Also Published As

Publication number Publication date
CN112650812A (zh) 2021-04-13

Similar Documents

Publication Publication Date Title
WO2022134797A1 (fr) Procédé et appareil de stockage de fragmentation de données, dispositif informatique et support de stockage
US9971823B2 (en) Dynamic replica failure detection and healing
US11726984B2 (en) Data redistribution method and apparatus, and database cluster
US9239767B2 (en) Selective database replication
US9015177B2 (en) Dynamically splitting multi-tenant databases
CN109547512B (zh) 一种基于NoSQL的分布式Session管理的方法及装置
CN106936899B (zh) 分布式统计分析系统的配置方法及分布式统计分析系统
KR20210071942A (ko) 트랜잭션 처리 방법, 장치 및 기기, 그리고 컴퓨터 저장 매체
US20160112516A1 (en) Distributed storage system, cluster node and range management method thereof
US11068499B2 (en) Method, device, and system for peer-to-peer data replication and method, device, and system for master node switching
KR20120018178A (ko) 객체 저장부들의 네트워크상의 스웜-기반의 동기화
CN106878382B (zh) 一种分布式仲裁集群中动态改变集群规模的方法及装置
US11991094B2 (en) Metadata driven static determination of controller availability
CN110188114A (zh) 一种数据操作的优化方法、装置、系统、设备和存储介质
WO2023045617A1 (fr) Procédé et appareil de traitement de données de transaction, dispositif et support
WO2017012383A1 (fr) Procédé d'enregistrement de service, procédé d'utilisation et appareil correspondant
US20170300553A1 (en) System and methodology for propagating modifications in key-value pairs across a cluster of computers
CN113157450A (zh) 在区块链系统中执行区块的方法及装置
CN110798358B (zh) 分布式服务标识方法、装置、计算机可读介质及电子设备
WO2024001304A1 (fr) Procédé de traitement de données et dispositif associé
WO2024001032A1 (fr) Procédé d'exécution d'une transaction dans un système de chaîne de blocs, et système et nœuds de chaîne de blocs
CN111428114A (zh) Elasticsearch搜索引擎的索引创建方法及装置
CN114205354B (zh) 事件管理系统、事件管理方法、服务器及存储介质
CN112711466B (zh) 悬挂事务巡检方法和装置、电子设备和存储介质
CN110290215B (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: 21908798

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 30.10.2023)

122 Ep: pct application non-entry in european phase

Ref document number: 21908798

Country of ref document: EP

Kind code of ref document: A1