The Tree Property Is Fundamental For Query Processing (Extended Abstract)
Summary: Partition schemas into tree vs cyclic; prove that computing full-join projections using join/project/semijoin is equivalent to constructing an embedded tree schema (a tree projection). Use tree projections to characterize solvability and bound the number of joins required. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. N. Goodman
- 2. O. Shmueli
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 261 | Maintenance Of Views | 1984 | SIGMOD | 0.00029976111 |
| 1,345 | On the Design of a Query Processing Strategy in a Distributed Database Environment | 1983 | SIGMOD | 0.0001247541 |
| 2,473 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7048914e-05 |
| 3,205 | Elimination of Intersection Anomalies from Database Schemes (Extended Abstract) | 1983 | PODS | 7.3865318e-05 |
| 4,030 | On the Recognition and Design of Acyclic Databases | 1984 | PODS | 6.5149364e-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 |
| 8,136 | On the Cyclic to Acyclic Scheme Transformation and Solving Cyclic Queries (Extended Abstract) | 1984 | PODS | 4.5739301e-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 |
|---|---|---|---|---|
| 38 | Testing Implications Of Data Dependencies | 1979 | SIGMOD | 0.0007528369 |
Previous
Page 1 / 1
Next