Riku Saikkonen: Group Update Algorithms in AVL Trees 

Group (or bulk) update algorithms insert a group of keys into a
data structure as a single operation. In search trees, group updates
need less rebalancing operations than the individual single
update operations, since rebalancing can be done after all of the
keys have been inserted or deleted.  This talk presents some
variations on group insertion algorithms for standard AVL trees. The
talk includes some discussion on implementation techniques (such as
avoiding the use of parent links in search tree operations), some
preliminary experimental studies on the effectiveness of group
insertion, and a brief look at group deletion.