hashtable sizing for aggregation
AFAIK many queries are mostly a lot more efficient if the UUID is in insertion order which is facilitated by including the timestamp at the front of the UUID
How did you come to that conclusion?
hashtable sizing for aggregation
AFAIK many queries are mostly a lot more efficient if the UUID is in insertion order which is facilitated by including the timestamp at the front of the UUID
How did you come to that conclusion?