Multiple-query optimization at algorithm-level

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 optimizati...

Full description

Saved in:
Bibliographic Details
Published in:Data & knowledge engineering 1994-11, Vol.14 (1), p.57-75
Main Authors: Kang, Myong H., Dietz, Henry G., Bhargava, Bharat
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Information systems. Data bases
Memory organisation. Data processing
Multiple queries
Optimization
Software
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0169-023X
1872-6933
DOI:10.1016/0169-023X(94)90009-4