By Topic

Evaluation of transitive closure in distributed 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
$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)
K. -C. Guh ; Dept. of Electr. Eng. & Comput. Sci., Wisconsin Univ., Milwaukee, WI, USA ; C. T. Yu

A special schema is constructed to represent the data of a binary relation so that the transitive closure can be evaluated efficiently in distributed database systems. The method is economical in communication cost and at the same time preserves the fast access paths for efficient parallel processing of transitive closure at local sites. Updating of data is also discussed.<>

Published in:

IEEE Journal on Selected Areas in Communications  (Volume:7 ,  Issue: 3 )