projects / postgresql-pgindent.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 699300a) | patch
Use a pairing heap for the priority queue in kNN-GiST searches.
authorHeikki Linnakangas <heikki.linnakangas@iki.fi>
Mon, 22 Dec 2014 10:05:57 +0000 (12:05 +0200)
committerHeikki Linnakangas <heikki.linnakangas@iki.fi>
Mon, 22 Dec 2014 10:05:57 +0000 (12:05 +0200)
commite7032610f76e6c8345496ae7bbdf49d3c40df30f
tree8000940e75f51aed385fecdc26ebdd85a05016b9tree
parent699300a146c04e207a8fdec407538cdf5368fde5commit | diff
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
src/backend/access/gist/gistget.c diff | blob | blame | history
src/backend/access/gist/gistscan.c diff | blob | blame | history
src/backend/lib/Makefile diff | blob | blame | history
src/backend/lib/README [new file with mode: 0644] blob
src/backend/lib/pairingheap.c [new file with mode: 0644] blob
src/include/access/gist_private.h diff | blob | blame | history
src/include/lib/pairingheap.h [new file with mode: 0644] blob
Auto-updated pgindent branches