Complex transitive closure queries on a fragmented graph

DOI10.1007/3-540-53507-1_96MaRDI QIDQ4694707zbMATH OpenFDO

Authors Maurice A. W. Houtsma, Peter Apers, Stefano Ceri

Publication date 29 June 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53507-1_96

zbMATH Keywords

distributed computationdistributed databasestransitive closure queries

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Distributed algorithms (68W15)

Recommendations

• PVM computation of the transitive closure: The dependency graph approach
• An efficient database transitive closure algorithm
• scientific article; zbMATH DE number 813252
• Performance evaluation of algorithms for transitive closure
• Querying fragmented relations in a distributed database

Cited in

(2)

• Low-complexity aggregation in GraphLog and Datalog
• Parallel processing of graph reachability in databases

This page was built for publication: Complex transitive closure queries on a fragmented graph

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