code: public static String randomIdString() {
          MersenneTwister twister = new MersenneTwister();
          final int length = 27;
          char[] chars = new char[length];
          for (int i = 0; i < length; i++) {
              chars[i] = (char) ('a' + twister.nextInt(26));
          }
          // Add a visual separator, which makes these easier to distinguish at a glance
          chars[4] = '_';
          return new String(chars);
      }
docs: Generate a random unique prefix of n lowercase letters.
  We can't count on sql table or schema names being case sensitive or tolerating (leading) digits.
  For n=10, number of possibilities is 26^10 or 1.4E14.
  
  The approximate probability of a hash collision is k^2/2H where H is the number of possible hash values and
  k is the number of items hashed.
  
  SHA1 is 160 bits, MD5 is 128 bits, and UUIDs are 128 bits with only 122 actually random.
  To reach the uniqueness of a UUID you need math.log(2**122, 26) or about 26 letters.
  An MD5 can be represented as 32 hex digits so we don't save much length, but we do make it entirely alphabetical.
  log base 2 of 26 is about 4.7, so each character represents about 4.7 bits of randomness.
  
  The question remains of whether we need globally unique IDs or just application-unique IDs. The downside of
  generating IDs sequentially or with little randomness is that when multiple databases are created we'll have
  feeds with the same IDs as older or other databases, allowing possible accidental collisions with strange
  failure modes.