Workiva Inc.
Distributed processing using a node hierarchy

Abstract:

A method for traversing a node tree, having a root node and a hierarchy of child nodes, to a selected child node is described. A node identifier of the root node is determined by performing a hash function with at least a seed value for the node tree. Each child node of the hierarchy has a respective node identifier determined by performing the hash function with i) the seed value, ii) a node identifier of a parent node of the child node, and iii) a child index of the parent node. The selected child node's node identifier is determined by performing the hash function with i) the seed value, ii) the node identifier of the selected child node's parent node, and iii) the child index of the parent node for the selected child node. A retrieval of data stored at a location indicated by the node identifier of the selected child node is caused.