Tom Lane 9e85183bfc Major overhaul of btree index code. Eliminate special BTP_CHAIN logic for ... duplicate keys by letting search go to the left rather than right when an equal key is seen at an upper tree level. Fix poor choice of page split point (leading to insertion failures) that was forced by chaining logic. Don't store leftmost key in non-leaf pages, since it's not necessary. Don't create root page until something is first stored in the index, so an unused index is now 8K not 16K. (Doesn't seem to be as easy to get rid of the metadata page, unfortunately.) Massive cleanup of unreadable code, fix poor, obsolete, and just plain wrong documentation and comments. See src/backend/access/nbtree/README for the gory details.		2000-07-21 06:42:39 +00:00
..
common	DataFill() has no business resetting xact status bits	2000-07-04 02:40:56 +00:00
gist	Cleanup of code for creating index entries. Functional indexes with	2000-07-14 22:18:02 +00:00
hash	Cleanup of code for creating index entries. Functional indexes with	2000-07-14 22:18:02 +00:00
heap	Some security checks that we've found an external value completely	2000-07-11 12:32:03 +00:00
index	Cleanup of code for creating index entries. Functional indexes with	2000-07-14 22:18:02 +00:00
nbtree	Major overhaul of btree index code. Eliminate special BTP_CHAIN logic for	2000-07-21 06:42:39 +00:00
rtree	Cleanup of code for creating index entries. Functional indexes with	2000-07-14 22:18:02 +00:00
transam	misc	2000-07-04 01:49:44 +00:00
Makefile	Repair parallel make in backend tree (and make it really parallel).	2000-07-13 16:07:14 +00:00