Distributed database systems and structures

A distributed database system comprising, at each of a plurality of database peers:

• storage media storing a set of values in a data repository using a tree of chunks;
• logic configured to generate the tree, the generating comprising:
• dividing the set of values amongst first chunks;
• determining first chunk identifiers for the first chunks by, for each chunk of the first chunks, inputting one or more values of the chunk into a function to calculate a chunk identifier for the chunk;
• dividing the first chunk identifiers amongst second chunks;
• determining second chunk identifiers for the second chunks by, for each chunk of the second chunks, inputting one or more of the first chunk identifiers in the chunk into the function to calculate a chunk identifier for the chunk;
• storing each chunk of the first chunks and the second chunks, respectively, at a storage address determined from the chunk identifier determined for chunk;
• and
• storing a root chunk that comprises the second chunk identifiers at a storage address determined based on inputting the second chunk identifiers into the function;
• logic configured to read the set of values by retrieving each chunk of the root chunk, first chunks, and second chunks from the storage address determined for the chunk.

One or more non-transitory computer-readable media storing instructions that, when executed by one or more computing devices, cause performance of:

• generating a tree structure of chunks in a data repository to store a set of values, the generating comprising:
• dividing the set of values amongst first chunks;
• determining first chunk identifiers for the first chunks by, for each chunk of the first chunks, inputting one or more values of the chunk into a function to calculate a chunk identifier for the chunk;
• dividing the first chunk identifiers amongst second chunks;
• determining second chunk identifiers for the second chunks by, for each chunk of the second chunks, inputting one or more of the first chunk identifiers in the chunk into the function to calculate a chunk identifier for the chunk;
• storing each chunk of the first chunks and the second chunks, respectively, at a storage address determined from the chunk identifier determined for the chunk;
• and
• storing a root chunk that comprises the second chunk identifiers at a storage address determined based on inputting the second chunk identifiers into the function;
• and
• reading the set of values by retrieving each chunk of the root chunk, first chunks, and second chunks from the storage address determined for the chunk.