Adaptive selection of access path and join method

Yann-Hang Lee, Philip S. Yu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

An adaptive approach which utilizes the information embedded in indexes to identify the tuples satisfying a given predicate or having a match in a join operation is proposed. An access path (index or table scan) and a join method (index join, nested loop, sort-merge) are chosen to construct the results adaptively. This leads to the optimal evaluation of queries. With an efficient implementation, the adaptive decision process becomes a part of a query evaluation procedure, so that the overhead of the approach is minimized.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Computer Society's International Computer Software & Applications Conference
EditorsGeorge J. Knafl
PublisherPubl by IEEE
Pages250-256
Number of pages7
StatePublished - 1989
Externally publishedYes
EventProceedings of the Thirteenth Annual International Computer Software & Applications Conference - COMPSAC 89 - Orlando, FL, USA
Duration: Sep 20 1989Sep 22 1989

Other

OtherProceedings of the Thirteenth Annual International Computer Software & Applications Conference - COMPSAC 89
CityOrlando, FL, USA
Period9/20/899/22/89

ASJC Scopus subject areas

  • Engineering(all)
  • Software

Cite this

Lee, Y-H., & Yu, P. S. (1989). Adaptive selection of access path and join method. In G. J. Knafl (Ed.), Proceedings - IEEE Computer Society's International Computer Software & Applications Conference (pp. 250-256). Publ by IEEE.

Adaptive selection of access path and join method. / Lee, Yann-Hang; Yu, Philip S.

Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. ed. / George J. Knafl. Publ by IEEE, 1989. p. 250-256.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lee, Y-H & Yu, PS 1989, Adaptive selection of access path and join method. in GJ Knafl (ed.), Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. Publ by IEEE, pp. 250-256, Proceedings of the Thirteenth Annual International Computer Software & Applications Conference - COMPSAC 89, Orlando, FL, USA, 9/20/89.
Lee Y-H, Yu PS. Adaptive selection of access path and join method. In Knafl GJ, editor, Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. Publ by IEEE. 1989. p. 250-256
Lee, Yann-Hang ; Yu, Philip S. / Adaptive selection of access path and join method. Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. editor / George J. Knafl. Publ by IEEE, 1989. pp. 250-256
@inproceedings{a06e43e016544382a0db12ecf3423cd2,
title = "Adaptive selection of access path and join method",
abstract = "An adaptive approach which utilizes the information embedded in indexes to identify the tuples satisfying a given predicate or having a match in a join operation is proposed. An access path (index or table scan) and a join method (index join, nested loop, sort-merge) are chosen to construct the results adaptively. This leads to the optimal evaluation of queries. With an efficient implementation, the adaptive decision process becomes a part of a query evaluation procedure, so that the overhead of the approach is minimized.",
author = "Yann-Hang Lee and Yu, {Philip S.}",
year = "1989",
language = "English (US)",
pages = "250--256",
editor = "Knafl, {George J.}",
booktitle = "Proceedings - IEEE Computer Society's International Computer Software & Applications Conference",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Adaptive selection of access path and join method

AU - Lee, Yann-Hang

AU - Yu, Philip S.

PY - 1989

Y1 - 1989

N2 - An adaptive approach which utilizes the information embedded in indexes to identify the tuples satisfying a given predicate or having a match in a join operation is proposed. An access path (index or table scan) and a join method (index join, nested loop, sort-merge) are chosen to construct the results adaptively. This leads to the optimal evaluation of queries. With an efficient implementation, the adaptive decision process becomes a part of a query evaluation procedure, so that the overhead of the approach is minimized.

AB - An adaptive approach which utilizes the information embedded in indexes to identify the tuples satisfying a given predicate or having a match in a join operation is proposed. An access path (index or table scan) and a join method (index join, nested loop, sort-merge) are chosen to construct the results adaptively. This leads to the optimal evaluation of queries. With an efficient implementation, the adaptive decision process becomes a part of a query evaluation procedure, so that the overhead of the approach is minimized.

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

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

M3 - Conference contribution

AN - SCOPUS:0024931808

SP - 250

EP - 256

BT - Proceedings - IEEE Computer Society's International Computer Software & Applications Conference

A2 - Knafl, George J.

PB - Publ by IEEE

ER -