ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

A Spanning Tree Transitive Closure Algorithm.

Shaul Dar, H. V. Jagadish: A Spanning Tree Transitive Closure Algorithm. ICDE 1992: 2-11
@inproceedings{DBLP:conf/icde/DarJ92,
  author    = {Shaul Dar and
               H. V. Jagadish},
  editor    = {Forouzan Golshani},
  title     = {A Spanning Tree Transitive Closure Algorithm},
  booktitle = {Proceedings of the Eighth International Conference on Data Engineering,
               February 3-7, 1992, Tempe, Arizona},
  publisher = {IEEE Computer Society},
  year      = {1992},
  isbn      = {0-8186-2545-7},
  pages     = {2-11},
  ee        = {db/conf/icde/DarJ92.html},
  crossref  = {DBLP:conf/icde/92},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1992 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 6, ICDE 1984-1995" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Printed Edition

Forouzan Golshani (Ed.): Proceedings of the Eighth International Conference on Data Engineering, February 3-7, 1992, Tempe, Arizona. IEEE Computer Society 1992, ISBN 0-8186-2545-7
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[1]
Rakesh Agrawal: Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries. ICDE 1987: 580-590 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[2]
Rakesh Agrawal, Alexander Borgida, H. V. Jagadish: Efficient Management of Transitive Relationships in Large Data and Knowledge Bases. SIGMOD Conference 1989: 253-262 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[3]
Rakesh Agrawal, H. V. Jagadish: Hybrid Transitive Closure Algorithms. VLDB 1990: 326-334 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[4]
Rakesh Agrawal, Shaul Dar, H. V. Jagadish: Direct Transitive Closure Algorithms: Design and Performance Evaluation. ACM Trans. Database Syst. 15(3): 427-458(1990) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[5]
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[6]
Hassan Aït-Kaci, Robert S. Boyer, Patrick Lincoln, Roger Nasr: Efficient Implementation of Lattice Operations. ACM Trans. Program. Lang. Syst. 11(1): 115-146(1989) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[7]
...
[8]
François Bancilhon, Raghu Ramakrishnan: An Amateur's Introduction to Recursive Query Processing Strategies. SIGMOD Conference 1986: 16-52 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[9]
...
[10]
Isabel F. Cruz, Theodore S. Norvell: Aggregative Closure: An Extension of Transitive Closure. ICDE 1989: 384-391 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[11]
Jürgen Ebert: A Sensitive Transitive Closure Algorithm. Inf. Process. Lett. 12(5): 255-258(1981) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[12]
J. Eve, Reino Kurki-Suonio: On Computing the Transitive Closure of a Relation. Acta Inf. 8: 303-314(1977) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[13]
Yannis E. Ioannidis: On the Computation of the Transitive Closure of Relational Operators. VLDB 1986: 403-411 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[14]
Yannis E. Ioannidis, Raghu Ramakrishnan: Efficient Transitive Closure Algorithms. VLDB 1988: 382-394 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[15]
Giuseppe F. Italiano: Amortized Efficiency of a Path Retrieval Data Structure. Theor. Comput. Sci. 48(3): 273-281(1986) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[16]
H. V. Jagadish, Rakesh Agrawal, Linda Ness: A Study of Transitive Closure As a Recursion Mechanism. SIGMOD Conference 1987: 331-344 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[17]
H. V. Jagadish: A Compression Technique to Materialize Transitive Closure. ACM Trans. Database Syst. 15(4): 558-598(1990) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[18]
Håkan Jakobsson: Mixed-Approach Algorithms for Transitive Closure. PODS 1991: 199-205 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[19]
Bin Jiang: A Suitable Algorithm for Computing Partial Transitive Closures in Databases. ICDE 1990: 264-271 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[20]
Hongjun Lu: New Strategies for Computing the Transitive Closure of a Database Relation. VLDB 1987: 267-274 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[21]
Paul Walton Purdom Jr.: A Transitive Closure Algorithm. BIT 10: 76-94(1970) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[22]
Arnon Rosenthal, Sandra Heiler, Umeshwar Dayal, Frank Manola: Traversal Recursion: A Practical Approach to Supporting Recursive Applications. SIGMOD Conference 1986: 166-176 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[23]
Lothar Schmitz: An improved transitive closure algorithm. Computing 30(4): 359-371(1983) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[24]
Robert Endre Tarjan: Depth-First Search and Linear Graph Algorithms. SIAM J. Comput. 1(2): 146-160(1972) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[25]
Jeffrey D. Ullman, Mihalis Yannakakis: The Input/Output Complexity of Transitive Closure. SIGMOD Conference 1990: 44-53 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[26]
Patrick Valduriez, Haran Boral: Evaluation of Recursive Queries Using Join Indices. Expert Database Conf. 1986: 271-293 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[27]
Stephen Warshall: A Theorem on Boolean Matrices. J. ACM 9(1): 11-12(1962) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Copyright © Fri Mar 12 17:13:42 2010 by Michael Ley (ley@uni-trier.de)