Solving Queries by Tree Projections

@article{Sagiv1993SolvingQB,
  title={Solving Queries by Tree Projections},
  author={Yehoshua Sagiv and Oded Shmueli},
  journal={ACM Trans. Database Syst.},
  year={1993},
  volume={18},
  pages={487-511}
}
Suppose a database schema <bold>D</bold> is extended to <bold>D¯</bold> by adding new relation schemas, and states for <bold>D</bold> are extended to states for <bold>D¯</bold> by applying joins and projections to existing relations. It is shown that certain desirable properties that <bold>D¯</bold> has with respect to <bold>D</bold>. These properties amount to the ability to compute efficiently the join of all relations in a state for <bold>D</bold> from an extension of this state over <bold>D… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

Answering Queries : Tractable Cases and OptimizationsFrancesco

OptimizationsFrancesco, ScarcelloD
2001
View 2 Excerpts

References

Publications referenced by this paper.

Power of Natural Semijoins

SIAM J. Comput. • 1981
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…