http://richardstartin.uk/uuids-and-compressibility/
blog-post-uuids-and-compressibility#coordination-of-persistence1Universally unique identifiers, or UUIDs, are often used for database primary keys in scenarios where coordination of persistence is either impossible or impractical blog-post-uuids-and-compressibility#coordination-of-persistence1
blog-post-uuids-and-compressibility#vectorization1128 bits for a key is quite problematic in key scans and joins: with appropriately structured data, these algorithms can benefit significantly from vector processing, but at 128 bits per element, vectorization is probably a lost cause blog-post-uuids-and-compressibility#vectorization1
blog-post-uuids-and-compressibility#cold-data1I compressed collections of 1M UUIDs using compression algorithms typically reserved for "cold data": gzip, snappy and LZ4, using the code on github. blog-post-uuids-and-compressibility#cold-data1