Transitive Closure and the LOGA⁺-Strategy for its Efficient Evaluation.

@inproceedings{DBLP:conf/mfdbs/YanM89,
  author    = {W. Yan and
               Nelson Mendon\c{c}a Mattos},
  editor    = {J{\'a}nos Demetrovics and
               Bernhard Thalheim},
  title     = {Transitive Closure and the LOGA$^{\mbox{+}}$-Strategy for its Efficient Evaluation},
  booktitle = {MFDBS 89, 2nd Symposium on Mathematical Fundamentals of Database
               Systems, Visegr{\'a}d, Hungary, June 26-30, 1989},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {364},
  year      = {1989},
  isbn      = {3-540-51251-9},
  pages     = {415-428},
  ee        = {db/conf/mfdbs/YanM89.html},
  crossref  = {DBLP:conf/mfdbs/89},
  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

[AJ87]

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

[Ba85]

Rudolf Bayer: Database Technology for Expert Systems. Wissensbasierte Systeme 1985: 1-16 BibTeX

[Ba86]

François Bancilhon: Naive Evaluation of Recursively Defined Relations. On Knowledge Base Management Systems (Islamorada) 1985: 165-178 BibTeX

[BMSU86]

François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman: Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986: 1-15 BibTeX

[BR86]

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

[BR88a]

François Bancilhon, Raghu Ramakrishnan: Performance Evaluation of Data Intensive Logic Programs. Foundations of Deductive Databases and Logic Programming. 1988: 439-517 BibTeX

[BR88b]

Catriel Beeri, Raghu Ramakrishnan: On the Power of Magic. J. Log. Program. 10(1/2/3&4): 255-299(1991) BibTeX

[Da87]

...

[DS86]

Umeshwar Dayal, John Miles Smith: PROBE: A Knowledge-Oriented Database Management System. On Knowledge Base Management Systems (Islamorada) 1985: 227-257 BibTeX

[GMN84]

Hervé Gallaire, Jack Minker, Jean-Marie Nicolas: Logic and Databases: A Deductive Approach. ACM Comput. Surv. 16(2): 153-185(1984) BibTeX

[He86]

...

[HL86]

Jiawei Han, Hongjun Lu: Some Performance Results on Recursive Query Processing in Relational Database Systems. ICDE 1986: 533-541 BibTeX

[HQC88]

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

[Io86]

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

[IW88]

Yannis E. Ioannidis, Eugene Wong: Transforming Nonlinear Recursion into Linear Recursion. Expert Database Conf. 1988: 401-421 BibTeX

[JAN87]

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

[KL86]

...

[LMR87]

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 BibTeX

[SZ87]

Domenico Saccà, Carlo Zaniolo: Magic Counting Methods. SIGMOD Conference 1987: 49-59 BibTeX

[Vi86]

Laurent Vieille: Recursive Axioms in Deductive Databases: The Query/Subquery Approach. Expert Database Conf. 1986: 253-267 BibTeX

[Ya87]

...

[Ya89]

...

[Zy87]

Weining Zhang, Clement T. Yu: A Necessary Condition for a Doubly Recursive Rule to be Equivalent to a Linear Recursive Rule. SIGMOD Conference 1987: 345-356 BibTeX