Optimal Semijoin Schedules For Query Processing In Local Distributed Database Systems
Summary: Extends semijoin planning to bus/loop networks with broadcast, accounting for local processing costs and capacity in a minimum response-time schedule. Shows NP-hardness for general tree queries even on 1-bus and many m-bus cases; polynomial-time only for simple 1-bus queries. (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 |
|---|---|---|---|---|
| 2,391 | Processing Queries Over Generalization Hierarchies in a Multidatabase System | 1983 | VLDB | 8.9022915e-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 1 of 1 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 |
Previous
Page 1 / 1
Next