> 22 марта 2019 г., в 22:38, PegoraroF10 написал(а):
>
> On version 10 and 11 hash index was redesigned and now seems to be better
> than btree.
> Their speed, size and memory consuption are better, so ...
> Why is not possible to have all PK and FK just using hash indices ? The only
> thing
On version 10 and 11 hash index was redesigned and now seems to be better
than btree.
Their speed, size and memory consuption are better, so ...
Why is not possible to have all PK and FK just using hash indices ? The only
thing I need on a PK and FK is search and join, so hash index responds very
