No. v1 UUIDs are not lexicographically sortable. You can see this if you go to any online generator and click generate a few times - you'll notice that the first part of the hex string changes far more than the next two sections. This is why Sql Server has NEWSEQUENTIALID, which doesn't follow RFC 4122 (the UUID spec). For PostGres, I've been recommending that people use ULIDs (Universally Unique Lexicographically Sortable Identifier), which you should google (not linking for fear of antispam).
Thanks for the very informative video. We are victim of GUID based B-Tree indexes. I have following queries 1. Can Hash Index help for GUID (random numbers)? 2. Can Arora help in solving B-Tree performance issues or we need to rely on right side generation of keys for B-Tree?
Well, you see, the main problem here was the FPW, and it only there to be safe to use it at hardware configurations. Changing update to other methods where FPW is not necessary kind hard, but maybe possible, but that's not solved right now (even with PG12, now we have some work done on the internal access API, but that's only the beginning to allow different storage engines). Some indexes already try to avoid constant re-balancing (GIN with fastupdates) and the same technique would need to be applied to get rid of FPW on any hardware.
Vivek Singh what I'm looking for, is an automated way that generates statistics reports after each run of pgbench. So far, I've not been able to find such method. Can you please let me know of there is one in detail? Thanks
That is but when one does not optimize the postgresql 25,000 TPS, but optimized for 4MB to 4GB it gives 443000 TPS
[/dog][/dog][/dog]
Optimization tips using cloud databases
Cloud Database > Reduce Indexes > Non-random Data > WAL Buffer size > WAL Compression > No Optimization
21:08 Would using UUID Version 1 instead of random UUID help to constrain randomness?
No. v1 UUIDs are not lexicographically sortable. You can see this if you go to any online generator and click generate a few times - you'll notice that the first part of the hex string changes far more than the next two sections. This is why Sql Server has NEWSEQUENTIALID, which doesn't follow RFC 4122 (the UUID spec). For PostGres, I've been recommending that people use ULIDs (Universally Unique Lexicographically Sortable Identifier), which you should google (not linking for fear of antispam).
there is guidv7. first 32 bits is timestamp
Thanks for the very informative video. We are victim of GUID based B-Tree indexes. I have following queries
1. Can Hash Index help for GUID (random numbers)?
2. Can Arora help in solving B-Tree performance issues or we need to rely on right side generation of keys for B-Tree?
Very informative!
wow. I hope some of these features get implemented in Postgres core
Postgres is getting better and better but adding huge neat features takes so much time :(
Well, you see, the main problem here was the FPW, and it only there to be safe to use it at hardware configurations.
Changing update to other methods where FPW is not necessary kind hard, but maybe possible, but that's not solved right now (even with PG12, now we have some work done on the internal access API, but that's only the beginning to allow different storage engines).
Some indexes already try to avoid constant re-balancing (GIN with fastupdates) and the same technique would need to be applied to get rid of FPW on any hardware.
really gets into the details.
Great talk! thank you.
Informative..
Good job Grant!!
Hi, How can I generate these statistics reports while running the benchmarks?
pg_bench
Vivek Singh what I'm looking for, is an automated way that generates statistics reports after each run of pgbench. So far, I've not been able to find such method. Can you please let me know of there is one in detail? Thanks
Really good talk. Is aurora downloadble ?
no sir it relies on the AWS Infrastructure to do all these neat things.
Proprietary stuff... GRR
someone who can help me to make an inheritance in my shell postgesql please!!!!