Tom Lane 787eba734b When creating a large hash index, pre-sort the index entries by estimated ... bucket number, so as to ensure locality of access to the index during the insertion step. Without this, building an index significantly larger than available RAM takes a very long time because of thrashing. On the other hand, sorting is just useless overhead when the index does fit in RAM. We choose to sort when the initial index size exceeds effective_cache_size. This is a revised version of work by Tom Raney and Shreya Bhargava.		2008-03-16 23:15:08 +00:00
..
common	Remove another target I forgot during the refactoring	2008-02-19 11:49:12 +00:00
gin	Refactor backend makefiles to remove lots of duplicate code	2008-02-19 10:30:09 +00:00
gist	Refactor backend makefiles to remove lots of duplicate code	2008-02-19 10:30:09 +00:00
hash	When creating a large hash index, pre-sort the index entries by estimated	2008-03-16 23:15:08 +00:00
heap	Fix heap_page_prune's problem with failing to send cache invalidation	2008-03-13 18:00:32 +00:00
index	Refactor backend makefiles to remove lots of duplicate code	2008-02-19 10:30:09 +00:00
nbtree	When creating a large hash index, pre-sort the index entries by estimated	2008-03-16 23:15:08 +00:00
transam	Make TransactionIdIsInProgress check transam.c's single-item XID status cache	2008-03-11 20:20:35 +00:00
Makefile	Refactor backend makefiles to remove lots of duplicate code	2008-02-19 10:30:09 +00:00