A formal model of trade-off between optimization and execution costs in semantic query optimization

Shashi Shekhar, Jaideep Srivastava, Soumitra Dutta

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Conventional query optimizers assume that the cost of optimization is negligible. This assumption does not hold for much larger search spaces (of possible execution plans) such as those encountered during semantic query optimization. In particular, the optimization cost can become comparable to the execution cost, and thus a significant fraction of the response time for interactive queries [1]. This paper discusses the trade-off between the two costs in the context of semantic query optimization with regard to a set of integrity constraints, and reports a heuristic search algorithm which minimizes a weighted sum of both the costs. A detailed analysis of an experiment is presented to strengthen the claim. The optimization considered in this paper is with respect to a set of semantic integrity constraints.

Original languageEnglish
Pages (from-to)131-151
Number of pages21
JournalData and Knowledge Engineering
Volume8
Issue number2
DOIs
Publication statusPublished - 1992
Externally publishedYes

Fingerprint

Semantics
Costs
Query optimization
Execution costs
Trade-offs
Formal model
Integrity
Query
Experiments
Heuristic search
Experiment
Response time
Cost optimization

Keywords

  • optimization cost
  • Semantic query optimization
  • stopping rule

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

A formal model of trade-off between optimization and execution costs in semantic query optimization. / Shekhar, Shashi; Srivastava, Jaideep; Dutta, Soumitra.

In: Data and Knowledge Engineering, Vol. 8, No. 2, 1992, p. 131-151.

Research output: Contribution to journalArticle

@article{09ce7c2f41584e0ea1f52b313edd19ca,
title = "A formal model of trade-off between optimization and execution costs in semantic query optimization",
abstract = "Conventional query optimizers assume that the cost of optimization is negligible. This assumption does not hold for much larger search spaces (of possible execution plans) such as those encountered during semantic query optimization. In particular, the optimization cost can become comparable to the execution cost, and thus a significant fraction of the response time for interactive queries [1]. This paper discusses the trade-off between the two costs in the context of semantic query optimization with regard to a set of integrity constraints, and reports a heuristic search algorithm which minimizes a weighted sum of both the costs. A detailed analysis of an experiment is presented to strengthen the claim. The optimization considered in this paper is with respect to a set of semantic integrity constraints.",
keywords = "optimization cost, Semantic query optimization, stopping rule",
author = "Shashi Shekhar and Jaideep Srivastava and Soumitra Dutta",
year = "1992",
doi = "10.1016/0169-023X(92)90034-9",
language = "English",
volume = "8",
pages = "131--151",
journal = "Data and Knowledge Engineering",
issn = "0169-023X",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - A formal model of trade-off between optimization and execution costs in semantic query optimization

AU - Shekhar, Shashi

AU - Srivastava, Jaideep

AU - Dutta, Soumitra

PY - 1992

Y1 - 1992

N2 - Conventional query optimizers assume that the cost of optimization is negligible. This assumption does not hold for much larger search spaces (of possible execution plans) such as those encountered during semantic query optimization. In particular, the optimization cost can become comparable to the execution cost, and thus a significant fraction of the response time for interactive queries [1]. This paper discusses the trade-off between the two costs in the context of semantic query optimization with regard to a set of integrity constraints, and reports a heuristic search algorithm which minimizes a weighted sum of both the costs. A detailed analysis of an experiment is presented to strengthen the claim. The optimization considered in this paper is with respect to a set of semantic integrity constraints.

AB - Conventional query optimizers assume that the cost of optimization is negligible. This assumption does not hold for much larger search spaces (of possible execution plans) such as those encountered during semantic query optimization. In particular, the optimization cost can become comparable to the execution cost, and thus a significant fraction of the response time for interactive queries [1]. This paper discusses the trade-off between the two costs in the context of semantic query optimization with regard to a set of integrity constraints, and reports a heuristic search algorithm which minimizes a weighted sum of both the costs. A detailed analysis of an experiment is presented to strengthen the claim. The optimization considered in this paper is with respect to a set of semantic integrity constraints.

KW - optimization cost

KW - Semantic query optimization

KW - stopping rule

UR - http://www.scopus.com/inward/record.url?scp=0026868777&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026868777&partnerID=8YFLogxK

U2 - 10.1016/0169-023X(92)90034-9

DO - 10.1016/0169-023X(92)90034-9

M3 - Article

VL - 8

SP - 131

EP - 151

JO - Data and Knowledge Engineering

JF - Data and Knowledge Engineering

SN - 0169-023X

IS - 2

ER -