Welcome to B-TREE-P!

Featuring B-tree source code for the Pick operating system.

• Questions most frequently asked about B-TREE-P (1987)
• BTP/Branches #1 (April 1986)
  • Welcome to BTP/Branches
  • How to use BTP/Branches
  • Creating GET.NAMES
  • Creating the NAMES file
  • Creating the BTPINS and BTPKEY programs
  • Building the first B-trees
  • Browsing the NAMES file
  • Adding and deleting NAMES
  • Listing NAMES in order
  • Recapping the examples
  • What exactly is a B-tree?
  • How to use B-TREE-P with existing files
  • How to modify BTPKEY
  • How to use BTPINS and BTPDEL
  • How to use BTPFIND and BTPSEQ
  • Creating your own browser
  • B-TREE-P error messages
• BTP/Branches #2 (June 1986)
  • How to create B-trees for multivalued attributes
  • A multivalued example
  • How to adjust BTPKEY
  • How to adjust BTPINS, BTPFIND, and BTPDEL
  • Using BTPFIND and BTPSEQ
  • Using BTPDEL
  • Browsing multivalues
  • How to handle submultivalues
• BTP/Branches #3 (August 1986)
  • Avoid CALLs to gain speed
  • How to BUILD "forests" tree by tree
  • Locking B-tree files vs. locking B-trees
• BTP/Branches #4 (December 1986)
  • "IN" now sometimes reserved
  • How to delete one tree in a "forest"
• BTP/Branches #5 (March 1987)
  • Some compilers can't handle general format strings
  • What BTPFIND really finds
  • How to manually delete keys
• BTP/Branches #6 (May 1987)
  • How to BUILD fast
• BTP/Branches #7 (July 1987)
  • Possible incompatibilities
  • How to index translations
  • How to make FAST.BUILD insert all items
  • How to make an item list
• BTP/Branches #8 (September 1987)
  • Possible incompatibilities
  • Using BTPSEQ and key changes
  • Trading time for space
• BTP/Branches #9 (November 1987)
  • A seldom-scrolling browser
• BTP/Branches #10 (March 1988)
  • Will MATREADs add speed?
  • Watch out for null ids
  • Should BTPFIND report end-of-tree?
• BTP/Branches #11 (July 1988)
  • When not to use B-trees
• BTP/Branches #12 (December 1989)
  • The minimum node size is 2
  • How to do a descending sort
• B-tree algorithms
• Commented source code for BTPDEL
• Commented source code for BTPFIND
• Commented source code for BTPINS
• Commented source code for BTPSEQ
• B-tree variations