1. A method, comprising: identifying, from an index structure stored in memory, a reference minimum bounding shape that encloses a minimum bounding shape, the minimum bounding shape corresponding to a data object associated with a leaf node of the index structure; associating, using one or more processors, coordinates of a point of the minimum bounding shape with a set of first values to produce a relative representation of the minimum bounding shape, the set of first values being calculated relative to coordinates of a reference point of the reference minimum bounding shape by calculating a difference between an absolute coordinate of the point of the minimum bounding shape and an absolute coordinate of the reference point; and compressing the relative representation using a finite level of quantization by cutting off trailing insignificant bits to produce a quantized representation of the minimum bounding shape and storing the compressed relative representation in one or more nodes, the one or more nodes having a node size calculated dynamically based on historical query selectivity, wherein query selectivity is a measure of how much data is expected to be returned by a given query.