Multiple-query optimization at algorithm-level

Myong H. Kang, Henry G. Dietz, Bharat Bhargava

Research output: Contribution to journalArticlepeer-review

15 Scopus citations


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.

Original languageEnglish
Pages (from-to)57-75
Number of pages19
JournalData and Knowledge Engineering
Issue number1
StatePublished - Nov 1994


  • Database
  • Multiple queries
  • Optimization

ASJC Scopus subject areas

  • Information Systems and Management


Dive into the research topics of 'Multiple-query optimization at algorithm-level'. Together they form a unique fingerprint.

Cite this