Performing map iterations in a blockchain-based system

A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:

• maintaining data representing a forest that stores a plurality of keys of a plurality of key-value pairs that are stored in a map, the map being stored in a blockchain node of a blockchain network, the forest comprising a plurality of trees, each tree comprising a respective plurality of storage nodes, each storage node storing a subset of the plurality of keys;
• receiving a request to delete a key of a key-value pair from the forest, the key-value pair stored in the map;
• computing a first hash value of the key using a first hash function;
• determining one of the plurality of trees that stores the key based on the first hash value, wherein determining the one of the plurality of trees that stores the key based on the first hash value comprises:
• performing a modulo operation on the first hash value to generate a first modulo value;
• and
• determining the one of the plurality of trees that stores the key based on the first modulo value;
• determining a target storage node of the one of the plurality of trees that stores the key;
• and
• deleting the key from the target storage node.

A computer-implemented system, comprising:

• one or more computers;
• and
• one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations comprising:
• maintaining data representing a forest that stores a plurality of keys of a plurality of key-value pairs that are stored in a map, the map being stored in a blockchain node of a blockchain network, the forest comprising a plurality of trees, each tree comprising a respective plurality of storage nodes, each storage node storing a subset of the plurality of keys;
• receiving a request to delete a key of a key-value pair from the forest, the key-value pair stored in the map;
• computing a first hash value of the key using a first hash function;
• determining one of the plurality of trees that stores the key based on the first hash value, wherein determining the one of the plurality of trees that stores the key based on the first hash value comprises:
• performing a modulo operation on the first hash value to generate a first modulo value;
• and
• determining the one of the plurality of trees that stores the key based on the first modulo value;
• determining a target storage node of the one of the plurality of trees that stores the key;
• and
• deleting the key from the target storage node.