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

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

1 Scopus citations

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
PublisherPubl by Western Periodicals Co
Pages621-629
Number of pages9
ISBN (Print)0818619120
StatePublished - Dec 1 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

Publication series

NameProceedings of the Hawaii International Conference on System Science
Volume2
ISSN (Print)0073-1129

Other

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

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'Performance comparison of top-down recursive query evaluation strategies on Datalog benchmarks'. Together they form a unique fingerprint.

Cite this