WO2021057482A1 - Procédé et dispositif de génération d'un filtre de bloom dans une chaîne de blocs - Google Patents

Procédé et dispositif de génération d'un filtre de bloom dans une chaîne de blocs Download PDF

Info

Publication number
WO2021057482A1
WO2021057482A1 PCT/CN2020/114235 CN2020114235W WO2021057482A1 WO 2021057482 A1 WO2021057482 A1 WO 2021057482A1 CN 2020114235 W CN2020114235 W CN 2020114235W WO 2021057482 A1 WO2021057482 A1 WO 2021057482A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
bloom filter
topic
bits
topics
Prior art date
Application number
PCT/CN2020/114235
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 WO2021057482A1 publication Critical patent/WO2021057482A1/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/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/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

Definitions

  • the present invention relates to the field of financial technology (Fintech) and the field of blockchain (Blockchain), in particular to a method and device for generating a Bloom filter in a blockchain.
  • each transaction includes at least one event
  • each event includes at least one topic.
  • it may involve searching for an event.
  • the event can be searched by the subject of the event.
  • a Bloom filter with a fixed length of 2048 bits is used to store the subject of the block.
  • Bloom filters can completely store themes of blocks with small transaction volume.
  • a Bloom filter with a fixed length of 2048 bits will inevitably have bit duplication. Phenomenon, the Bloom filter will completely fail and cannot accurately store the subject of the block.
  • the subject of a block with a small transaction volume will waste a lot of storage space, which is an urgent problem to be solved.
  • the embodiments of the present application provide a method and device for generating a bloom filter in a block chain, which solves the problem of the inability to accurately store the subject of the block in the prior art and the waste of a lot of storage space.
  • an embodiment of the present application provides a method for generating a Bloom filter in a blockchain: obtaining the number of topics of a block; according to the number of topics, determining the topics that need to be occupied for storing each topic of the block The number of stored bits; the number of stored bits of the topic is positively correlated with the number of topics; the bloom filter of the block is generated according to the number of stored bits of the topic; the storage space of the bloom filter is greater than The number of bits in the topic storage; the initial value of each bit in the storage space of the Bloom filter is a first preset value; for each topic of the block, the The value of the bits mapped by the theme in the bloom filter is updated from the first preset value to a second preset value, and a bloom filter storing each theme of the block is obtained; the bloom In the storage space of the filter, the number of bits whose value is the second preset value is the number of bits for storing the topic; the Bloom filter is used to determine whether the block contains the subject of the query.
  • the number of topics in the block is first obtained, and the number of topics stored in the topic is determined according to the number of topics, so as to generate the Bloom filter of the block according to the number of bits in the topic storage.
  • the number of topics stored in the topic is positively correlated with the number of topics, and the storage space of the bloom filter is greater than the number of topics stored in the topic. Therefore, when the number of topics in a block is large, the bloom filter The storage space of the filter should also be correspondingly larger. When the number of topics in the block is small, the storage space of the bloom filter will be correspondingly small, so a bloom with a suitable storage space can be generated according to the number of topics in the block. filter.
  • the initial values of the bits in the storage space of the bloom filter are all the first preset values.
  • the theme can be placed in the bloom according to a preset mapping relationship.
  • the value of the bits mapped in the filter is updated from the first preset value to the second preset value, and the Bloom filter storing each theme of the block is obtained.
  • the Bloom filter The storage space of the device is sufficient to meet the storage of each topic of the block, and in the storage space of the Bloom filter, the number of bits whose value is the second preset value is the number of bits stored in the topic , Indicating that the bits of the mapping between the topics do not conflict, and the topic of the block can be accurately stored, so that the query result can be accurately provided when determining whether the block contains the subject of the query later.
  • the number of topic storage bits is proportional to the number of topics, and the number of bits occupied by each topic in the Bloom filter is the same, so that the number of topic storage bits can be conveniently calculated according to the number of topics.
  • a method of determining the number of bits stored in a topic is proposed.
  • the ratio of the number of bits of the topic storage bit to the storage space of the bloom filter is m; m is the storage space usage rate configured by the bloom filter.
  • the discreteness of the theme bits in the Bloom filter can be adjusted according to the setting of m, thereby improving the flexibility of storing the theme through the Bloom filter.
  • the obtaining the number of topics of the block includes: determining the transactions in the block and the events of each transaction; determining the number of index parameters for each event in the block; wherein , The number of index parameters of each event corresponds to a topic; the sum of the number of index parameters of each event in the block is used as the number of topics.
  • the sum of the index parameters of each event in the block is used as the number of topics. Since the index parameters can be used to search for events, it can be ensured that each topic has a corresponding index. All topics can be searched.
  • the present application provides a device for generating bloom filters in a blockchain, including: an acquisition module, configured to acquire the number of topics in a block; a processing module, configured to determine and store the number of topics based on the number of topics.
  • the storage space of the Bloom filter is greater than the number of bits stored in the theme;
  • the initial value of each bit in the storage space of the Bloom filter is a first preset value; and is used to target the block
  • the Bloom filter of each theme; in the storage space of the Bloom filter, the number of bits whose value is the second preset value is the number of bits stored in the theme; the Bloom filter uses To determine whether the subject of the query
  • the ratio of the number of bits of the topic storage bit to the storage space of the bloom filter is m; m is the storage space usage rate configured by the bloom filter.
  • the acquisition module is specifically configured to: determine the transaction in the block and the event of each transaction; determine the number of index parameters for each event in the block; wherein each The number of index parameters of an event corresponds to a topic; the sum of the number of index parameters of each event in the block is taken as the number of topics.
  • an embodiment of the present application provides a computer device including a program or instruction, and when the program or instruction is executed, it is used to execute the method of the foregoing first aspect and each embodiment of the first aspect.
  • an embodiment of the present application provides a storage medium including a program or instruction, and when the program or instruction is executed, it is used to execute the methods of the first aspect and the embodiments of the first aspect.
  • Figure 1 is a schematic diagram of the structure of the blockchain
  • FIG. 2 is a schematic flowchart of steps of a method for generating a Bloom filter in a blockchain according to an embodiment of the application;
  • FIG. 3 is a schematic structural diagram of a device for generating a Bloom filter in a blockchain according to an embodiment of the application.
  • Block chain As shown in Figure 1, the block chain is a chain composed of a series of blocks. In addition to recording the data of this block, each block also records the hash value of the previous block. Through this Way to form a chain.
  • Node Each participant in the network is a node, and the node participates in network formation and data exchange.
  • a node refers to a participant with a unique identity.
  • the node has a complete copy of the ledger and has the ability to participate in the consensus of the blockchain network and the maintenance of the ledger.
  • Smart contract is a computer protocol designed to spread, verify, or execute a contract in an information-based way. Smart contracts allow for trusted transactions without a third party, which are traceable and irreversible.
  • the specific form of the smart contract is the code that is deployed on the blockchain to complete specific functions.
  • Solidity is a mainstream smart contract programming language. Smart contracts written in Solidity language can be called Solidity contracts.
  • a contract address will be generated, and users can call this smart contract through the contract address.
  • the function defined in the smart contract is called the contract interface.
  • the call to the smart contract is to call a contract interface in the contract through the contract address.
  • a transaction is a user's request for an operation on the smart contract interface deployed on the blockchain.
  • the transaction is initiated by the user and sent from the user's client to the blockchain node.
  • the blockchain node After the blockchain node receives the transaction, it calls the corresponding smart contract according to the contract address and interface specified by the transaction.
  • any operation (deploy contract, call contract interface, etc.) is carried out by sending transactions.
  • the transaction is initiated by the user and sent to the blockchain node through the client. After receiving the transaction, the blockchain node will package the transaction into a block and execute it.
  • the transaction receipt stores the execution result of the transaction.
  • a typical transaction receipt contains important information such as the transaction hash, status bits that identify whether the transaction was successfully executed, and logs generated during execution.
  • Bloom filter is a data structure, a more ingenious probabilistic data structure.
  • the core implementation is a large bit array and several hash functions. It is characterized by efficient insertion and query, which can be used to determine whether an element may exist or be certain. does not exist. Ethereum's Bloom filter greatly improves the efficiency of querying events.
  • Event is a convenient interface provided by the virtual machine log infrastructure, which can be predefined and used to generate logs in a predetermined format.
  • an event call
  • it will trigger parameters to be stored in the transaction log (a special data structure on the blockchain).
  • These logs are associated with the address of the contract and recorded in the blockchain.
  • Each transaction receipt of the blockchain will contain 0 or more log records.
  • the logs represent the events triggered by the smart contract.
  • a block can include multiple transactions, each transaction includes at least one event, and each event includes at least one topic.
  • the current method is to store the subject of the block through a fixed-length Bloom filter.
  • a Bloom filter will be completely invalid and cannot accurately store the subject of the block; for the subject of a block with a small transaction volume, It will also cause a lot of waste of storage space. This situation does not meet the needs of banks and other financial institutions, and cannot guarantee the efficient operation of various businesses of financial institutions.
  • Step 201 Obtain the subject count of the block.
  • Step 202 According to the number of topics, determine the number of topic storage bits needed to store each topic of the block.
  • the number of theme storage bits is positively correlated with the number of themes.
  • Step 203 Generate a Bloom filter of the block according to the number of bits stored in the theme.
  • the storage space of the Bloom filter is greater than the number of bits of the theme storage; the initial value of each bit in the storage space of the Bloom filter is a first preset value;
  • Step 204 For each topic of the block, update the bit value of the topic mapped in the Bloom filter from the first preset value to the second preset according to a preset mapping relationship Value to obtain the Bloom filter storing each topic of the block.
  • the number of bits whose value is the second preset value is the number of bits stored in the topic; the bloom filter is used to determine whether a block contains query data theme.
  • Step 201 occurs after the block is executed, and the number of topics of the block is obtained, which can be obtained by counting the number of topics included in all transaction receipts of the block. Specifically, the following implementation methods can be adopted:
  • step 202 the relationship between the number of theme storage bits and the number of themes may be as follows:
  • K T*n; where K is the number of stored bits for the topic; T is the number of topics; n is the number of bits occupied by each topic of the block in the Bloom filter.
  • the number of bits occupied by each theme in the bloom filter can be freely set according to requirements. For example, each theme occupies 3 bits in the bloom filter.
  • configuration items may be added in advance: the storage space utilization rate of the bloom filter; m is the storage space utilization rate configured by the bloom filter. Under the configuration of m, the ratio of the number of bits of the theme storage bit to the storage space of the Bloom filter is m.
  • This configuration item affects the query efficiency of the Bloom filter and the storage space of the Bloom filter.
  • m can be set to 10%, which is not limited here.
  • the storage space size of the bloom filter of the current block can be calculated according to the number of topics of the block and the usage rate of the bloom filter bits:
  • Bloom filter size the number of topics in the block*3/bloom filter space usage rate; unit: bit.
  • the initial value of each bit in the storage space of the Bloom filter generated in step 203 is the first preset value.
  • the The value of the bits mapped by the theme in the bloom filter is updated from the first preset value to a second preset value, and a bloom filter storing each theme of the block is obtained.
  • the first preset value is 0 and the second preset value is 1. It is also possible that the first preset value is 1 and the second preset value is 0.
  • step 204 it is necessary to ensure that: in the storage space of the bloom filter, the number of bits whose value is the second preset value is the number of bits for storing the theme. In other words, each bit can only uniquely identify one topic, and there will be no conflicts in storage between the topics.
  • each topic of the block is correspondingly stored in the Bloom filter.
  • you can do so by querying a target topic in the target event. If the target subject can be queried, the target event is determined to exist; otherwise, the target event does not exist.
  • the size of the Bloom filter in block one is:
  • the size of the Bloom filter in block two is:
  • the number of topics in the block is first obtained, and the number of topic storage bits is determined according to the number of topics, so as to generate the layout of the block according to the number of topics stored in the topic.
  • Long filter because the number of topics stored in the topic is positively correlated with the number of topics, and the storage space of the Bloom filter is greater than the number of topics stored in the topic, so when the number of topics in a block is large, The storage space of the bloom filter should also be correspondingly larger. When the number of topics of the block is small, the storage space of the bloom filter will be correspondingly small, so a suitable one can be generated according to the number of topics of the block. Bloom filter for storage space.
  • the initial values of the bits in the storage space of the bloom filter are all the first preset values.
  • the theme can be placed in the bloom according to a preset mapping relationship.
  • the value of the bits mapped in the filter is updated from the first preset value to the second preset value, and the Bloom filter storing each theme of the block is obtained.
  • the Bloom filter The storage space of the device is sufficient to meet the storage of each topic of the block, and in the storage space of the Bloom filter, the number of bits whose value is the second preset value is the number of bits stored in the topic , Indicating that the bits of the mapping between the topics do not conflict, and the topic of the block can be accurately stored, so that the query result can be accurately provided when determining whether the block contains the subject of the query later.
  • the present application provides a device for generating Bloom filters in a blockchain, including: an acquisition module 301, configured to acquire the number of topics in a block; and a processing module 302, configured to obtain the number of topics based on the number of topics.
  • the number of theme storage bits required to store each theme of the block is positively correlated with the number of topics; according to the number of theme storage bits, the layout of the block is generated Long filter; the storage space of the bloom filter is greater than the number of bits stored in the theme; the initial value of each bit in the storage space of the bloom filter is a first preset value; and For each topic of the block, the value of the bit mapped by the topic in the Bloom filter is updated from the first preset value to the second preset value according to the preset mapping relationship, and the storage is obtained.
  • the bloom filter of each theme of the block in the storage space of the bloom filter, the number of bits whose value is the second preset value is the number of bits stored in the theme; Bloom filter is used to determine whether the subject of the query is included in the block.
  • the ratio of the number of bits of the topic storage bit to the storage space of the bloom filter is m; m is the storage space usage rate configured by the bloom filter.
  • the obtaining module 301 is specifically configured to: determine the transaction in the block and the event of each transaction; determine the number of index parameters for each event in the block; wherein, each The number of index parameters of each event corresponds to one topic; the sum of the number of index parameters of each event in the block is used as the number of topics.
  • An embodiment of the application provides a computer device, including a program or instruction, when the program or instruction is executed, it is used to execute a method for generating a Bloom filter in a blockchain provided in an embodiment of the application and any one Optional method.
  • the embodiment of the application provides a storage medium, including a program or instruction, when the program or instruction is executed, it is used to execute a method for generating a bloom filter in a blockchain provided in the embodiment of the application and any one Optional method.
  • this application can be provided as methods, systems, or computer program products. Therefore, this application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, this application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, optical storage, etc.) containing computer-usable program codes.
  • a computer-usable storage media including but not limited to disk storage, optical storage, etc.
  • These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device.
  • the device implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

Landscapes

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

Abstract

Procédé et dispositif de génération d'un filtre de Bloom dans une chaîne de blocs. Le procédé comprend : l'acquisition du nombre de sujets d'un bloc (201) ; en fonction du nombre de sujets, la détermination du nombre de bits de stockage de sujets devant être occupés pour stocker les sujets du bloc (202), le nombre de bits de stockage de sujets étant corrélé positivement avec le nombre de sujets ; la génération d'un filtre de Bloom du bloc en fonction du nombre de bits de stockage de sujets (203) ; et pour chaque sujet du bloc, selon une relation de mappage prédéfinie, la mise à jour de la valeur du bit mappée par le sujet dans le filtre de Bloom d'une première valeur prédéfinie à une seconde valeur prédéfinie, de façon à obtenir le filtre de Bloom pour stocker les sujets du bloc (204). Lorsque le procédé ci-dessus est appliqué à la technologie financière, l'espace de stockage du filtre de Bloom est suffisant, de telle sorte que le stockage de divers sujets du bloc peut être satisfait, les bits du mappage entre les sujets n'entrent pas en conflit, et une interrogation précise peut être obtenue lorsque l'on détermine par la suite si le bloc contient un sujet interrogé.
PCT/CN2020/114235 2019-09-26 2020-09-09 Procédé et dispositif de génération d'un filtre de bloom dans une chaîne de blocs WO2021057482A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910918040.7A CN110704438B (zh) 2019-09-26 2019-09-26 一种区块链中布隆过滤器的生成方法及装置
CN201910918040.7 2019-09-26

Publications (1)

Publication Number Publication Date
WO2021057482A1 true WO2021057482A1 (fr) 2021-04-01

Family

ID=69196497

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/114235 WO2021057482A1 (fr) 2019-09-26 2020-09-09 Procédé et dispositif de génération d'un filtre de bloom dans une chaîne de blocs

Country Status (2)

Country Link
CN (1) CN110704438B (fr)
WO (1) WO2021057482A1 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110704438B (zh) * 2019-09-26 2023-10-03 深圳前海微众银行股份有限公司 一种区块链中布隆过滤器的生成方法及装置
GB2595489A (en) * 2020-05-28 2021-12-01 Nchain Holdings Ltd Probabilistic membership test for blockchain transaction outputs
CN112950211B (zh) * 2021-05-14 2021-07-30 腾讯科技（深圳）有限公司 一种交易验重方法、装置、设备以及介质
CN116341023B (zh) * 2023-05-24 2023-08-29 北京百度网讯科技有限公司 基于区块链的业务地址验证方法、装置、设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105187468A (zh) * 2014-06-11 2015-12-23 苹果公司 用于服务发现的动态布隆过滤器操作
CN107247773A (zh) * 2017-06-07 2017-10-13 北京邮电大学 一种基于区块链的在分布式数据库中进行交易查询的方法
US20170344987A1 (en) * 2016-05-24 2017-11-30 Mastercard International Incorporated Method and system for an efficient consensus mechanism for permssioned blockchains using bloom filters and audit guarantees
CN109977261A (zh) * 2019-04-02 2019-07-05 北京奇艺世纪科技有限公司 一种数据请求的处理方法、装置及服务器
CN110704438A (zh) * 2019-09-26 2020-01-17 深圳前海微众银行股份有限公司 一种区块链中布隆过滤器的生成方法及装置

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10198325B2 (en) * 2016-05-24 2019-02-05 Mastercard International Incorporated Method and system for desynchronization recovery for permissioned blockchains using bloom filters
WO2018144302A1 (fr) * 2017-01-31 2018-08-09 Rush Thomas Jay Moteur de traitement de données de chaîne de blocs
CN107368527B (zh) * 2017-06-09 2020-06-30 东南大学 基于数据流的多属性索引方法
CN107357843B (zh) * 2017-06-23 2020-06-16 东南大学 基于数据流结构的海量网络数据查找方法
CN107273556A (zh) * 2017-08-23 2017-10-20 上海点融信息科技有限责任公司 区块链数据索引方法和设备
CN110097363A (zh) * 2019-04-12 2019-08-06 深圳前海微众银行股份有限公司 一种基于区块链的事件发布、事件订阅的方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105187468A (zh) * 2014-06-11 2015-12-23 苹果公司 用于服务发现的动态布隆过滤器操作
US20170344987A1 (en) * 2016-05-24 2017-11-30 Mastercard International Incorporated Method and system for an efficient consensus mechanism for permssioned blockchains using bloom filters and audit guarantees
CN107247773A (zh) * 2017-06-07 2017-10-13 北京邮电大学 一种基于区块链的在分布式数据库中进行交易查询的方法
CN109977261A (zh) * 2019-04-02 2019-07-05 北京奇艺世纪科技有限公司 一种数据请求的处理方法、装置及服务器
CN110704438A (zh) * 2019-09-26 2020-01-17 深圳前海微众银行股份有限公司 一种区块链中布隆过滤器的生成方法及装置

Also Published As

Publication number Publication date
CN110704438A (zh) 2020-01-17
CN110704438B (zh) 2023-10-03

Similar Documents

Publication Publication Date Title
WO2021057482A1 (fr) Procédé et dispositif de génération d'un filtre de bloom dans une chaîne de blocs
US10255108B2 (en) Parallel execution of blockchain transactions
US20210357390A1 (en) Systems and methods for blockchain interlinking and relationships
US11263211B2 (en) Data partitioning and ordering
CN108389118B (zh) 资产管理系统、方法及装置、电子设备
TWI737157B (zh) 基於區塊鏈的分級儲存方法及裝置、電子設備
WO2021017436A1 (fr) Procédé et appareil de synchronisation de données d'état de chaîne de blocs, et dispositif électronique
US20210006506A1 (en) Allocating virtual resource based on block chain
WO2021017435A1 (fr) Procédé et appareil de stockage de données d'état de chaîne de blocs, et dispositif électronique
WO2021017421A1 (fr) Procédé et dispositif de récupération de données d'état de chaîne de blocs, et dispositif électronique
WO2020258853A1 (fr) Procédé et appareil de stockage hiérarchique basé sur une chaîne de blocs, et dispositif électronique
CN110032598B (zh) 字段更新方法及装置、电子设备
CN111597015B (zh) 事务处理方法、装置、计算机设备及存储介质
CN110032599B (zh) 数据结构的读取及更新方法、装置、电子设备
WO2020258856A1 (fr) Procédé et appareil de stockage hiérarchique sur la base d'une chaîne de blocs et dispositif électronique
CN111898139A (zh) 数据读写方法及装置、电子设备
WO2021047541A1 (fr) Procédé et dispositif destinés à obtenir une relation de dépendance de transaction dans une chaîne de blocs
CN110023925A (zh) 生成、访问和显示沿袭元数据
CN111444192B (zh) 块链式账本中全局状态的哈希的生成方法、装置及设备
CN111444196A (zh) 块链式账本中全局状态的哈希的生成方法、装置及设备
WO2021027612A1 (fr) Procédé et appareil pour exécuter une transaction dans une chaîne de blocs
US20210263905A1 (en) Blockchain based hierarchical data storage
WO2024001025A1 (fr) Procédé de nettoyage de données en mémoire cache de pré-exécution et nœud de chaîne de blocs
CN108121807A (zh) Hadoop环境下多维索引结构OBF-Index的实现方法
US20240281473A1 (en) Storing and searching for data in data stores

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

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 250822)

122 Ep: pct application non-entry in european phase

Ref document number: 20867875

Country of ref document: EP

Kind code of ref document: A1