Fig. 11From: Comparison of LSM indexing techniques for storing spatial dataTotal time to sort arrays of 1,000,000 random points. AsterixDB’s Hilbert curve comparator only supports two dimensional points due to its slow computation for higher dimensionsBack to article page