Intelligent search method for query optimization by semijoins

Hyuck Yoo, Stephane Lafortune

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

The problem of finding an optimal semijoin sequence that fully reduces a given tree query is discussed. A method is presented that intelligently navigates the space of all semijoin sequences and returns an optimal solution. Experiments are reported that show that this method performs very efficiently; on average, less than 5% of the search space is searched before an optimal solution is found. Other advantages of the method are ease of implementation, generality of the cost model considered, and ability to handle tree queries with arbitrary target lists.

Original languageEnglish
Pages (from-to)226-237
Number of pages12
JournalIEEE Transactions on Knowledge and Data Engineering
Volume1
Issue number2
DOIs
Publication statusPublished - 1989 Jun 1
Externally publishedYes

Fingerprint

Costs
Experiments

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Intelligent search method for query optimization by semijoins. / Yoo, Hyuck; Lafortune, Stephane.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 1, No. 2, 01.06.1989, p. 226-237.

Research output: Contribution to journalArticle

@article{9ab894b6babd42a6bdbcda4ba571c295,
title = "Intelligent search method for query optimization by semijoins",
abstract = "The problem of finding an optimal semijoin sequence that fully reduces a given tree query is discussed. A method is presented that intelligently navigates the space of all semijoin sequences and returns an optimal solution. Experiments are reported that show that this method performs very efficiently; on average, less than 5{\%} of the search space is searched before an optimal solution is found. Other advantages of the method are ease of implementation, generality of the cost model considered, and ability to handle tree queries with arbitrary target lists.",
author = "Hyuck Yoo and Stephane Lafortune",
year = "1989",
month = "6",
day = "1",
doi = "10.1109/69.87962",
language = "English",
volume = "1",
pages = "226--237",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "2",

}

TY - JOUR

T1 - Intelligent search method for query optimization by semijoins

AU - Yoo, Hyuck

AU - Lafortune, Stephane

PY - 1989/6/1

Y1 - 1989/6/1

N2 - The problem of finding an optimal semijoin sequence that fully reduces a given tree query is discussed. A method is presented that intelligently navigates the space of all semijoin sequences and returns an optimal solution. Experiments are reported that show that this method performs very efficiently; on average, less than 5% of the search space is searched before an optimal solution is found. Other advantages of the method are ease of implementation, generality of the cost model considered, and ability to handle tree queries with arbitrary target lists.

AB - The problem of finding an optimal semijoin sequence that fully reduces a given tree query is discussed. A method is presented that intelligently navigates the space of all semijoin sequences and returns an optimal solution. Experiments are reported that show that this method performs very efficiently; on average, less than 5% of the search space is searched before an optimal solution is found. Other advantages of the method are ease of implementation, generality of the cost model considered, and ability to handle tree queries with arbitrary target lists.

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

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

U2 - 10.1109/69.87962

DO - 10.1109/69.87962

M3 - Article

AN - SCOPUS:0024684727

VL - 1

SP - 226

EP - 237

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 2

ER -