The database multiple-query optimization can be achieved by analyzing
multiple-query sequences at a level below that used by current optimiz
ers, but above the low-level executable code. In this paper, the conce
pt of the 'algorithm-level' representation of a database program is de
fined and optimization techniques that can be applied to the algorithm
-level representation are discussed. Some techniques extend existing c
oncepts, while others are new. In this paper, we also show multiple-qu
ery optimization can be performed across the update queries.