TY - JOUR
T1 - Multiple-query optimization at algorithm-level
AU - Kang, Myong H.
AU - Dietz, Henry G.
AU - Bhargava, Bharat
PY - 1994/11
Y1 - 1994/11
N2 - The database multiple-query optimization can be achieved by analyzing multiple-query sequences at a level below that used by current optimizers, but above the low-level executable code. In this paper, the concept of the 'algorithm-level' representation of a database program is defined and optimization techniques that can be applied to the algorithm-level representation are discussed. Some techniques extend existing concepts, while others are new. In this paper, we also show multiple-query optimization can be performed across the update queries.
AB - The database multiple-query optimization can be achieved by analyzing multiple-query sequences at a level below that used by current optimizers, but above the low-level executable code. In this paper, the concept of the 'algorithm-level' representation of a database program is defined and optimization techniques that can be applied to the algorithm-level representation are discussed. Some techniques extend existing concepts, while others are new. In this paper, we also show multiple-query optimization can be performed across the update queries.
KW - Database
KW - Multiple queries
KW - Optimization
UR - http://www.scopus.com/inward/record.url?scp=0028545067&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0028545067&partnerID=8YFLogxK
U2 - 10.1016/0169-023X(94)90009-4
DO - 10.1016/0169-023X(94)90009-4
M3 - Article
AN - SCOPUS:0028545067
SN - 0169-023X
VL - 14
SP - 57
EP - 75
JO - Data and Knowledge Engineering
JF - Data and Knowledge Engineering
IS - 1
ER -