Performance evaluation of algorithms for transitive closure

DOI10.1016/0306-4379(92)90035-LMaRDI QIDQ689842zbMATH OpenOpenAlexFDO

Authors Robert Kabler, Yannis E. Ioannidis, Michael J. Carey

Publication date 20 December 1993

Published in Information Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0306-4379(92)90035-l

zbMATH Keywords

algorithms for transitive closurerandom acyclic graphsrandom general graphsregular trees

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)

Recommendations

• An efficient database transitive closure algorithm
• scientific article; zbMATH DE number 813252
• Algorithms for transitive closure
• scientific article; zbMATH DE number 88951
• An experimental study of dynamic algorithms for transitive closure

Cited in

(5)

• An efficient database transitive closure algorithm
• Graph indexing for spatial data traversal in road map databases
• Efficient computation of transitive closures
• scientific article; zbMATH DE number 219224 (Why is no real title available?)
• Transitive closure algorithms for very large databases

This page was built for publication: Performance evaluation of algorithms for transitive closure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689842)