| From: | "Andrey M(dot) Borodin" <x4mmm(at)yandex-team(dot)ru> |
|---|---|
| To: | Hannu Krosing <hannuk(at)google(dot)com> |
| Cc: | Aleksander Alekseev <aleksander(at)timescale(dot)com>, pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Peter Eisentraut <peter(at)eisentraut(dot)org> |
| Subject: | Re: What is a typical precision of gettimeofday()? |
| Date: | 2024-07-03 11:46:30 |
| Message-ID: | 68DC3743-35B3-48FB-AC78-69B13B8D4526@yandex-team.ru |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
> On 3 Jul 2024, at 16:29, Hannu Krosing <hannuk(at)google(dot)com> wrote:
>
> We currently do something similar with OIDs where we just keep
> generating them and then testing for conflicts.
>
> I don't think this is the best way to do it but it mostly works when
> you can actually test for uniqueness, like for example in TOAST or
> system tables.
>
> Not sure this works even reasonably well for UUIDv7.
Uniqueness is ensured with extra 60+ bits of randomness. Timestamp and counter\microseconds are there to promote sortability (thus ensuring data locality).
Best regards, Andrey Borodin.
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Aleksander Alekseev | 2024-07-03 11:47:26 | Re: What is a typical precision of gettimeofday()? |
| Previous Message | Ranier Vilela | 2024-07-03 11:43:50 | Re: Optimize numeric multiplication for one and two base-NBASE digit multiplicands. |