A variant that works effectively in high-concurrency environments.

B-tree implementation: backend/access/nbtree

• nbtree.c ... interface functions (for iterators)
• nbtsearch.c ... traverse index to find key value
• nbtinsert.c ... add new entry to B-tree index