Parallel Transitive Closure Computations Using Topological Sort.

@inproceedings{DBLP:conf/pdis/HuaH91,
  author    = {Kien A. Hua and
               Sridhar Hannenhalli},
  title     = {Parallel Transitive Closure Computations Using Topological Sort},
  booktitle = {Proceedings of the First International Conference on Parallel
               and Distributed Information Systems (PDIS 1991), Fontainebleu
               Hilton Resort, Miami Beach, Florida, December 4-6, 1991},
  publisher = {IEEE Computer Society},
  year      = {1991},
  isbn      = {0-8186-2295-4},
  pages     = {122-129},
  ee        = {db/conf/pdis/HuaH91.html},
  crossref  = {DBLP:conf/pdis/91},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

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

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-7 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

Printed Edition

Referenced by

1. Keh-Chang Guh, Clement T. Yu: Efficient Query Processing for a Subset of Linear Recursive Binary Rules. IEEE Trans. Knowl. Data Eng. 6(5): 842-849(1994)
2. Maurice A. W. Houtsma, Annita N. Wilschut, Jan Flokstra: Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA/DB. VLDB 1993: 206-217
3. Maurice A. W. Houtsma, Peter M. G. Apers, Gideon L. V. Schipper: Data fragmentation for parallel transitive closure strategies. ICDE 1993: 447-456

Last update Fri May 25 08:31:23 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page