A Theorem on Boolean Matrices.
Stephen Warshall:
A Theorem on Boolean Matrices.
J. ACM 9(1): 11-12(1962)@article{DBLP:journals/jacm/Warshall62,
author = {Stephen Warshall},
title = {A Theorem on Boolean Matrices},
journal = {J. ACM},
volume = {9},
number = {1},
year = {1962},
pages = {11-12},
ee = {db/journals/jacm/Warshall62.html, http://doi.acm.org/10.1145/321105.321107},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
CDROM Version: Load the CDROM "Volume 5 Issue 2, JACM, VLDB-J, POS, ..." and ...
DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...
BibTeX
Online Edition
Citation Page
BibTeX
Referenced by
- Shaul Dar, Raghu Ramakrishnan:
A Performance Study of Transitive Closure Algorithms.
SIGMOD Conference 1994: 454-465
- Yannis E. Ioannidis, Raghu Ramakrishnan, Linda Winger:
Transitive Closure Algorithms Based on Graph Traversal.
ACM Trans. Database Syst. 18(3): 512-576(1993)
- Håkan Jakobsson:
On Tree-Based Techniques for Query Evaluation.
PODS 1992: 380-392
- Shaul Dar, H. V. Jagadish:
A Spanning Tree Transitive Closure Algorithm.
ICDE 1992: 2-11
- Håkan Jakobsson:
Mixed-Approach Algorithms for Transitive Closure.
PODS 1991: 199-205
- Steve Taylor, Nabil I. Hachem:
A Direct Algorithm for Computing the Transitive Closure of a Two-Dimensionally Structured File.
MFDBS 1991: 146-159
- Yan-Nong Huang, Jean-Pierre Cheiney:
Parallel Computation of Direct Transitive Closures.
ICDE 1991: 192-199
- Sumit Ganguly, Ravi Krishnamurthy, Abraham Silberschatz:
An Analysis Technique for Transitive Closure Algorithms: A Statistical Approach.
ICDE 1991: 728-735
- Rakesh Agrawal, Shaul Dar, H. V. Jagadish:
Direct Transitive Closure Algorithms: Design and Performance Evaluation.
ACM Trans. Database Syst. 15(3): 427-458(1990)
- Jason Tsong-Li Wang, Dennis Shasha:
Query Processing for Distance Metrics.
VLDB 1990: 602-613
- Rakesh Agrawal, H. V. Jagadish:
Hybrid Transitive Closure Algorithms.
VLDB 1990: 326-334
- Jeffrey D. Ullman, Mihalis Yannakakis:
The Input/Output Complexity of Transitive Closure.
SIGMOD Conference 1990: 44-53
- Mihalis Yannakakis:
Graph-Theoretic Methods in Database Theory.
PODS 1990: 230-242
- Bin Jiang:
A Suitable Algorithm for Computing Partial Transitive Closures in Databases.
ICDE 1990: 264-271
- Stefano Ceri, Georg Gottlob, Letizia Tanca:
What you Always Wanted to Know About Datalog (And Never Dared to Ask).
IEEE Trans. Knowl. Data Eng. 1(1): 146-166(1989)
- Georg Gottlob, Michael Schrefl, Markus Stumptner:
On the Interaction between Transitive Closure and Functional Dependencies.
MFDBS 1989: 187-206
- Isabel F. Cruz, Theodore S. Norvell:
Aggregative Closure: An Extension of Transitive Closure.
ICDE 1989: 384-391
- Rakesh Agrawal, H. V. Jagadish:
Materialization and Incremental Update of Path Information.
ICDE 1989: 374-383
- Yannis E. Ioannidis, Raghu Ramakrishnan:
Efficient Transitive Closure Algorithms.
VLDB 1988: 382-394
- Seppo Sippu, Eljas Soisalon-Soininen:
A Generalized Transitive Closure for Relational Queries.
PODS 1988: 325-332
- Rakesh Agrawal, H. V. Jagadish:
Direct Algorithms for Computing the Transitive Closure of Database Relations.
VLDB 1987: 255-266
- H. V. Jagadish, Rakesh Agrawal, Linda Ness:
A Study of Transitive Closure As a Recursion Mechanism.
SIGMOD Conference 1987: 331-344
- Hongjun Lu, Krishna P. Mikkilineni, James P. Richardson:
Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation.
ICDE 1987: 112-119
- Ulrich Güntzer, Werner Kießling, Rudolf Bayer:
On the Evaluation of Recursion in (Deductive) Database Systems by Efficient Differential Fixpoint Iteration.
ICDE 1987: 120-129
- Amit P. Sheth, Anoop Singhal, Ming T. Liu:
An Adaptive Concurrency Control Strategy for Distributed Database Systems.
ICDE 1984: 474-482
- Michael V. Mannino, Wolfgang Effelsberg:
Matching Techniques in Global Schema Design.
ICDE 1984: 418-425
- Sylvia L. Osborn:
Towards a Universal Relation Interface.
VLDB 1979: 52-60
BibTeX
Copyright © Sun May 17 00:05:13 2009
by Michael Ley (ley@uni-trier.de)