Parallel processing of graph reachability in databases

DOI10.1007/BF01421676MaRDI QIDQ688834zbMATH OpenFDO

Authors Ouri Wolfson, Weining Zhang, Harish Butani, Akira Kawaguchi, Kui W. Mok

Publication date 6 December 1993

Published in International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01421676

zbMATH Keywords

samplingtransitive closuredata reduction paradigmgraph reachabilityparallel and distributed databases

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4117855
• Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs
• On the parallel complexity of digraph reachability
• scientific article; zbMATH DE number 5033869
• Database machines. 6th international workshop, IWDM '89, Deauville, France, June 19-21, 1989. Proceedings

Cites work

• scientific article; zbMATH DE number 219224 (Why is no real title available?)
• Parallel processing of graph reachability in databases
• The longest path in a random graph
• The transitive closure of a random digraph

Cited in

(10)

• Parallel preprocessing for path queries without concurrent reading.
• Parallel processing of graph reachability in databases
• Performance evaluation of a parallel cascade semijoin algorithm for computing path expressions in object database systems
• Parallel Processing and Applied Mathematics
• scientific article; zbMATH DE number 1941144 (Why is no real title available?)
• scientific article; zbMATH DE number 822167 (Why is no real title available?)
• MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters
• A graph transformation algorithm for concurrency control in a partitioned database
• scientific article; zbMATH DE number 5033869 (Why is no real title available?)
• A parallel query processing system based on graph-based database partitioning

This page was built for publication: Parallel processing of graph reachability in databases

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