The techniques and methods for implementing parallel B+ -tree are firstpresented. Then, the parallel algorithms for data maintenance of B+ -tree, parallelalgorithms for maintaining schemes of the relations with parallel B+ - tree indices, and theparallel data operation algorithms based on the B+ -trees are propised. The proposedparallel B+ -trees and related parallel algorithms have been used in a parallel relationaldatabase system designed and implemented by the author. It is shown in practicethat the proposed parallel B+ -tree and algorithms are very efficient and very effective.
