Transitive closure algorithms for very large databases

DOI10.1007/3-540-50728-0_39OpenAlexW1554224014MaRDI QIDQ6199459FDOQ6199459

Authors: Joachim Biskup 

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-50728-0_39

Recommendations

• An efficient database transitive closure algorithm
• scientific article; zbMATH DE number 813252
• Performance evaluation of algorithms for transitive closure
• A graph-based decomposition approach for recursive query processing
• An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15)

Cites Work

• A Theorem on Boolean Matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• A modification of Warshall's algorithm for the transitive closure of binary relations
• Title not available (Why is that?)

Cited In (1)

• A graph-based decomposition approach for recursive query processing

This page was built for publication: Transitive closure algorithms for very large databases

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