Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Super-TC: an efficient generic algorithm for processing the instantiated transitive-closure queries in deductive database systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Qadah, G.Z. ; Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA

A generic algorithm is presented, suitable for processing an important class of recursive queries, the so-called instantiated transitive-closure (TC) queries. The most important characteristics of this algorithm is that it reads any data-page from the system's disk at most once, i.e., the worst-case I/O behavior of this algorithm is linear with respect to the number of pages storing the database. Several variants, each with a different main-memory requirement, to the super-TC algorithm as well as a comparative performance evaluation of these variants are presented. The super-TC variant with minimum main-memory requirement is determined. A comparison of this variant with the more traditional δ-wavefront algorithm reveals the superiority of the super-TC variant, which is up to seven times faster

Published in:

Tools for Artificial Intelligence, 1990.,Proceedings of the 2nd International IEEE Conference on

Date of Conference:

6-9 Nov 1990