A Direct Algorithm for Computing the Transitive Closure of a Two-Dimensionally Structured File.

@inproceedings{DBLP:conf/mfdbs/TaylorH91,
  author    = {Steve Taylor and
               Nabil I. Hachem},
  editor    = {Bernhard Thalheim and
               J{\'a}nos Demetrovics and
               Hans-Detlef Gerhardt},
  title     = {A Direct Algorithm for Computing the Transitive Closure of a
               Two-Dimensionally Structured File},
  booktitle = {MFDBS 91, 3rd Symposium on Mathematical Fundamentals of Database
               and Knowledge Bases Systems, Rostock, Germany, May 6-9, 1991,
               Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {495},
  year      = {1991},
  isbn      = {3-540-54009-1},
  pages     = {146-159},
  ee        = {db/conf/mfdbs/TaylorH91.html},
  crossref  = {DBLP:conf/mfdbs/91},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-2 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

References

[AgDaJa89]

Rakesh Agrawal, Shaul Dar, H. V. Jagadish: Composition of Database Relations. ICDE 1989: 102-108

[AgJa87]

Rakesh Agrawal, H. V. Jagadish: Direct Algorithms for Computing the Transitive Closure of Database Relations. VLDB 1987: 255-266

[AgJa90]

Rakesh Agrawal, H. V. Jagadish: Hybrid Transitive Closure Algorithms. VLDB 1990: 326-334

[AGR87]

Rakesh Agrawal: Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries. ICDE 1987: 580-590

[AhHoUl74]

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6

[BaRa86]

François Bancilhon, Raghu Ramakrishnan: An Amateur's Introduction to Recursive Query Processing Strategies. SIGMOD Conference 1986: 16-52

[CeGoTa89]

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)

[ChMa89]

Jean-Pierre Cheiney, Christophe de Maindreville: A Parallel Transitive Closure Algorithm Using Hash-Based Clustering. IWDM 1989: 301-316

[CoWi87]

Don Coppersmith, Shmuel Winograd: Matrix Multiplication via Arithmetic Progressions. STOC 1987: 1-6

[HAC90]

...

[HaQaCh88]

Jiawei Han, Ghassan Z. Qadah, Chinying Chaou: The Processing and Evaluation of Transitive Closure Queries. EDBT 1988: 49-75

[IOA86]

Yannis E. Ioannidis: On the Computation of the Transitive Closure of Relational Operators. VLDB 1986: 403-411

[IoRa88]

Yannis E. Ioannidis, Raghu Ramakrishnan: Efficient Transitive Closure Algorithms. VLDB 1988: 382-394

[JaAgNe87]

H. V. Jagadish, Rakesh Agrawal, Linda Ness: A Study of Transitive Closure As a Recursion Mechanism. SIGMOD Conference 1987: 331-344

[KLE56]

...

[LU87]

Hongjun Lu: New Strategies for Computing the Transitive Closure of a Database Relation. VLDB 1987: 267-274

[ULL89]

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
Contents

[UIYa90]

Jeffrey D. Ullman, Mihalis Yannakakis: The Input/Output Complexity of Transitive Closure. SIGMOD Conference 1990: 44-53

[VaBo86]

Patrick Valduriez, Haran Boral: Evaluation of Recursive Queries Using Join Indices. Expert Database Conf. 1986: 271-293

[WAR75]

Henry S. Warren Jr.: A Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations. Commun. ACM 18(4): 218-220(1975)

[WAR62]

Stephen Warshall: A Theorem on Boolean Matrices. J. ACM 9(1): 11-12(1962)

Last update Thu Sep 13 06:41:52 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page