1. A method comprising: receiving multidimensional data elements, where each multidimensional data element is defined by a plurality of different object types, and where each object is associated with a different dimension within a multidimensional data space; forming a respective tuple for each of the multidimensional data elements by mapping each object to an associated reference; applying a Hilbert function to two or more of the references of each of the tuples to determine a respective Hilbert ordering for each of the tuples; and storing the Hilbert orderings to a tree data structure allocated within a linear data storage structure, wherein the tuples are arranged within the tree data structure in a sorted order such that a retrieval time of the tuples is substantially equal for two or more of the dimensions within the multi-dimensional space.