Implementation and performance evaluation of a parallel transitive closure algorithm on PRISMA/DB
Summary: Implements the Disconnection Set Approach for parallel transitive closure in the PRISMA/DB main-memory relational system. Experiments show strong, sometimes superlinear speedups over semi-naive evaluation, while exposing fragmentation’s key impact on scalability. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Maurice A.W. Houtsma (University of Twente)
- 2. Annita N. Wilschut (University of Twente)
- 3. Jan Flokstra (University of Twente)
BibTeX Citation
@article{houtsma_vldb93,
title = {{Implementation and performance evaluation of a parallel transitive closure algorithm on PRISMA/DB}},
author = {Houtsma, Maurice A.W. and Wilschut, Annita N. and Flokstra, Jan},
journal = {PVLDB},
series = {{VLDB} '93},
year = {1993}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,272 | Parallel evaluation of multi-join queries | 1995 | SIGMOD | 8.8242407e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 16 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS | 0.00060089598 |
| 1,259 | On the Computation of the Transitive Closure of Relational Operators | 1986 | VLDB | 0.00011437537 |
| 2,247 | A Framework for the Parallel Processing of Datalog Queries | 1990 | SIGMOD | 8.8713691e-05 |
| 3,076 | A New Paradigm For Parallel And Distributed Rule-Processing | 1990 | SIGMOD | 7.7817058e-05 |
| 3,090 | Parallelism in a Main-Memory DBMS: The performance of PRISMA/DB | 1992 | VLDB | 7.7686303e-05 |
| 4,634 | Translation and Optimization of Logic Queries: The Algebraic Approach | 1986 | VLDB | 6.5930956e-05 |
| 5,341 | Distributed Transitive Closure Computations: The Disconnection Set Approach | 1990 | VLDB | 6.2602701e-05 |
| 6,594 | A File Structure Supporting Traversal Recursion | 1989 | SIGMOD | 5.8296302e-05 |
| 8,775 | A Parallel Strategy for Transitive Closure using Double Hash-Based Clustering | 1990 | VLDB | 5.3766157e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,651 | On the Design of a Query Processing Strategy in a Distributed Database Environment | 1983 | SIGMOD |
| 2 | 11,745 | Parallel Traversal of Graphs Stored in RDBMSs | 2020 | CIDR |
| 3 | 1,114 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB |
| 4 | 3,491 | A Performance Study Of Transitive Closure Algorithms | 1994 | SIGMOD |
| 5 | 1,086 | New Strategies for Computing the Transitive Closure of a Database Relation | 1987 | VLDB |
| 6 | 1,330 | Efficient Transitive Closure Algorithms | 1988 | VLDB |
| 7 | 2,272 | Parallel evaluation of multi-join queries | 1995 | SIGMOD |
| 8 | 3,090 | Parallelism in a Main-Memory DBMS: The performance of PRISMA/DB | 1992 | VLDB |
| 9 | 8,775 | A Parallel Strategy for Transitive Closure using Double Hash-Based Clustering | 1990 | VLDB |
| 10 | 5,341 | Distributed Transitive Closure Computations: The Disconnection Set Approach | 1990 | VLDB |