aboutsummaryrefslogtreecommitdiff
path: root/src/backend/access/gist/gistxlog.c
diff options
context:
space:
mode:
authorHeikki Linnakangas <heikki.linnakangas@iki.fi>2014-12-22 12:05:57 +0200
committerHeikki Linnakangas <heikki.linnakangas@iki.fi>2014-12-22 12:05:57 +0200
commite7032610f76e6c8345496ae7bbdf49d3c40df30f (patch)
tree8000940e75f51aed385fecdc26ebdd85a05016b9 /src/backend/access/gist/gistxlog.c
parent699300a146c04e207a8fdec407538cdf5368fde5 (diff)
downloadpostgresql-e7032610f76e6c8345496ae7bbdf49d3c40df30f.tar.gz
postgresql-e7032610f76e6c8345496ae7bbdf49d3c40df30f.zip
Use a pairing heap for the priority queue in kNN-GiST searches.
This performs slightly better, uses less memory, and needs slightly less code in GiST, than the Red-Black tree previously used. Reviewed by Peter Geoghegan
Diffstat (limited to 'src/backend/access/gist/gistxlog.c')
0 files changed, 0 insertions, 0 deletions