[postgis-tickets] [PostGIS] #3883: Make B-Tree sorting blazingly fast

[PostGIS]

#3883: Make B-Tree sorting blazingly fast
-------------------------+---------------------------
 Reporter:  komzpa       |      Owner:  pramsey
     Type:  enhancement  |     Status:  new
 Priority:  medium       |  Milestone:  PostGIS 2.5.0
Component:  postgis      |    Version:  2.4.x
 Keywords:               |
-------------------------+---------------------------
 - make gserialized_get_sort_hash function;
  - make it return least possible value on EMPTY;
  - make it read not box, but first coordinate of gserialized. This way no
 geography/geometry branching is needed, and it should be faster than
 getting a float-rounded box center for geometries that don't store it;
  - make fast path for complete equality for fast GROUP BY in
 gserizlized_cmp;
  - create sortsupport function that will employ gserialized_get_sort_hash
 and full equality fast path;
  - investigate when to abort abbreviated compare in sort. (this is going
 to happen more often on 32bit machines, as sortsupport key will be 32bit,
 containing half of 64bit key).

--
Ticket URL: <https://trac.osgeo.org/postgis/ticket/3883>
PostGIS <http://trac.osgeo.org/postgis/>
The PostGIS Trac is used for bug, enhancement & task tracking, a user and developer wiki, and a view into the subversion code repository of PostGIS project.