Major overhaul of btree index code. Eliminate special BTP_CHAIN logic for

Browse Source

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.

...

This commit is contained in:

Tom Lane

2000-07-21 06:42:39 +00:00

parent c9537ca88f

commit 9e85183bfc

11 changed files with 1629 additions and 2859 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download Patch File Download Diff File Expand all files Collapse all files

1908

src/backend/access/nbtree/nbtinsert.c

File diff suppressed because it is too large Load Diff