From: | Guyren Howe <guyren(at)gmail(dot)com> |
---|---|
To: | Colin Morelli <colin(dot)morelli(at)gmail(dot)com> |
Cc: | pgsql-general <pgsql-general(at)postgresql(dot)org> |
Subject: | Re: Filtering by UUID |
Date: | 2016-09-29 23:08:47 |
Message-ID: | 8BC9BE09-063F-426A-BD95-ECA77225A840@gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
On Sep 29, 2016, at 16:03 , Colin Morelli <colin(dot)morelli(at)gmail(dot)com> wrote:
>
> Hey list,
>
> I'm using UUID primary keys in my application. I need to add pagination, and am trying to avoid OFFSET/LIMIT. I do have a created_at timestamp that I could use, but it's possible for multiple records to be created at the same timestamp (postgres offers millisecond precision here, I believe?)
>
> Is there an efficient way to filter based on the time component of UUID v1s? WHERE id > 'some-uuid' doesn't seem to work, as it looks like it's just performing a lexicographic sort on the hex representation of the UUID. Or, alternatively, does anyone have other suggestions on paginating large data sets?
Why not just sort on (created_at, uuid) (ie us the UUID just to force a complete ordering)?
From | Date | Subject | |
---|---|---|---|
Next Message | Colin Morelli | 2016-09-29 23:14:55 | Re: Filtering by UUID |
Previous Message | Colin Morelli | 2016-09-29 23:03:19 | Filtering by UUID |