Haas: New Features Coming in PostgreSQL 10
PostgreSQL has had physical replication -- often called streaming replication -- since version 9.0, but this requires replicating the entire database, cannot tolerate writes in any form on the standby server, and is useless for replicating across versions or database systems. PostgreSQL has had logical decoding -- basically change capture -- since version 9.4, which has been embraced with enthusiasm, but it could not be used for replication without an add-on of some sort. PostgreSQL 10 adds logical replication which is very easy to configure and which works at table granularity, clearly a huge step forward. It will copy the initial data for you and then keep it up to date after that."
Posted Apr 10, 2017 18:26 UTC (Mon)
by brunowolff (guest, #71160)
[Link] (3 responses)
Posted Apr 11, 2017 8:28 UTC (Tue)
by ovitters (guest, #27950)
[Link] (2 responses)
Posted Apr 11, 2017 12:32 UTC (Tue)
by brunowolff (guest, #71160)
[Link]
Posted Apr 21, 2017 15:21 UTC (Fri)
by intgr (subscriber, #39733)
[Link]
Then there are BRIN indexes, which trade off faster update speed and smaller disk size for slower lookup times. Similarly GIN and GiST support some overlapping operator classes, but have different performance tradeoffs.
For the 'inet' type as well, if all you want is range queries, then btree is better than SP-GiST. If you need the more complicated operators then both GiST and SP-GiST provide almost the same set of operators. I don't understand them enough to say whether there's a useful tradeoff involved or one is clearly better than the other. If the latter, then keeping the old GiST implementation around sounds like a misfeature.
Haas: New Features Coming in PostgreSQL 10
Haas: New Features Coming in PostgreSQL 10
Haas: New Features Coming in PostgreSQL 10
This might be more complicated going forward with the improvements in hash indexes also coming in version 10. Previously b-tree indexes were typically faster and provided better crash safeness than hash indexes, so that for operators with b-tree support you would choose b-tree. But it looks like their might be some cases where you'd prefer hash indexes going forward. B-tree will probably still be the safe default, but if you really needed to try to get things faster, you might want to run benchmarks to see if a hash index would be better in a particular case.
Haas: New Features Coming in PostgreSQL 10