Attribute Agreement
Summary: Introduce the tagged semijoin: a semijoin variant that, by adding attributes to all relation schemes, achieves full reduction for arbitrary (including cyclic) schemas without acyclicity. Recast full-reduction as an Attribute Agreement problem across distributed sites with local allowed tuples and privacy constraints, showing tagged semijoins prune globally-incompatible combinations and tag a unique agreeable tuple per site, and provide an explicit algorithm. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Y. C. Tay
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 79 | An Amateur's Introduction to Recursive Query Processing Strategies | 1986 | SIGMOD | 0.00056010993 |
| 5,036 | Query Processing For Distributed Databases Using Generalized Semi-Joins | 1982 | SIGMOD | 5.7403975e-05 |
| 5,151 | Gyo Reductions, Canonical Connections, Tree And Cyclic Schemas And Tree Projections | 1983 | PODS | 5.6551e-05 |
| 5,161 | Query Processing Utilizing Dependencies And Horizontal Decomposition | 1983 | SIGMOD | 5.6499987e-05 |