The processing and evaluation of transitive closure queries

Jiawei Han, Ghassen Qadah, Chinying Chaou

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


A transitive closure operator will be an important new operator in future deductive database systems. We discuss the compilation of recursive rule clusters into formulas containing transitive closure operations and study three promising algorithms for the processing of transitive closure queries: the wavefront algorithm, the δ-wavefront algorithm and the level-relaxed δ-wavefront algorithm. The relative processing efficiency of these algorithms are analyzed and compared based on different database structures and accessing methods. Our study shows that the δ-wavefront algorithm performs consistently better than the wavefront algorithm, and the level-relaxed δ-wavefront algorithm has high potential of further reducing I/O accessing cost on the databases with clustered derivation paths. The study also provides some interesting heuristics on the database structures and implementation techniques in the processing of recursive database queries.

Original languageEnglish (US)
Title of host publicationAdvances in Database Technology—EDBT 1988 - International Conference on Extending Database Technology, Proceedings
EditorsStefano Ceri, Joachim W. Schmidt, Michele Missikoff
Number of pages27
ISBN (Print)9783540190745
StatePublished - 1988
Externally publishedYes
Event1st International Conference on Extending Database Technology, EDBT 1988 - Venice, Italy
Duration: Mar 14 1988Mar 18 1988

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume303 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other1st International Conference on Extending Database Technology, EDBT 1988

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'The processing and evaluation of transitive closure queries'. Together they form a unique fingerprint.

Cite this