The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract)
Summary: Establishes that the ability to compute the join of all relations from extensions of a state over D is equivalent to the existence of a tree projection of D' onto D (holds for unrestricted DBs). If added schemas form a tree schema, equivalence holds for finite DBs and tree-projection existence is testable in polynomial time. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yehoshua Sagiv (Hebrew University; Stanford University)
- 2. Oded Shmueli (Technion)
BibTeX Citation
@inproceedings{sagiv_pods86,
address = {New York, NY, USA},
series = {{PODS} '86},
title = {{The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/6012.15413},
doi = {10.1145/6012.15413},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Sagiv, Yehoshua and Shmueli, Oded},
year = {1986}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13,084 | Avoiding Cartesian Products in Programs for Multiple Joins (Extended Abstract) | 1992 | PODS | 5.093636e-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 |
|---|---|---|---|---|
| 40 | Testing Implications Of Data Dependencies | 1979 | SIGMOD | 0.00046918506 |
| 134 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00030343737 |
| 3,527 | Functional Dependencies on Cyclic Database Schemes | 1983 | SIGMOD | 7.3428228e-05 |
| 5,069 | Query Processing For Distributed Databases Using Generalized Semi-Joins | 1982 | SIGMOD | 6.3768665e-05 |
| 5,140 | Transforming Cyclic Schemas Into Trees (Extended Abstract) | 1982 | PODS | 6.3489846e-05 |
| 5,311 | Query Processing Utilizing Dependencies And Horizontal Decomposition | 1983 | SIGMOD | 6.2700856e-05 |
| 5,526 | Gyo Reductions, Canonical Connections, Tree And Cyclic Schemas And Tree Projections | 1983 | PODS | 6.1864862e-05 |
| 6,698 | Properties Of Database Schemata With Functional Dependencies | 1984 | PODS | 5.7985588e-05 |
| 8,395 | On the Cyclic to Acyclic Scheme Transformation and Solving Cyclic Queries (Extended Abstract) | 1984 | PODS | 5.4347277e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,643 | Conjunctive Query Equivalence of Keyed Relational Schemas (Extended Abstract) | 1997 | PODS |
| 2 | 10,169 | Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries | 2026 | PODS |
| 3 | 3,551 | Efficient Query Answering in the Representative Instance Approach | 1985 | PODS |
| 4 | 7,029 | Tree-Width and Functional Dependencies in Databases | 2008 | PODS |
| 5 | 7,132 | Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions | 1984 | SIGMOD |
| 6 | 2,138 | Flexible Queries over Semistructured Data | 2001 | PODS |
| 7 | 5,593 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB |
| 8 | 7,759 | The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability | 2010 | PODS |
| 9 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 10 | 2,102 | The Tree Property Is Fundamental For Query Processing (Extended Abstract) | 1982 | PODS |