Manage long lists
When managing very long lists of items in an application (for example, a long list of users, a long list of MSISDN, a long list of product references...) we face the Webcom back end width limitation that prevents creating data nodes with more than 50,000 children.
In order to work around this limitation, the Webcom database provides with virtual hashed data nodes, which extend the number of children to over 1015. In return, these virtual nodes consume 4 depth levels in the tree structure (as a reminder, a Webcom tree-like database allows up to 32 levels).
How does it work?