1. A data structuring method comprising: organizing a data management system into a plurality of physically-dispersed regions, each physically-dispersed region of the plurality of physically-dispersed regions including at least one cluster, a given cluster of the at least one cluster including at least one node and a shared storage, the data management system including a plurality of data management servers, each data management server including at least one computer hardware processer; continuously receiving at the at least one node at least one data stream; storing the at least one data stream in an object-oriented data store; maintaining an index tree for use in determining where a given object in the data management system is located, the index tree including a root, at least one level of joins, and a plurality of leaves, each leaf of the plurality of leaves associated with a sorted structure, the sorted structure including a property value and an object global unique identifier; associating a key and a key value with each sorted structure in each leaf and with each join in the index tree; re-computing the key associated with a given sorted structure and the key of at least one join in the index tree, the key of the at least one join is a cluster membership key, a region membership key, or a universe membership key; performing a membership test on at least one key in the index tree to identify which of the clusters may have the given object; and using the sorted structure to locate the given object within a given cluster.