{"action":"opened","issue":{"url":"https://api.github.com/repos/rethinkdb/rethinkdb/issues/6021","repository_url":"https://api.github.com/repos/rethinkdb/rethinkdb","labels_url":"https://api.github.com/repos/rethinkdb/rethinkdb/issues/6021/labels{/name}","comments_url":"https://api.github.com/repos/rethinkdb/rethinkdb/issues/6021/comments","events_url":"https://api.github.com/repos/rethinkdb/rethinkdb/issues/6021/events","html_url":"https://github.com/rethinkdb/rethinkdb/issues/6021","id":168766347,"number":6021,"title":"Use Lexicographically sortable Unique IDs support","user":{"login":"v3ss0n","id":419606,"avatar_url":"https://avatars.githubusercontent.com/u/419606?v=3","gravatar_id":"","url":"https://api.github.com/users/v3ss0n","html_url":"https://github.com/v3ss0n","followers_url":"https://api.github.com/users/v3ss0n/followers","following_url":"https://api.github.com/users/v3ss0n/following{/other_user}","gists_url":"https://api.github.com/users/v3ss0n/gists{/gist_id}","starred_url":"https://api.github.com/users/v3ss0n/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/v3ss0n/subscriptions","organizations_url":"https://api.github.com/users/v3ss0n/orgs","repos_url":"https://api.github.com/users/v3ss0n/repos","events_url":"https://api.github.com/users/v3ss0n/events{/privacy}","received_events_url":"https://api.github.com/users/v3ss0n/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2016-08-01T23:34:52Z","updated_at":"2016-08-01T23:34:52Z","closed_at":null,"body":"i think it will be very beneficial if Rethinkdb supports Universally Unique Lexicographically Sortable Identifier. It is very efficient and avaliable in JS + Python now :\r\n\r\nhttps://github.com/alizain/ulid\r\nhttps://github.com/mdipierro/ulid\r\n\r\nNot sure it is ok for sharding. Any ideas? "}}
{"actor":{"display_login":"v3ss0n"}}