Parallel processing of graph reachability in databases

Journal Article · Sat Aug 01 00:00:00 EDT 1992 · International Journal of Parallel Programming; (United States)

DOI:https://doi.org/10.1007/BF01421676· OSTI ID:7240760

Wolfson, O ^[1]; Zhang, W ^[2]; Butani, H ^[1]; Kawaguchi, A; Mok, K ^[3]

---

1. Univ. of Illinois, Chicago, IL (United States)
2. Univ. of Lethbridge, Alberta (Canada)
3. Columbia Univ., New York, NY (United States)

In this paper we consider parallel processing of a graph represented by a database relation, and we achieved two objectives. First, we propose a methodology for analyzing the speedup of a parallel processing strategy with the purpose of selecting at runtime one of several candidate strategies, depending the hardware architecture and the input graph. Second, we study the single source reachability problem, namely the problem of computing the set of nodes reachable from a given node in a directed graph. We propose several parallel strategies for solving this problem, and we analyze their performance using our new methodology. The analysis is confirmed experimentally in a UNIX-Ethernet environment. We also extend the results to the transitive closure problem.

• OSTI ID: 7240760
• Journal Information: International Journal of Parallel Programming; (United States), Vol. 21:4; ISSN 0885-7458
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
DATA BASE MANAGEMENT
PARALLEL PROCESSING
DATA-FLOW PROCESSING
OPTIMIZATION
ALGORITHMS
MANAGEMENT
MATHEMATICAL LOGIC
PROGRAMMING
990200* - Mathematics & Computers