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

Author

Dietrich, Suzanne Wagner

Author_Institution

Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA

Volume

2

fYear

1989

fDate

3-6 Jan 1989

Firstpage

621

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 (see Tech. Rep., 85-31, Dept. of Computer Science, SUNY at Stony Brook (1985)), H. Tamaki and T. Sato´s multistage depth-first (see Third Int. Conf. Logic Prog., p.84-98 (1986)) and L. Vielle´s query subquery (see Fourth Int. Conf. on Logic Prog., p.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

Keywords

database management systems; information retrieval; Datalog benchmarks; QSQR/SLD; demand-driven evaluation; multistage depth-first; performance comparison; top-down recursive query evaluation strategies; Computer science; Database languages; Database systems; Deductive databases; Employment; Iterative methods; Logic programming; Query processing; Relational databases; Superluminescent diodes;

fLanguage

English

Publisher

ieee

Conference_Titel

System Sciences, 1989. Vol.II: Software Track, Proceedings of the Twenty-Second Annual Hawaii International Conference on

Conference_Location

Kailua-Kona, HI

Print_ISBN

0-8186-1912-0

Type

conf

DOI

10.1109/HICSS.1989.48041

Filename

48041