Multiple-query optimization at algorithm-level

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

doi:10.1016/0169-023X(94)90009-4

Multiple-query optimization at algorithm-level

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

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

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 language	English
Pages (from-to)	57-75
Number of pages	19
Journal	Data and Knowledge Engineering
Volume	14
Issue number	1
DOIs	https://doi.org/10.1016/0169-023X(94)90009-4
State	Published - Nov 1994

Keywords

Database
Multiple queries
Optimization

ASJC Scopus subject areas

Information Systems and Management

Access to Document

10.1016/0169-023X(94)90009-4

Cite this

@article{64d769abf252446b8c654928187e6ac4,

title = "Multiple-query optimization at algorithm-level",

abstract = "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.",

keywords = "Database, Multiple queries, Optimization",

author = "Kang, {Myong H.} and Dietz, {Henry G.} and Bharat Bhargava",

year = "1994",

month = nov,

doi = "10.1016/0169-023X(94)90009-4",

language = "English",

volume = "14",

pages = "57--75",

number = "1",

}

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

VL - 14

SP - 57

EP - 75

IS - 1

ER -

Multiple-query optimization at algorithm-level

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this