Sorting the metadata in BucketCatalog::insert can be an quite expensive operation. This is done so we can perform binary comparison to lookup bucket independently of user provided field order.

As an alternative approach that may perform better is to store multiple entries in the _openBuckets hash map that point to the same bucket to handle different sort orders. We can lazily normalize and retry the lookup if the first lookup failed.