Abstract
The integration of logic rules and relational databases has recently emerged as an important technique for developing knowledge management systems. An important class of logic rules utilized by these systems is the so-called transitive closure rules, the processing of which requires the computation of the transitive closure of database relations referenced by these rules. This article presents a new algorithm suitable for computing the transitive closure of very large database relations. This algorithm proceeds in two phases. In the first phase, a general graph is condensed into an acyclic one, and at the same time a special sparse matrix is formed from the acyclic graph. The second phase is the main one, in which all the page I/O operations are minimized by removing most of the redundant operations that appear in previous algorithms. Using simulation, this article also studies and examines the performance of this algorithm and compares it with the previous algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Agrawal and H. V. Jagadish, “Hybrid transitive closure algorithms,” inProc. 16th VLDB Conf., Brisbane, Australia, 1990, pp. 326–334.
R. Agrawal and H. V. Jagadish, “Multiprocessor transitive closure algorithms,” inProc. Int. Symp. Databases in Parallel and Distributed Syst., Austin, TX, 1988, pp. 56–66.
R. Agrawal and H. V. Jagadish, “Direct algorithms for the transitive closure of database relations,” inProc. 13th Int. Conf. Very Large Databases, San Francisco, CA, September 1987, pp. 255–266.
F. Banchilon, “Naive evaluations of recurively defined relations,” inProc. Islamorada Workshop on Large Scale Knowledge Base and Reasoning Systems Technical Report DB-004-85, MCC, Austin, TX, February 1985.
F. Bancilhon and R. Ramakrishnan, “An amateur's introduction to recursive query processing strategies,” inProc. 1986 ACM-SIGMOD Conf., Washington, DC, 1986, pp. 16–52.
J. Biskup and H. Stiefeling, “Transitive closure algorithms for very large databases,” inWorkshop on Graph Theoretical Concepts in Computer Sci., Amsterdam, June 1988.
S. Dar and H. V. Jagadish, “A spanning tree transitive closure algorithm,”Proc. Eighth Data Eng., pp. 2–11, 1992.
J. Han, G. Qadah, and C. Chaou, “The processing of the transitive closure queries,” inProc. 1988 Int. Conf. Extending Database Technol., Venice, Italy, 1988, pp. 48–75.
Y. E. Ioannidis, “On the computation of the transitive closure of relational operators,” inProc. 12th Int. Conf. VLDB, Kyoto, Japan, 1986, pp. 403–411.
Y. E. Ioannidis and R. Ramakrishnan, “Efficient transitive closure algorithms,” inProc. 14th VLDB Conf., Long Beach, CA, 1988, pp. 382–394.
G. Z. Qadah, L. Henschen, and J. Kim, “Efficient algorithms for the instantiated transitive closure queries,”IEEE TSE vol. 17, no. 3, pp. 296–309, March 1991.
G. Z. Qadah and J. Kim, “The processing of instantiated transitive-closure queries on uniprocessor and shared-nothing multiprocessor systems,”J. Data Knowledge Eng. vol. 8, pp. 57–89, August 1992.
I. H. Toroslu and G. Z. Qadah, “New transitive closure algorithm for recursive query processing in deductive databases,” inProc. Fourth Int. Conf. Tools with AI, Washington, DC, 1992, pp. 268–275.
I. H. Toroslu and G. Z. Qadah, “The efficient computation of strong partial transitive closures,” inProc. Ninth Data Eng., Vienna, Austria, pp. 530–537, 1993.
I. H. Toroslu and L. Henchen, “An efficient transitive closure algorithm for distributed databases,” inFifth Int. Conf. Comput. Inf., Sudbory, Canada, 1993.
J. D. Ullman and M. Yannakakis, “The input/output complexity of transitive closure,” inProc. ACM-SIGMOD Int. Conf. Management of Data, Atlantic City, NJ, 1990, pp. 44–53.
P. Valduriez and H. Boral, “Evaluation of recursive queries using join indices,” inProc. 1st Int. Expert Database Syst. Conf., Charleston, SC, April 1986, pp. 197–208.
P. Valduriez and S. Khoshafian, “Parallel evaluation of the transitive closure of a database relation,”Int. J. Parallel Programming vol. 17, no. 1, pp. 19–37, February 1988.
H. Gallaire, J. Minker, and J. Nicolas, “Logic and databases: A deductive approach,”Comput. Surv. vol. 16, no. 2, pp. 153–185, June 1984.
H. S. Warren, “A modification of Warshall's algorithm for the transitive closure of binary relation,”CACM vol. 18, no. 4, pp. 218–220, April 1975.
S. Warshall, “A theorem on Boolean matrices,”J. ACM vol. 9, no. 1, pp. 11–12, January 1962.
J. Ebert, “A sensitive transitive closure algorithm,”Inf. Process. Lett. vol. 12, no. 5, pp. 255–258, 1981.
J. Eve and R. Kurki-Suonia, “On computing the transitive closure of a relation,”Acta Inf. vol. 8, pp. 303–314, 1977.
R. Tarjan, “Depth-first search and linear graph algorithms,”SIAM J. Comput., no. 1, pp. 146–160, 1972.
D. J. DeWitt et al., “Implementation techniques for main memory database systems,” inProc. Third ACM-SIGMOD, Waterloo, Ontario, Canada, pp. 1–8, 1984.
L. D. Shapiro, “Join processing in database systems with large main memories,”ACM TODS vol. 11, no. 3, pp. 239–264, September 1986.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Toroslu, I.H., Qadah, G.Z. & Henschen, L. An efficient database transitive closure algorithm. Appl Intell 4, 205–218 (1994). https://doi.org/10.1007/BF00872109
Issue Date:
DOI: https://doi.org/10.1007/BF00872109