Semi-Join Algorithms For Multiprocessor Systems
Summary: Proposes semi-join algorithms for multiprocessor DB machines, with an architecture model that includes I/O, CPU, and inter-processor messaging costs. Compares two equi-semi-join variants and one inequij-semi-join, showing semi-join methods cut communication and scale linearly with operand size and processor count. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,093 | Range Nesting: A Fast Method To Evaluate Quantified Queries | 1983 | SIGMOD | 5.7026228e-05 |
| 8,781 | Accelerate Distributed Joins with Predicate Transfer | 2025 | SIGMOD | 4.4534753e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 700 | A Methodology For Interpreting Tree Queries Into Optimal Semi-Join Expressions | 1980 | SIGMOD | 0.00017948517 |
| 1,434 | Query Execution in DIRECT | 1979 | SIGMOD | 0.00012008543 |
Previous
Page 1 / 1
Next