On Fri, Mar 16, 2012 at 5:03 PM, Alexander Shorin <[email protected]> wrote: > Daniel, > > Since you're using Python, have you played with uuid.uuid1 function? > It produce semi-sequential host-based uuids. To make them really > sequential, probably you'd like to reverse uuid value because his > "head" changes often than "tail". This trick could be cheaper that > implementing erlang-friendly base64 encoding. > > -- > ,,,^..^,,,
Thanks Alexander, but that won't do. The main requirement to keep performance and size low is to have a really short document_id. With base64 you can number 16 millions of documents with just 4 characters, and over 1 thousand million documents with 5 characters. The number of characters in the doc_id is really a critical parameter when dealing with lots of documents.
