By Topic

The efficient computation of strong partial transitive-closures

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
$33 $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

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

The development of efficient algorithms to process the different forms of transitive-closure queries within the context of large database systems has attracted a large volume of research efforts. The authors present a new algorithm that is suitable for processing one of these forms, the strong partially instantiated query, in which one of the query's arguments is instantiated to a set of constants. The processing of this algorithm yields a set of tuples that draw their values from both of the query's instantiated and uninstantiated arguments. This algorithm avoids the redundant computations and the high storage costs found in a number of similar algorithms

Published in:

Data Engineering, 1993. Proceedings. Ninth International Conference on

Date of Conference:

19-23 Apr 1993