The processing and evaluation of transitive closure queries

  • Jiawei Han
  • Ghassen Qadah
  • Chinying Chaou
Databases And Logic

DOI: 10.1007/3-540-19074-0_47

Part of the Lecture Notes in Computer Science book series (LNCS, volume 303)
Cite this paper as:
Han J., Qadah G., Chaou C. (1988) The processing and evaluation of transitive closure queries. In: Schmidt J.W., Ceri S., Missikoff M. (eds) Advances in Database Technology—EDBT '88. EDBT 1988. Lecture Notes in Computer Science, vol 303. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • Jiawei Han
    • 1
  • Ghassen Qadah
    • 2
  • Chinying Chaou
    • 2
  1. 1.Simon Fraser UniversityCanada
  2. 2.Northwestern UniversityUSA

Personalised recommendations