Performance comparison of top-down recursive query evaluation strategies on Datalog benchmarks

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

1 Citation (Scopus)

Abstract

A performance comparison is given, using Datalog benchmarks, of top-down strategies for the evaluation of recursive queries. The top-down strategies that are compared include S. W. Dietrich and D. S. Warren's extension tables (Tech. Rep. 85-31, Dept. of Computer Science, SUNY at Stony Brook, 1985), H. Tamaki and T. Sato's multistage depth-first (Third Int. Conf. Logic Prog., pp. 84-98, 1986) and L. Vielle's query subquery (Fourth Int. Conf. on Logic Prog., pp. 74-103, 1987). These top-down strategies apply the dynamic programming principle to computations in which intermediate results are saved and subsequently used to avoid redundant computations. The performance comparisons show that extension tables' eager evaluation improves the naive demand-driven evaluation of multistage depth-first and QSQR/SLD and query/subquery.

Original languageEnglish (US)
Title of host publicationProceedings of the Hawaii International Conference on System Science
EditorsBruce D. Shriver
Place of PublicationNorth Hollywood, CA, United States
PublisherPubl by Western Periodicals Co
Pages621-629
Number of pages9
Volume2
ISBN (Print)0818619120
StatePublished - 1989
EventProceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences: Software Track - Kailua-Kona, Hawaii, USA
Duration: Jan 3 1989Jan 6 1989

Other

OtherProceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences: Software Track
CityKailua-Kona, Hawaii, USA
Period1/3/891/6/89

Fingerprint

Dynamic programming
Computer science

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Dietrich, S. (1989). Performance comparison of top-down recursive query evaluation strategies on Datalog benchmarks. In B. D. Shriver (Ed.), Proceedings of the Hawaii International Conference on System Science (Vol. 2, pp. 621-629). North Hollywood, CA, United States: Publ by Western Periodicals Co.

Performance comparison of top-down recursive query evaluation strategies on Datalog benchmarks. / Dietrich, Suzanne.

Proceedings of the Hawaii International Conference on System Science. ed. / Bruce D. Shriver. Vol. 2 North Hollywood, CA, United States : Publ by Western Periodicals Co, 1989. p. 621-629.

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

Dietrich, S 1989, Performance comparison of top-down recursive query evaluation strategies on Datalog benchmarks. in BD Shriver (ed.), Proceedings of the Hawaii International Conference on System Science. vol. 2, Publ by Western Periodicals Co, North Hollywood, CA, United States, pp. 621-629, Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences: Software Track, Kailua-Kona, Hawaii, USA, 1/3/89.
Dietrich S. Performance comparison of top-down recursive query evaluation strategies on Datalog benchmarks. In Shriver BD, editor, Proceedings of the Hawaii International Conference on System Science. Vol. 2. North Hollywood, CA, United States: Publ by Western Periodicals Co. 1989. p. 621-629
Dietrich, Suzanne. / Performance comparison of top-down recursive query evaluation strategies on Datalog benchmarks. Proceedings of the Hawaii International Conference on System Science. editor / Bruce D. Shriver. Vol. 2 North Hollywood, CA, United States : Publ by Western Periodicals Co, 1989. pp. 621-629
@inproceedings{6820362e3a70473ba2b994b5c2c9c58e,
title = "Performance comparison of top-down recursive query evaluation strategies on Datalog benchmarks",
abstract = "A performance comparison is given, using Datalog benchmarks, of top-down strategies for the evaluation of recursive queries. The top-down strategies that are compared include S. W. Dietrich and D. S. Warren's extension tables (Tech. Rep. 85-31, Dept. of Computer Science, SUNY at Stony Brook, 1985), H. Tamaki and T. Sato's multistage depth-first (Third Int. Conf. Logic Prog., pp. 84-98, 1986) and L. Vielle's query subquery (Fourth Int. Conf. on Logic Prog., pp. 74-103, 1987). These top-down strategies apply the dynamic programming principle to computations in which intermediate results are saved and subsequently used to avoid redundant computations. The performance comparisons show that extension tables' eager evaluation improves the naive demand-driven evaluation of multistage depth-first and QSQR/SLD and query/subquery.",
author = "Suzanne Dietrich",
year = "1989",
language = "English (US)",
isbn = "0818619120",
volume = "2",
pages = "621--629",
editor = "Shriver, {Bruce D.}",
booktitle = "Proceedings of the Hawaii International Conference on System Science",
publisher = "Publ by Western Periodicals Co",

}

TY - GEN

T1 - Performance comparison of top-down recursive query evaluation strategies on Datalog benchmarks

AU - Dietrich, Suzanne

PY - 1989

Y1 - 1989

N2 - A performance comparison is given, using Datalog benchmarks, of top-down strategies for the evaluation of recursive queries. The top-down strategies that are compared include S. W. Dietrich and D. S. Warren's extension tables (Tech. Rep. 85-31, Dept. of Computer Science, SUNY at Stony Brook, 1985), H. Tamaki and T. Sato's multistage depth-first (Third Int. Conf. Logic Prog., pp. 84-98, 1986) and L. Vielle's query subquery (Fourth Int. Conf. on Logic Prog., pp. 74-103, 1987). These top-down strategies apply the dynamic programming principle to computations in which intermediate results are saved and subsequently used to avoid redundant computations. The performance comparisons show that extension tables' eager evaluation improves the naive demand-driven evaluation of multistage depth-first and QSQR/SLD and query/subquery.

AB - A performance comparison is given, using Datalog benchmarks, of top-down strategies for the evaluation of recursive queries. The top-down strategies that are compared include S. W. Dietrich and D. S. Warren's extension tables (Tech. Rep. 85-31, Dept. of Computer Science, SUNY at Stony Brook, 1985), H. Tamaki and T. Sato's multistage depth-first (Third Int. Conf. Logic Prog., pp. 84-98, 1986) and L. Vielle's query subquery (Fourth Int. Conf. on Logic Prog., pp. 74-103, 1987). These top-down strategies apply the dynamic programming principle to computations in which intermediate results are saved and subsequently used to avoid redundant computations. The performance comparisons show that extension tables' eager evaluation improves the naive demand-driven evaluation of multistage depth-first and QSQR/SLD and query/subquery.

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

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

M3 - Conference contribution

AN - SCOPUS:0024864219

SN - 0818619120

VL - 2

SP - 621

EP - 629

BT - Proceedings of the Hawaii International Conference on System Science

A2 - Shriver, Bruce D.

PB - Publ by Western Periodicals Co

CY - North Hollywood, CA, United States

ER -