A performance study of transitive closure algorithms

ACM SIGMOD Record

Volumn 23, Issue 2, 1994, Pages 454-465

  Dar, Shaul ^a   Ramakrishnan, Raghu ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST ACCOUNTING; GRAPHIC METHODS; PERFORMANCE; QUERY LANGUAGES;

TRANSITIVE CLOSURE ALGORITHMS;

DATABASE SYSTEMS;

EID: 0028445546     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/191843.191928     Document Type: Article

References (28)

1. R. Agrawal and H. V. Jagadish, “Direct Algorithms for Computing the Transitive Closure of Database Relations”, Proc. 13th Int'l Conf. Very Large Data Bases, Brighton, England, Sept. 1987, 255-266.
2. R. Agrawal and H. V. Jagadish, “Hybrid Transitive Closure Algorithms”, Proc. 16th Int'l Conf. Very Large Data Bases, Brisbane, Australia, 1990.
3. R. Agrawal, S. Dar and H. V. Jagadish, “Direct Transitive Closure Algorithms: Design and Performance Evaluation”, ACM Trans. Database Syst. 15, 3 (Sep. 1990),.
4. A. V. Aho, E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1975.
5. C. Beeri and R. Ramakrishnan, “On the Power of Magic”, Proc. 6th Symp. Principles of Database Systems, San Diego, California, March 1987, 269-283.
6. S. Dar and H. V. Jagadish, “A Spanning Tree Transitive Closure Algorithm”, IEEE 8th Int'l Conf. on Data Engineering, Phoenix, Arizona, Feb. 1992, 2-11.
7. S. Dar, “Augmenting Database with Generalized Transitive Closure”, Univ. Wisconsin, Madison, Wisconsin, 1993. Ph.D. Dissertation.
8. J. Ebert, “A Sensitive Transitive Closure Algorithm”, Information Processing Letters 12, (1981), 255-258.
9. J. Eve and R. Kurki-Suonio, “On Computing the Transitive Closure of a Relation”, Acta Informatica 8, (1977), 303-314.
10. A. Goralcikova and V. Koubek, “A Reduct and Closure Algorithm for Graphs.”, Proceedings of the Int'l Conf. on Mathematical Foundations of Computer Science, 1979, 301-307.
11. K. A. Hua and J. X. W. Su, “Efficient Evaluation of Traversal Recursion Using Connectivity Index”, Proceedings 9th Int'l Conf. on Data Engineering, Vienna, Austria, April 1993.
12. Y. E. Ioannidis, R. Ramakrishnan and L. Winger, “Transitive Closure Algorithms Based on Depth-First Search”, ACM Trans. Database Syst.,. to appear.
13. Y. E. Ioannidis and R. Ramakrishnan, “An Efficient Transitive Closure Algorithm”, Proc. 14th Int'l Conf. Very Large Data Bases, Los Angeles, California, Aug.-Sept. 1988.
14. H. Jakobsson, “Mixed-Approach Algorithms for Transitive Closure”, Proc. 10th Symp. Principles of Database Systems, Denver, Colorado, 1991, 199-205.
15. H. Jakobsson, “On Tree-Based Techniques for Query Evaluation”, Proc. 11th Symp. Principles of Database Systems, 1992, 380-392.
16. H. Jakobsson, “Mixed-Approach Algorithms for Transitive Closure”, Unpublished Manuscript, Computer Science Dept., Stanford Univ., Stanford, California, 1993.
17. B. Jiang, “Design, Analysis, and Evaluation of Algorithms for Computing Partial Transitive in Databases”, Computer Science Tech. Rep., ETH Zurich, June 1990.
18. B. Jiang, “A Suitable Algorithm for Computing Partial Transitive Closures in Databases”, Proc. IEEE 6th Int'l Conf. Data Engineering, Los Angeles, California, Feb. 1990.
19. R. Kabler, Y. E. Ioannidis and M. Carey, “Performance Evaluation of Algorithms for Transitive Closure”, Information Systems 17, 5 (Sep. 1992),.
20. I. Mumick and H. Pirahesh, “Overbound and Right-Linear Queries”, Proc. 10th Symp. Principles of Database Systems, Denver, Colorado, May 1991, 127-141.
21. J. F. Naughton, R. Ramakrishnan, Y. Sagiv and J. D. Ullman, “Efficient Evaluation of Right-, Left-, and Multi-Linear Rules”, Proc. ACM-SIGMOD 1989 Int'l Conf. Management of Data, Portland, Oregon, May-June 1989, 235-242.
22. P. Purdom, “A Transitive Closure Algorithm”, BIT 10, (1970), 7694.
23. L. Schmitz, “An Improved Transitive Closure Algorithm”, Computing 30, (1983), 359-371.
24. C. P. Schnorr, “An Algorithm for Transitive Closure with Linear Expected Time”, SIAM J. Computing 7, 2 (May 1978), 127-133.
25. J. D. Ullman and M. Yannakakis, “The Input/Output Complexity of Transitive Closure”, Proc ACM-SIGMOD 1990 Int'l Conf. on Management of Data, Atlantic City.
26. H. S. Warren, “A Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations”, Commun. ACM 18, 4 (April 1975), 218-220.
27. S. Warshall, “A Theorem on Boolean Matrices”, J. ACM 9, 1 (Jan. 1962), 11-12.
28. M. Yannakakis, “Graph-Theoretic Methods in Database Theory”, Proc. 9th Symp. Principles of Database Systems, Nashville, Tennessee, April 1990, 230-242.