Batch Updates and Concurrency Control in B-Trees

摘要

When a large number of new keys are to be inserted (or deleted) into a B-tree at about The same time, it is often profitable to sort the keys in the main memory before Performing updates to the B-tree on disk. Thus, updates falling into the same leaf Of the B-tree can be performed simultaneously and disk accesses are saved. In this Thesis, new batch-update algorithms for B-trees are presented and anlyszed.